Quantum Rainbow Codes: Achieving Linear Rate, Growing Distance and Transversal Non-Clifford Gates with Generalised Colour Codes Article Swipe

PDF

Thomas R. Scruby , Arthur Pesah , Mark Webster ·

YOU? · · 2024 · Open Access · · DOI: https://doi.org/10.48550/arxiv.2408.13130

We introduce rainbow codes, a novel class of quantum error correcting codes generalising colour codes and pin codes. Rainbow codes can be defined on any $D$-dimensional simplicial complex that admits a valid $(D + 1)$-colouring of its $0$-simplices. We study in detail the case where these simplicial complexes are derived from chain complexes obtained via the hypergraph product and, by reinterpreting these codes as collections of colour codes joined at domain walls, show that we can obtain code families with growing distance and number of encoded qubits as well as logical non-Clifford gates implemented by transversal application of $T$ and $T^†$. By combining these techniques with the quasi-hyperbolic colour codes of Zhu et al. (arXiv:2310.16982) we obtain a family of codes with transversal non-Clifford gates and parameters $[\![n, Θ(n), Θ(log(n))]\!]$. This is the first example of a family of LDPC codes with linear rate, growing distance and transversal non-Clifford gates, which are necessary conditions for the magic-state distillation parameter $γ=\textrm{log}_d (n/k)$ to be made arbitrarily small. In contrast to several other constructions that satisfy these requirements, our codes are natively defined on qubits, are LDPC, and have non-Clifford gates implementable by single-qubit (rather than entangling) physical operations, but are not asymptotically good.

Related Topics

Concepts

Rainbow Quantum Computer science Physics Quantum mechanics

Metadata

Type: preprint
Language: en
Landing Page: http://arxiv.org/abs/2408.13130
PDF: https://arxiv.org/pdf/2408.13130
OA Status: green
Cited By: 2
Related Works: 10
OpenAlex ID: https://openalex.org/W4402699727

All OpenAlex metadata

Raw OpenAlex JSON

OpenAlex ID: https://openalex.org/W4402699727

Canonical identifier for this work in OpenAlex
DOI: https://doi.org/10.48550/arxiv.2408.13130

Digital Object Identifier
Title: Quantum Rainbow Codes: Achieving Linear Rate, Growing Distance and Transversal Non-Clifford Gates with Generalised Colour Codes

Work title
Type: preprint

OpenAlex work type
Language: en

Primary language
Publication year: 2024

Year of publication
Publication date: 2024-08-23

Full publication date if available
Authors: Thomas R. Scruby, Arthur Pesah, Mark Webster

List of authors in order
Landing page: https://arxiv.org/abs/2408.13130

Publisher landing page
PDF URL: https://arxiv.org/pdf/2408.13130

Direct link to full text PDF
Open access: Yes

Whether a free full text is available
OA status: green

Open access status per OpenAlex
OA URL: https://arxiv.org/pdf/2408.13130

Direct OA link when available
Concepts: Rainbow, Quantum, Computer science, Physics, Quantum mechanics

Top concepts (fields/topics) attached by OpenAlex
Cited by: 2

Total citation count in OpenAlex
Citations by year (recent): 2025: 2

Per-year citation counts (last 5 years)
Related works (count): 10

Other works algorithmically related by OpenAlex

Full payload

id	https://openalex.org/W4402699727
doi	https://doi.org/10.48550/arxiv.2408.13130
ids.doi	https://doi.org/10.48550/arxiv.2408.13130
ids.openalex	https://openalex.org/W4402699727
fwci
type	preprint
title	Quantum Rainbow Codes: Achieving Linear Rate, Growing Distance and Transversal Non-Clifford Gates with Generalised Colour Codes
biblio.issue
biblio.volume
biblio.last_page
biblio.first_page
topics[0].id	https://openalex.org/T10682
topics[0].field.id	https://openalex.org/fields/17
topics[0].field.display_name	Computer Science
topics[0].score	0.9302999973297119
topics[0].domain.id	https://openalex.org/domains/3
topics[0].domain.display_name	Physical Sciences
topics[0].subfield.id	https://openalex.org/subfields/1702
topics[0].subfield.display_name	Artificial Intelligence
topics[0].display_name	Quantum Computing Algorithms and Architecture
is_xpac	False
apc_list
apc_paid
concepts[0].id	https://openalex.org/C2776558979
concepts[0].level	2
concepts[0].score	0.7857577800750732
concepts[0].wikidata	https://www.wikidata.org/wiki/Q1052
concepts[0].display_name	Rainbow
concepts[1].id	https://openalex.org/C84114770
concepts[1].level	2
concepts[1].score	0.4460865557193756
concepts[1].wikidata	https://www.wikidata.org/wiki/Q46344
concepts[1].display_name	Quantum
concepts[2].id	https://openalex.org/C41008148
concepts[2].level	0
concepts[2].score	0.3676273822784424
concepts[2].wikidata	https://www.wikidata.org/wiki/Q21198
concepts[2].display_name	Computer science
concepts[3].id	https://openalex.org/C121332964
concepts[3].level	0
concepts[3].score	0.3088771402835846
concepts[3].wikidata	https://www.wikidata.org/wiki/Q413
concepts[3].display_name	Physics
concepts[4].id	https://openalex.org/C62520636
concepts[4].level	1
concepts[4].score	0.16150805354118347
concepts[4].wikidata	https://www.wikidata.org/wiki/Q944
concepts[4].display_name	Quantum mechanics
keywords[0].id	https://openalex.org/keywords/rainbow
keywords[0].score	0.7857577800750732
keywords[0].display_name	Rainbow
keywords[1].id	https://openalex.org/keywords/quantum
keywords[1].score	0.4460865557193756
keywords[1].display_name	Quantum
keywords[2].id	https://openalex.org/keywords/computer-science
keywords[2].score	0.3676273822784424
keywords[2].display_name	Computer science
keywords[3].id	https://openalex.org/keywords/physics
keywords[3].score	0.3088771402835846
keywords[3].display_name	Physics
keywords[4].id	https://openalex.org/keywords/quantum-mechanics
keywords[4].score	0.16150805354118347
keywords[4].display_name	Quantum mechanics
language	en
locations[0].id	pmh:oai:arXiv.org:2408.13130
locations[0].is_oa	True
locations[0].source.id	https://openalex.org/S4306400194
locations[0].source.issn
locations[0].source.type	repository
locations[0].source.is_oa	True
locations[0].source.issn_l
locations[0].source.is_core	False
locations[0].source.is_in_doaj	False
locations[0].source.display_name	arXiv (Cornell University)
locations[0].source.host_organization	https://openalex.org/I205783295
locations[0].source.host_organization_name	Cornell University
locations[0].source.host_organization_lineage	https://openalex.org/I205783295
locations[0].license
locations[0].pdf_url	https://arxiv.org/pdf/2408.13130
locations[0].version	submittedVersion
locations[0].raw_type
locations[0].license_id
locations[0].is_accepted	False
locations[0].is_published	False
locations[0].raw_source_name
locations[0].landing_page_url	http://arxiv.org/abs/2408.13130
locations[1].id	doi:10.48550/arxiv.2408.13130
locations[1].is_oa	True
locations[1].source.id	https://openalex.org/S4306400194
locations[1].source.issn
locations[1].source.type	repository
locations[1].source.is_oa	True
locations[1].source.issn_l
locations[1].source.is_core	False
locations[1].source.is_in_doaj	False
locations[1].source.display_name	arXiv (Cornell University)
locations[1].source.host_organization	https://openalex.org/I205783295
locations[1].source.host_organization_name	Cornell University
locations[1].source.host_organization_lineage	https://openalex.org/I205783295
locations[1].license	cc-by
locations[1].pdf_url
locations[1].version
locations[1].raw_type	article
locations[1].license_id	https://openalex.org/licenses/cc-by
locations[1].is_accepted	False
locations[1].is_published
locations[1].raw_source_name
locations[1].landing_page_url	https://doi.org/10.48550/arxiv.2408.13130
indexed_in	arxiv, datacite
authorships[0].author.id	https://openalex.org/A5025375209
authorships[0].author.orcid
authorships[0].author.display_name	Thomas R. Scruby
authorships[0].author_position	first
authorships[0].raw_author_name	Scruby, Thomas R.
authorships[0].is_corresponding	False
authorships[1].author.id	https://openalex.org/A5041188038
authorships[1].author.orcid	https://orcid.org/0000-0002-5759-6314
authorships[1].author.display_name	Arthur Pesah
authorships[1].author_position	middle
authorships[1].raw_author_name	Pesah, Arthur
authorships[1].is_corresponding	False
authorships[2].author.id	https://openalex.org/A5102859217
authorships[2].author.orcid	https://orcid.org/0000-0002-5300-1643
authorships[2].author.display_name	Mark Webster
authorships[2].author_position	last
authorships[2].raw_author_name	Webster, Mark
authorships[2].is_corresponding	False
has_content.pdf	False
has_content.grobid_xml	False
is_paratext	False
open_access.is_oa	True
open_access.oa_url	https://arxiv.org/pdf/2408.13130
open_access.oa_status	green
open_access.any_repository_has_fulltext	False
created_date	2025-10-10T00:00:00
display_name	Quantum Rainbow Codes: Achieving Linear Rate, Growing Distance and Transversal Non-Clifford Gates with Generalised Colour Codes
has_fulltext	False
is_retracted	False
updated_date	2025-12-17T22:08:43.090829
primary_topic.id	https://openalex.org/T10682
primary_topic.field.id	https://openalex.org/fields/17
primary_topic.field.display_name	Computer Science
primary_topic.score	0.9302999973297119
primary_topic.domain.id	https://openalex.org/domains/3
primary_topic.domain.display_name	Physical Sciences
primary_topic.subfield.id	https://openalex.org/subfields/1702
primary_topic.subfield.display_name	Artificial Intelligence
primary_topic.display_name	Quantum Computing Algorithms and Architecture
related_works	https://openalex.org/W4391375266, https://openalex.org/W2748952813, https://openalex.org/W2935759653, https://openalex.org/W3105167352, https://openalex.org/W54078636, https://openalex.org/W2394414377, https://openalex.org/W2954470139, https://openalex.org/W2386551956, https://openalex.org/W1501425562, https://openalex.org/W2902782467
cited_by_count	2
counts_by_year[0].year	2025
counts_by_year[0].cited_by_count	2
locations_count	2
best_oa_location.id	pmh:oai:arXiv.org:2408.13130
best_oa_location.is_oa	True
best_oa_location.source.id	https://openalex.org/S4306400194
best_oa_location.source.issn
best_oa_location.source.type	repository
best_oa_location.source.is_oa	True
best_oa_location.source.issn_l
best_oa_location.source.is_core	False
best_oa_location.source.is_in_doaj	False
best_oa_location.source.display_name	arXiv (Cornell University)
best_oa_location.source.host_organization	https://openalex.org/I205783295
best_oa_location.source.host_organization_name	Cornell University
best_oa_location.source.host_organization_lineage	https://openalex.org/I205783295
best_oa_location.license
best_oa_location.pdf_url	https://arxiv.org/pdf/2408.13130
best_oa_location.version	submittedVersion
best_oa_location.raw_type
best_oa_location.license_id
best_oa_location.is_accepted	False
best_oa_location.is_published	False
best_oa_location.raw_source_name
best_oa_location.landing_page_url	http://arxiv.org/abs/2408.13130
primary_location.id	pmh:oai:arXiv.org:2408.13130
primary_location.is_oa	True
primary_location.source.id	https://openalex.org/S4306400194
primary_location.source.issn
primary_location.source.type	repository
primary_location.source.is_oa	True
primary_location.source.issn_l
primary_location.source.is_core	False
primary_location.source.is_in_doaj	False
primary_location.source.display_name	arXiv (Cornell University)
primary_location.source.host_organization	https://openalex.org/I205783295
primary_location.source.host_organization_name	Cornell University
primary_location.source.host_organization_lineage	https://openalex.org/I205783295
primary_location.license
primary_location.pdf_url	https://arxiv.org/pdf/2408.13130
primary_location.version	submittedVersion
primary_location.raw_type
primary_location.license_id
primary_location.is_accepted	False
primary_location.is_published	False
primary_location.raw_source_name
primary_location.landing_page_url	http://arxiv.org/abs/2408.13130
publication_date	2024-08-23
publication_year	2024
referenced_works_count	0
abstract_inverted_index.+	33
abstract_inverted_index.a	4, 30, 117, 136
abstract_inverted_index.By	101
abstract_inverted_index.In	166
abstract_inverted_index.We	0, 38
abstract_inverted_index.as	63, 87, 89
abstract_inverted_index.at	69
abstract_inverted_index.be	21, 162
abstract_inverted_index.by	59, 94, 190
abstract_inverted_index.et	112
abstract_inverted_index.in	40
abstract_inverted_index.is	131
abstract_inverted_index.of	7, 35, 65, 84, 97, 110, 119, 135, 138
abstract_inverted_index.on	23, 181
abstract_inverted_index.to	161, 168
abstract_inverted_index.we	74, 115
abstract_inverted_index.$(D	32
abstract_inverted_index.$T$	98
abstract_inverted_index.Zhu	111
abstract_inverted_index.al.	113
abstract_inverted_index.and	15, 82, 99, 125, 146, 185
abstract_inverted_index.any	24
abstract_inverted_index.are	48, 151, 178, 183, 198
abstract_inverted_index.but	197
abstract_inverted_index.can	20, 75
abstract_inverted_index.for	154
abstract_inverted_index.its	36
abstract_inverted_index.not	199
abstract_inverted_index.our	176
abstract_inverted_index.pin	16
abstract_inverted_index.the	42, 55, 106, 132, 155
abstract_inverted_index.via	54
abstract_inverted_index.LDPC	139
abstract_inverted_index.This	130
abstract_inverted_index.and,	58
abstract_inverted_index.case	43
abstract_inverted_index.code	77
abstract_inverted_index.from	50
abstract_inverted_index.have	186
abstract_inverted_index.made	163
abstract_inverted_index.show	72
abstract_inverted_index.than	193
abstract_inverted_index.that	28, 73, 172
abstract_inverted_index.well	88
abstract_inverted_index.with	79, 105, 121, 141
abstract_inverted_index.LDPC,	184
abstract_inverted_index.chain	51
abstract_inverted_index.class	6
abstract_inverted_index.codes	11, 14, 19, 62, 67, 109, 120, 140, 177
abstract_inverted_index.error	9
abstract_inverted_index.first	133
abstract_inverted_index.gates	92, 124, 188
abstract_inverted_index.good.	201
abstract_inverted_index.novel	5
abstract_inverted_index.other	170
abstract_inverted_index.rate,	143
abstract_inverted_index.study	39
abstract_inverted_index.these	45, 61, 103, 174
abstract_inverted_index.valid	31
abstract_inverted_index.where	44
abstract_inverted_index.which	150
abstract_inverted_index.(n/k)$	160
abstract_inverted_index.admits	29
abstract_inverted_index.codes,	3
abstract_inverted_index.codes.	17
abstract_inverted_index.colour	13, 66, 108
abstract_inverted_index.detail	41
abstract_inverted_index.domain	70
abstract_inverted_index.family	118, 137
abstract_inverted_index.gates,	149
abstract_inverted_index.joined	68
abstract_inverted_index.linear	142
abstract_inverted_index.number	83
abstract_inverted_index.obtain	76, 116
abstract_inverted_index.qubits	86
abstract_inverted_index.small.	165
abstract_inverted_index.walls,	71
abstract_inverted_index.Θ(n),	128
abstract_inverted_index.$[\![n,	127
abstract_inverted_index.(rather	192
abstract_inverted_index.Rainbow	18
abstract_inverted_index.complex	27
abstract_inverted_index.defined	22, 180
abstract_inverted_index.derived	49
abstract_inverted_index.encoded	85
abstract_inverted_index.example	134
abstract_inverted_index.growing	80, 144
abstract_inverted_index.logical	90
abstract_inverted_index.product	57
abstract_inverted_index.quantum	8
abstract_inverted_index.qubits,	182
abstract_inverted_index.rainbow	2
abstract_inverted_index.satisfy	173
abstract_inverted_index.several	169
abstract_inverted_index.$T^†$.	100
abstract_inverted_index.contrast	167
abstract_inverted_index.distance	81, 145
abstract_inverted_index.families	78
abstract_inverted_index.natively	179
abstract_inverted_index.obtained	53
abstract_inverted_index.physical	195
abstract_inverted_index.combining	102
abstract_inverted_index.complexes	47, 52
abstract_inverted_index.introduce	1
abstract_inverted_index.necessary	152
abstract_inverted_index.parameter	158
abstract_inverted_index.conditions	153
abstract_inverted_index.correcting	10
abstract_inverted_index.hypergraph	56
abstract_inverted_index.parameters	126
abstract_inverted_index.simplicial	26, 46
abstract_inverted_index.techniques	104
abstract_inverted_index.application	96
abstract_inverted_index.arbitrarily	164
abstract_inverted_index.collections	64
abstract_inverted_index.entangling)	194
abstract_inverted_index.implemented	93
abstract_inverted_index.magic-state	156
abstract_inverted_index.operations,	196
abstract_inverted_index.transversal	95, 122, 147
abstract_inverted_index.distillation	157
abstract_inverted_index.generalising	12
abstract_inverted_index.non-Clifford	91, 123, 148, 187
abstract_inverted_index.single-qubit	191
abstract_inverted_index.1)$-colouring	34
abstract_inverted_index.constructions	171
abstract_inverted_index.implementable	189
abstract_inverted_index.requirements,	175
abstract_inverted_index.$0$-simplices.	37
abstract_inverted_index.asymptotically	200
abstract_inverted_index.reinterpreting	60
abstract_inverted_index.$D$-dimensional	25
abstract_inverted_index.quasi-hyperbolic	107
abstract_inverted_index.Θ(log(n))]\!]$.	129
abstract_inverted_index.$γ=\textrm{log}_d	159
abstract_inverted_index.(arXiv:2310.16982)	114
cited_by_percentile_year
countries_distinct_count	0
institutions_distinct_count	3
citation_normalized_percentile