CNOT circuits need little help to implement arbitrary Hadamard-free Clifford transformations they generate Article Swipe
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.1038/s41534-023-00760-2
A Hadamard-free Clifford transformation is a circuit composed of quantum Phase (P), CZ, and CNOT gates. It is known that such a circuit can be written as a three-stage computation, -P-CZ-CNOT-, where each stage consists only of gates of the specified type. In this paper, we focus on the minimization of circuit depth by entangling gates, corresponding to the important time-to-solution metric and the reduction of noise due to decoherence. We consider two popular connectivity maps: Linear Nearest Neighbor (LNN) and all-to-all. First, we show that a Hadamard-free Clifford operation can be implemented over LNN in depth 5 n , i.e., in the same depth as the -CNOT- stage alone. This allows us to implement arbitrary Clifford transformation over LNN in depth no more than 7 n − 4, improving the best previous upper bound of 9 n . Second, we report heuristic evidence that on average a random uniformly distributed Hadamard-free Clifford transformation over n > 6 qubits can be implemented with only a tiny additive overhead over all-to-all connected architecture compared to the best-known depth-optimized implementation of the -CNOT- stage alone. This suggests the reduction of the depth of Clifford circuits from $$2n\,+\,O({\log }^{2}(n))$$ to $$1.5n\,+\,O({\log }^{2}(n))$$ over unrestricted architectures.
Related Topics
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1038/s41534-023-00760-2
- https://www.nature.com/articles/s41534-023-00760-2.pdf
- OA Status
- gold
- Cited By
- 8
- References
- 19
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4387187848
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4387187848Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1038/s41534-023-00760-2Digital Object Identifier
- Title
-
CNOT circuits need little help to implement arbitrary Hadamard-free Clifford transformations they generateWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2023Year of publication
- Publication date
-
2023-09-29Full publication date if available
- Authors
-
Dmitri Maslov, Willers YangList of authors in order
- Landing page
-
https://doi.org/10.1038/s41534-023-00760-2Publisher landing page
- PDF URL
-
https://www.nature.com/articles/s41534-023-00760-2.pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://www.nature.com/articles/s41534-023-00760-2.pdfDirect OA link when available
- Concepts
-
Hadamard transform, Controlled NOT gate, Quantum computer, Algorithm, Computer science, Transformation (genetics), Quantum circuit, Quantum gate, Physics, Quantum mechanics, Quantum, Quantum error correction, Chemistry, Biochemistry, GeneTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
8Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 3, 2024: 3, 2023: 1, 2022: 1Per-year citation counts (last 5 years)
- References (count)
-
19Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4387187848 |
|---|---|
| doi | https://doi.org/10.1038/s41534-023-00760-2 |
| ids.doi | https://doi.org/10.1038/s41534-023-00760-2 |
| ids.openalex | https://openalex.org/W4387187848 |
| fwci | 1.78810021 |
| type | article |
| title | CNOT circuits need little help to implement arbitrary Hadamard-free Clifford transformations they generate |
| biblio.issue | 1 |
| biblio.volume | 9 |
| 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 | 1.0 |
| 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 |
| topics[1].id | https://openalex.org/T10020 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9987999796867371 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1702 |
| topics[1].subfield.display_name | Artificial Intelligence |
| topics[1].display_name | Quantum Information and Cryptography |
| topics[2].id | https://openalex.org/T13182 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9984999895095825 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1703 |
| topics[2].subfield.display_name | Computational Theory and Mathematics |
| topics[2].display_name | Quantum-Dot Cellular Automata |
| is_xpac | False |
| apc_list.value | 3790 |
| apc_list.currency | USD |
| apc_list.value_usd | 3790 |
| apc_paid.value | 3790 |
| apc_paid.currency | USD |
| apc_paid.value_usd | 3790 |
| concepts[0].id | https://openalex.org/C60292330 |
| concepts[0].level | 2 |
| concepts[0].score | 0.6928236484527588 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q1014065 |
| concepts[0].display_name | Hadamard transform |
| concepts[1].id | https://openalex.org/C182953411 |
| concepts[1].level | 5 |
| concepts[1].score | 0.6832618117332458 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q917713 |
| concepts[1].display_name | Controlled NOT gate |
| concepts[2].id | https://openalex.org/C58053490 |
| concepts[2].level | 3 |
| concepts[2].score | 0.5790764093399048 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q176555 |
| concepts[2].display_name | Quantum computer |
| concepts[3].id | https://openalex.org/C11413529 |
| concepts[3].level | 1 |
| concepts[3].score | 0.5325006246566772 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[3].display_name | Algorithm |
| concepts[4].id | https://openalex.org/C41008148 |
| concepts[4].level | 0 |
| concepts[4].score | 0.5024938583374023 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[4].display_name | Computer science |
| concepts[5].id | https://openalex.org/C204241405 |
| concepts[5].level | 3 |
| concepts[5].score | 0.47102245688438416 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q461499 |
| concepts[5].display_name | Transformation (genetics) |
| concepts[6].id | https://openalex.org/C124148022 |
| concepts[6].level | 5 |
| concepts[6].score | 0.4605966806411743 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q2122210 |
| concepts[6].display_name | Quantum circuit |
| concepts[7].id | https://openalex.org/C58849907 |
| concepts[7].level | 4 |
| concepts[7].score | 0.27150022983551025 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q2118982 |
| concepts[7].display_name | Quantum gate |
| concepts[8].id | https://openalex.org/C121332964 |
| concepts[8].level | 0 |
| concepts[8].score | 0.17017889022827148 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q413 |
| concepts[8].display_name | Physics |
| concepts[9].id | https://openalex.org/C62520636 |
| concepts[9].level | 1 |
| concepts[9].score | 0.1656353771686554 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q944 |
| concepts[9].display_name | Quantum mechanics |
| concepts[10].id | https://openalex.org/C84114770 |
| concepts[10].level | 2 |
| concepts[10].score | 0.16507261991500854 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q46344 |
| concepts[10].display_name | Quantum |
| concepts[11].id | https://openalex.org/C51003876 |
| concepts[11].level | 4 |
| concepts[11].score | 0.14483627676963806 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q1536431 |
| concepts[11].display_name | Quantum error correction |
| concepts[12].id | https://openalex.org/C185592680 |
| concepts[12].level | 0 |
| concepts[12].score | 0.11203211545944214 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q2329 |
| concepts[12].display_name | Chemistry |
| concepts[13].id | https://openalex.org/C55493867 |
| concepts[13].level | 1 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q7094 |
| concepts[13].display_name | Biochemistry |
| concepts[14].id | https://openalex.org/C104317684 |
| concepts[14].level | 2 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q7187 |
| concepts[14].display_name | Gene |
| keywords[0].id | https://openalex.org/keywords/hadamard-transform |
| keywords[0].score | 0.6928236484527588 |
| keywords[0].display_name | Hadamard transform |
| keywords[1].id | https://openalex.org/keywords/controlled-not-gate |
| keywords[1].score | 0.6832618117332458 |
| keywords[1].display_name | Controlled NOT gate |
| keywords[2].id | https://openalex.org/keywords/quantum-computer |
| keywords[2].score | 0.5790764093399048 |
| keywords[2].display_name | Quantum computer |
| keywords[3].id | https://openalex.org/keywords/algorithm |
| keywords[3].score | 0.5325006246566772 |
| keywords[3].display_name | Algorithm |
| keywords[4].id | https://openalex.org/keywords/computer-science |
| keywords[4].score | 0.5024938583374023 |
| keywords[4].display_name | Computer science |
| keywords[5].id | https://openalex.org/keywords/transformation |
| keywords[5].score | 0.47102245688438416 |
| keywords[5].display_name | Transformation (genetics) |
| keywords[6].id | https://openalex.org/keywords/quantum-circuit |
| keywords[6].score | 0.4605966806411743 |
| keywords[6].display_name | Quantum circuit |
| keywords[7].id | https://openalex.org/keywords/quantum-gate |
| keywords[7].score | 0.27150022983551025 |
| keywords[7].display_name | Quantum gate |
| keywords[8].id | https://openalex.org/keywords/physics |
| keywords[8].score | 0.17017889022827148 |
| keywords[8].display_name | Physics |
| keywords[9].id | https://openalex.org/keywords/quantum-mechanics |
| keywords[9].score | 0.1656353771686554 |
| keywords[9].display_name | Quantum mechanics |
| keywords[10].id | https://openalex.org/keywords/quantum |
| keywords[10].score | 0.16507261991500854 |
| keywords[10].display_name | Quantum |
| keywords[11].id | https://openalex.org/keywords/quantum-error-correction |
| keywords[11].score | 0.14483627676963806 |
| keywords[11].display_name | Quantum error correction |
| keywords[12].id | https://openalex.org/keywords/chemistry |
| keywords[12].score | 0.11203211545944214 |
| keywords[12].display_name | Chemistry |
| language | en |
| locations[0].id | doi:10.1038/s41534-023-00760-2 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S2738600312 |
| locations[0].source.issn | 2056-6387 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2056-6387 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | True |
| locations[0].source.display_name | npj Quantum Information |
| locations[0].source.host_organization | https://openalex.org/P4310319908 |
| locations[0].source.host_organization_name | Nature Portfolio |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310319908, https://openalex.org/P4310319965 |
| locations[0].source.host_organization_lineage_names | Nature Portfolio, Springer Nature |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://www.nature.com/articles/s41534-023-00760-2.pdf |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | npj Quantum Information |
| locations[0].landing_page_url | https://doi.org/10.1038/s41534-023-00760-2 |
| locations[1].id | pmh:oai:doaj.org/article:213423752f75487483397d30d34bf1c5 |
| locations[1].is_oa | False |
| locations[1].source.id | https://openalex.org/S4306401280 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | DOAJ (DOAJ: Directory of Open Access Journals) |
| locations[1].source.host_organization | |
| locations[1].source.host_organization_name | |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | npj Quantum Information, Vol 9, Iss 1, Pp 1-9 (2023) |
| locations[1].landing_page_url | https://doaj.org/article/213423752f75487483397d30d34bf1c5 |
| indexed_in | crossref, doaj |
| authorships[0].author.id | https://openalex.org/A5082889085 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-7381-4556 |
| authorships[0].author.display_name | Dmitri Maslov |
| authorships[0].countries | US |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I1341412227 |
| authorships[0].affiliations[0].raw_affiliation_string | IBM Quantum, IBM T. J. Watson Research Center, Yorktown Heights, NY, 10598, USA |
| authorships[0].institutions[0].id | https://openalex.org/I1341412227 |
| authorships[0].institutions[0].ror | https://ror.org/05hh8d621 |
| authorships[0].institutions[0].type | company |
| authorships[0].institutions[0].lineage | https://openalex.org/I1341412227 |
| authorships[0].institutions[0].country_code | US |
| authorships[0].institutions[0].display_name | IBM (United States) |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Dmitri Maslov |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | IBM Quantum, IBM T. J. Watson Research Center, Yorktown Heights, NY, 10598, USA |
| authorships[1].author.id | https://openalex.org/A5078401771 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Willers Yang |
| authorships[1].countries | US |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I1341412227 |
| authorships[1].affiliations[0].raw_affiliation_string | IBM Quantum, IBM T. J. Watson Research Center, Yorktown Heights, NY, 10598, USA |
| authorships[1].institutions[0].id | https://openalex.org/I1341412227 |
| authorships[1].institutions[0].ror | https://ror.org/05hh8d621 |
| authorships[1].institutions[0].type | company |
| authorships[1].institutions[0].lineage | https://openalex.org/I1341412227 |
| authorships[1].institutions[0].country_code | US |
| authorships[1].institutions[0].display_name | IBM (United States) |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Willers Yang |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | IBM Quantum, IBM T. J. Watson Research Center, Yorktown Heights, NY, 10598, USA |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.nature.com/articles/s41534-023-00760-2.pdf |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2023-09-30T00:00:00 |
| display_name | CNOT circuits need little help to implement arbitrary Hadamard-free Clifford transformations they generate |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| 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 | 1.0 |
| 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/W3200714110, https://openalex.org/W4320854618, https://openalex.org/W4385261786, https://openalex.org/W4387917696, https://openalex.org/W2009848941, https://openalex.org/W2065516801, https://openalex.org/W4390437697, https://openalex.org/W2066640878, https://openalex.org/W3092615945, https://openalex.org/W2808177279 |
| cited_by_count | 8 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 3 |
| counts_by_year[1].year | 2024 |
| counts_by_year[1].cited_by_count | 3 |
| counts_by_year[2].year | 2023 |
| counts_by_year[2].cited_by_count | 1 |
| counts_by_year[3].year | 2022 |
| counts_by_year[3].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | doi:10.1038/s41534-023-00760-2 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S2738600312 |
| best_oa_location.source.issn | 2056-6387 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2056-6387 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | True |
| best_oa_location.source.display_name | npj Quantum Information |
| best_oa_location.source.host_organization | https://openalex.org/P4310319908 |
| best_oa_location.source.host_organization_name | Nature Portfolio |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310319908, https://openalex.org/P4310319965 |
| best_oa_location.source.host_organization_lineage_names | Nature Portfolio, Springer Nature |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://www.nature.com/articles/s41534-023-00760-2.pdf |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | npj Quantum Information |
| best_oa_location.landing_page_url | https://doi.org/10.1038/s41534-023-00760-2 |
| primary_location.id | doi:10.1038/s41534-023-00760-2 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S2738600312 |
| primary_location.source.issn | 2056-6387 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2056-6387 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | True |
| primary_location.source.display_name | npj Quantum Information |
| primary_location.source.host_organization | https://openalex.org/P4310319908 |
| primary_location.source.host_organization_name | Nature Portfolio |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310319908, https://openalex.org/P4310319965 |
| primary_location.source.host_organization_lineage_names | Nature Portfolio, Springer Nature |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://www.nature.com/articles/s41534-023-00760-2.pdf |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | npj Quantum Information |
| primary_location.landing_page_url | https://doi.org/10.1038/s41534-023-00760-2 |
| publication_date | 2023-09-29 |
| publication_year | 2023 |
| referenced_works | https://openalex.org/W1993688167, https://openalex.org/W2170620327, https://openalex.org/W1532834996, https://openalex.org/W1631356911, https://openalex.org/W2079294297, https://openalex.org/W2963956175, https://openalex.org/W2060887031, https://openalex.org/W2586874551, https://openalex.org/W2591389137, https://openalex.org/W2052146120, https://openalex.org/W3178594889, https://openalex.org/W3001593109, https://openalex.org/W4221145624, https://openalex.org/W2918135161, https://openalex.org/W3012928806, https://openalex.org/W2617241380, https://openalex.org/W1965035185, https://openalex.org/W3103164351, https://openalex.org/W3100246962 |
| referenced_works_count | 19 |
| abstract_inverted_index., | 100 |
| abstract_inverted_index.. | 139 |
| abstract_inverted_index.5 | 98 |
| abstract_inverted_index.6 | 158 |
| abstract_inverted_index.7 | 126 |
| abstract_inverted_index.9 | 137 |
| abstract_inverted_index.A | 1 |
| abstract_inverted_index.a | 6, 22, 28, 87, 148, 165 |
| abstract_inverted_index.n | 99, 127, 138, 156 |
| abstract_inverted_index.4, | 129 |
| abstract_inverted_index.In | 43 |
| abstract_inverted_index.It | 17 |
| abstract_inverted_index.We | 71 |
| abstract_inverted_index.as | 27, 106 |
| abstract_inverted_index.be | 25, 92, 161 |
| abstract_inverted_index.by | 54 |
| abstract_inverted_index.in | 96, 102, 121 |
| abstract_inverted_index.is | 5, 18 |
| abstract_inverted_index.no | 123 |
| abstract_inverted_index.of | 9, 37, 39, 51, 66, 136, 179, 188, 191 |
| abstract_inverted_index.on | 48, 146 |
| abstract_inverted_index.to | 58, 69, 114, 174, 229 |
| abstract_inverted_index.us | 113 |
| abstract_inverted_index.we | 46, 84, 141 |
| abstract_inverted_index.CZ, | 13 |
| abstract_inverted_index.LNN | 95, 120 |
| abstract_inverted_index.and | 14, 63, 81 |
| abstract_inverted_index.can | 24, 91, 160 |
| abstract_inverted_index.due | 68 |
| abstract_inverted_index.the | 40, 49, 59, 64, 103, 107, 131, 175, 180, 186, 189 |
| abstract_inverted_index.two | 73 |
| abstract_inverted_index.− | 128 |
| abstract_inverted_index.> | 157 |
| abstract_inverted_index.(P), | 12 |
| abstract_inverted_index.CNOT | 15 |
| abstract_inverted_index.This | 111, 184 |
| abstract_inverted_index.best | 132 |
| abstract_inverted_index.each | 33 |
| abstract_inverted_index.from | 194 |
| abstract_inverted_index.more | 124 |
| abstract_inverted_index.only | 36, 164 |
| abstract_inverted_index.over | 94, 119, 155, 169, 264 |
| abstract_inverted_index.same | 104 |
| abstract_inverted_index.show | 85 |
| abstract_inverted_index.such | 21 |
| abstract_inverted_index.than | 125 |
| abstract_inverted_index.that | 20, 86, 145 |
| abstract_inverted_index.this | 44 |
| abstract_inverted_index.tiny | 166 |
| abstract_inverted_index.with | 163 |
| abstract_inverted_index.(LNN) | 80 |
| abstract_inverted_index.Phase | 11 |
| abstract_inverted_index.bound | 135 |
| abstract_inverted_index.depth | 53, 97, 105, 122, 190 |
| abstract_inverted_index.focus | 47 |
| abstract_inverted_index.gates | 38 |
| abstract_inverted_index.i.e., | 101 |
| abstract_inverted_index.known | 19 |
| abstract_inverted_index.maps: | 76 |
| abstract_inverted_index.noise | 67 |
| abstract_inverted_index.stage | 34, 109, 182 |
| abstract_inverted_index.type. | 42 |
| abstract_inverted_index.upper | 134 |
| abstract_inverted_index.where | 32 |
| abstract_inverted_index.-CNOT- | 108, 181 |
| abstract_inverted_index.First, | 83 |
| abstract_inverted_index.Linear | 77 |
| abstract_inverted_index.allows | 112 |
| abstract_inverted_index.alone. | 110, 183 |
| abstract_inverted_index.gates, | 56 |
| abstract_inverted_index.gates. | 16 |
| abstract_inverted_index.metric | 62 |
| abstract_inverted_index.paper, | 45 |
| abstract_inverted_index.qubits | 159 |
| abstract_inverted_index.random | 149 |
| abstract_inverted_index.report | 142 |
| abstract_inverted_index.Nearest | 78 |
| abstract_inverted_index.Second, | 140 |
| abstract_inverted_index.average | 147 |
| abstract_inverted_index.circuit | 7, 23, 52 |
| abstract_inverted_index.popular | 74 |
| abstract_inverted_index.quantum | 10 |
| abstract_inverted_index.written | 26 |
| abstract_inverted_index.Abstract | 0 |
| abstract_inverted_index.Clifford | 3, 89, 117, 153, 192 |
| abstract_inverted_index.Neighbor | 79 |
| abstract_inverted_index.additive | 167 |
| abstract_inverted_index.circuits | 193 |
| abstract_inverted_index.compared | 173 |
| abstract_inverted_index.composed | 8 |
| abstract_inverted_index.consider | 72 |
| abstract_inverted_index.consists | 35 |
| abstract_inverted_index.evidence | 144 |
| abstract_inverted_index.overhead | 168 |
| abstract_inverted_index.previous | 133 |
| abstract_inverted_index.suggests | 185 |
| abstract_inverted_index.<mml:math | 197, 232 |
| abstract_inverted_index.arbitrary | 116 |
| abstract_inverted_index.connected | 171 |
| abstract_inverted_index.heuristic | 143 |
| abstract_inverted_index.implement | 115 |
| abstract_inverted_index.important | 60 |
| abstract_inverted_index.improving | 130 |
| abstract_inverted_index.operation | 90 |
| abstract_inverted_index.reduction | 65, 187 |
| abstract_inverted_index.specified | 41 |
| abstract_inverted_index.uniformly | 150 |
| abstract_inverted_index.<mml:mrow> | 199, 206, 208, 210, 213, 217, 219, 234, 241, 243, 245, 248, 252, 254 |
| abstract_inverted_index.<mml:msup> | 209, 244 |
| abstract_inverted_index.all-to-all | 170 |
| abstract_inverted_index.best-known | 176 |
| abstract_inverted_index.entangling | 55 |
| abstract_inverted_index.</mml:math> | 228, 263 |
| abstract_inverted_index.</mml:mrow> | 212, 215, 221, 223, 224, 226, 227, 247, 250, 256, 258, 259, 261, 262 |
| abstract_inverted_index.</mml:msup> | 216, 251 |
| abstract_inverted_index.all-to-all. | 82 |
| abstract_inverted_index.distributed | 151 |
| abstract_inverted_index.implemented | 93, 162 |
| abstract_inverted_index.three-stage | 29 |
| abstract_inverted_index.}^{2}(n))$$ | 196, 231 |
| abstract_inverted_index.-P-CZ-CNOT-, | 31 |
| abstract_inverted_index.architecture | 172 |
| abstract_inverted_index.computation, | 30 |
| abstract_inverted_index.connectivity | 75 |
| abstract_inverted_index.decoherence. | 70 |
| abstract_inverted_index.minimization | 50 |
| abstract_inverted_index.unrestricted | 265 |
| abstract_inverted_index.<mml:mspace/> | 202, 204, 237, 239 |
| abstract_inverted_index.Hadamard-free | 2, 88, 152 |
| abstract_inverted_index.corresponding | 57 |
| abstract_inverted_index.architectures. | 266 |
| abstract_inverted_index.implementation | 178 |
| abstract_inverted_index.transformation | 4, 118, 154 |
| abstract_inverted_index.depth-optimized | 177 |
| abstract_inverted_index.$$2n\,+\,O({\log | 195 |
| abstract_inverted_index.time-to-solution | 61 |
| abstract_inverted_index.$$1.5n\,+\,O({\log | 230 |
| abstract_inverted_index.<mml:mi>O</mml:mi> | 205, 240 |
| abstract_inverted_index.<mml:mi>n</mml:mi> | 201, 220, 236, 255 |
| abstract_inverted_index.<mml:mn>2</mml:mn> | 200, 214, 249 |
| abstract_inverted_index.<mml:mo>(</mml:mo> | 207, 218, 242, 253 |
| abstract_inverted_index.<mml:mo>)</mml:mo> | 222, 225, 257, 260 |
| abstract_inverted_index.<mml:mo>+</mml:mo> | 203, 238 |
| abstract_inverted_index.<mml:mi>log</mml:mi> | 211, 246 |
| abstract_inverted_index.<mml:mn>1.5</mml:mn> | 235 |
| abstract_inverted_index.xmlns:mml="http://www.w3.org/1998/Math/MathML"> | 198, 233 |
| cited_by_percentile_year.max | 97 |
| cited_by_percentile_year.min | 89 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 2 |
| citation_normalized_percentile.value | 0.85572402 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |