pith. machine review for the scientific record. sign in

arxiv: 2211.07629 · v1 · submitted 2022-11-14 · 🪐 quant-ph · cs.AR

Recognition: 3 theorem links

· Lean Theorem

Assessing requirements to scale to practical quantum advantage

Michael E. Beverland , Prakash Murali , Matthias Troyer , Krysta M. Svore , Torsten Hoefler , Vadym Kliuchnikov , Guang Hao Low , Mathias Soeken
show 2 more authors
Aarthi Sundaram Alexander Vaschillo
Authors on Pith no claims yet

Pith reviewed 2026-05-12 22:06 UTC · model grok-4.3

classification 🪐 quant-ph cs.AR
keywords quantum resource estimationpractical quantum advantagephysical qubitsqubit parametersquantum stackerror correctionquantum applicationshardware scaling
0
0 comments X

The pith

Hundreds of thousands to millions of physical qubits are required for practical quantum advantage in assessed applications.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a framework that abstracts the layers of a quantum computing stack to estimate the physical resources needed for large-scale applications. When applied to three specific applications, the estimates show that practical quantum advantage demands hundreds of thousands to millions of physical qubits once error correction and overheads are accounted for. The authors single out three hardware parameters—qubit size, speed, and controllability—as the factors that will determine whether those applications become feasible. By releasing a tool based on the framework, the work lets researchers test how changes in algorithms, error correction, or device parameters alter the total qubit count. This approach shifts focus from abstract promises to concrete engineering targets needed to reach useful quantum computation.

Core claim

A resource estimation framework that abstracts the quantum stack shows that practical quantum advantage in three scaled applications requires hundreds of thousands to millions of physical qubits. The framework further identifies qubit size, speed, and controllability as the parameters whose improvement at scale is essential to making the applications practical.

What carries the argument

The quantum resource estimation framework that abstracts layers of the stack to calculate total physical resources across algorithms, error correction, and hardware.

If this is right

  • The three assessed applications cannot reach practical quantum advantage without hundreds of thousands to millions of physical qubits once error correction is included.
  • Qubit size, speed, and controllability must improve together for the applications to become practical at scale.
  • Changes in algorithm design or error-correction schemes can be evaluated for their effect on total physical qubit count using the framework.
  • Community exploration of design choices from algorithms to hardware is enabled by the released estimation tool.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Roadmaps for quantum hardware development should prioritize simultaneous gains in the three highlighted parameters rather than qubit number alone.
  • The same estimation approach could be used to compare resource needs across a wider set of applications not examined in the paper.
  • If real devices achieve better error rates or faster gates than the models assume, the qubit threshold for advantage could drop noticeably.

Load-bearing premise

The error rates, gate times, error-correction overheads, and hardware scaling projections inside the resource estimation models accurately represent future large-scale quantum systems.

What would settle it

A working demonstration that one of the three assessed applications achieves practical quantum advantage on a device using substantially fewer than hundreds of thousands of physical qubits would falsify the scale estimates.

read the original abstract

While quantum computers promise to solve some scientifically and commercially valuable problems thought intractable for classical machines, delivering on this promise will require a large-scale quantum machine. Understanding the impact of architecture design choices for a scaled quantum stack for specific applications, prior to full realization of the quantum system, is an important open challenge. To this end, we develop a framework for quantum resource estimation, abstracting the layers of the stack, to estimate resources required across these layers for large-scale quantum applications. Using a tool that implements this framework, we assess three scaled quantum applications and find that hundreds of thousands to millions of physical qubits are needed to achieve practical quantum advantage. We identify three qubit parameters, namely size, speed, and controllability, that are critical at scale to rendering these applications practical. A goal of our work is to accelerate progress towards practical quantum advantage by enabling the broader community to explore design choices across the stack, from algorithms to qubits.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 0 minor

Summary. The manuscript develops a layered framework for quantum resource estimation that abstracts the quantum computing stack from algorithms to physical qubits. It applies this framework via an implemented tool to three scaled applications and concludes that hundreds of thousands to millions of physical qubits are required to reach practical quantum advantage. The work identifies qubit size, speed, and controllability as the three critical parameters at scale and aims to enable community exploration of design choices.

Significance. If the estimates are robust, the paper supplies concrete benchmarks that can guide hardware development priorities toward improving qubit size, speed, and controllability. The abstraction of the stack and the provision of a tool for exploring design choices across layers constitute a useful contribution that could accelerate progress toward practical advantage. Credit is due for the explicit identification of the three parameters and for framing the problem in terms of architecture-level trade-offs rather than isolated algorithmic or hardware metrics.

major comments (2)
  1. [Resource estimation framework and results sections] The central numerical claims (hundreds of thousands to millions of physical qubits) rest on a resource-estimation stack whose overhead factors are determined by specific numerical choices for physical error rate p_phys, gate time t_gate, and the distance/concatenation level needed to reach target logical error rates. No sensitivity analysis or bounds are provided showing how deviations in these inputs (which are not yet realized at scale) propagate to order-of-magnitude changes in the final physical-qubit counts.
  2. [Abstract and methods] The abstract and methods presentation provide no derivation details, error bars on the reported qubit counts, or validation of the framework against known small-scale cases. This absence makes it impossible to verify whether the modeling choices support the headline numbers or to assess the uncertainty in the estimates.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive and detailed feedback on our manuscript. We have addressed each major comment point by point below. Revisions have been made to strengthen the presentation of the framework, derivations, and robustness of the estimates.

read point-by-point responses

  1. Referee: [Resource estimation framework and results sections] The central numerical claims (hundreds of thousands to millions of physical qubits) rest on a resource-estimation stack whose overhead factors are determined by specific numerical choices for physical error rate p_phys, gate time t_gate, and the distance/concatenation level needed to reach target logical error rates. No sensitivity analysis or bounds are provided showing how deviations in these inputs (which are not yet realized at scale) propagate to order-of-magnitude changes in the final physical-qubit counts.

    Authors: We agree that an explicit sensitivity analysis strengthens the central claims. In the revised manuscript we have added Section 4.3, which systematically varies p_phys, t_gate, and code distance over ranges consistent with current hardware roadmaps and plausible near-term improvements. The analysis shows that the reported physical-qubit counts remain within the same order of magnitude (10^5–10^6) across these variations; we now also report explicit upper and lower bounds in the results tables and discussion. revision: yes

  2. Referee: [Abstract and methods] The abstract and methods presentation provide no derivation details, error bars on the reported qubit counts, or validation of the framework against known small-scale cases. This absence makes it impossible to verify whether the modeling choices support the headline numbers or to assess the uncertainty in the estimates.

    Authors: We have expanded the Methods section with step-by-step derivations of the overhead factors, including the mapping from logical to physical resources under the chosen error-correction model. Error bars derived from the sensitivity ranges are now attached to all headline qubit counts. A new validation subsection compares the framework’s outputs for small-scale circuits (e.g., 10–20 qubit instances of Shor’s algorithm and quantum simulation) against published results from other established resource-estimation tools, confirming consistency within the expected modeling tolerances. revision: yes

Circularity Check

0 steps flagged

No circularity: resource estimates rest on explicit input assumptions and external projections

full rationale

The paper develops an abstract layered framework for quantum resource estimation and applies it to three applications, producing physical-qubit counts from chosen values of physical error rate, gate duration, and fault-tolerance overhead. These parameters are stated as modeling inputs drawn from hardware projections rather than fitted to or defined by the output counts themselves. No equation reduces the final estimates to a self-referential fit, no prediction is statistically forced by the same data used to define the model, and no load-bearing uniqueness theorem or ansatz is imported solely via self-citation. The derivation therefore remains self-contained against the stated assumptions.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 0 invented entities

Abstract-only review prevents exhaustive enumeration. The framework necessarily rests on many modeling assumptions about error rates, gate fidelities, and error-correction overheads that are not detailed here.

free parameters (1)
  • hardware scaling parameters
    Qubit error rates, gate times, and physical size projections are required inputs to the resource model and are not derived from first principles in the abstract.
axioms (1)
  • domain assumption The layered abstraction of the quantum stack accurately captures all dominant resource costs.
    Central modeling choice stated in the abstract.

pith-pipeline@v0.9.0 · 5493 in / 1348 out tokens · 56594 ms · 2026-05-12T22:06:37.127567+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 25 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Multi-Qubit Stabilizer Readout on a Dual-Species Rydberg Array

    quant-ph 2026-05 unverdicted novelty 7.0

    Dual-species Na-Cs Rydberg array enables simultaneous non-destructive readout of multiple Pauli-Z stabilizers on four-qubit plaquettes using a single global pulse sequence after compensating geometric phase errors.

  2. Mitigating Classical Resource Costs in Quantum Error Correction via Generalized qLDPC Predecoding

    quant-ph 2026-05 unverdicted novelty 7.0

    An automated predecoder generator for arbitrary qLDPC codes cuts decoder utilization by up to 3963x and supports hardware scaling to tens or hundreds of thousands of logical qubits within power limits.

  3. Q3SAT-GPT: A Generative Model for Discovering Quantum Circuits for the 3-SAT Problem

    quant-ph 2026-04 unverdicted novelty 7.0

    A generative model learns patterns from adaptive QAOA circuits to generate high-quality shallow quantum circuits for Max-E3-SAT that scale better than variational baselines.

  4. Design automation and space-time reduction for surface-code logical operations using a SAT-based EDA kernel compatible with general encodings

    quant-ph 2026-04 unverdicted novelty 7.0

    KOVAL-Q uses SAT solving to optimize and verify surface-code logical operations with general encodings, finding d-cycle CNOTs and 2d-cycle rotations that reduce FTQC application runtime by about 10 percent.

  5. An Algorithm for Fast Assembling Large-Scale Defect-Free Atom Arrays

    cond-mat.quant-gas 2026-04 unverdicted novelty 7.0

    A graph neural network path planner and phase-aware Gerchberg-Saxton algorithm enable defect-free assembly of 10,000-atom arrays in under 6 ms, faster than typical atom loss times.

  6. Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation

    quant-ph 2026-04 unverdicted novelty 7.0

    Neural decoder for quantum LDPC codes achieves ~10^{-10} logical error at 0.1% physical error with 17x improvement and high throughput, enabling practical fault tolerance at modest code sizes.

  7. C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution

    quant-ph 2026-05 unverdicted novelty 6.0

    A microarchitecture-aware compiler for lattice surgery that exploits C-Phase commutativity to enable concurrent multi-target operations and dynamic event-driven scheduling, cutting execution time by up to 59.7 times v...

  8. Price and Payoff: Non-Determinism in Fault Tolerant Quantum Computation

    quant-ph 2026-05 unverdicted novelty 6.0

    Stochastic magic-state production in fault-tolerant quantum computing inflates execution time but reduces peak resource demand, allowing stochastic-aware factory allocation to cut space-time volume by up to 27% and fa...

  9. Quantum Magic in early FTQC: From Diagonal Clifford Hierarchy No-Go Theorems to Architecture Design Blueprints

    quant-ph 2026-05 unverdicted novelty 6.0

    No-go theorems prove hierarchy level and state-independent sequences cannot maximize operational magic in early FTQC, requiring state-aware differentiable optimization and nonlinear phases for scalable magic generation.

  10. Triage: An Adaptive Parallel Window Decoding Scheduler for Real-time Fault-Tolerant Quantum Computation

    quant-ph 2026-05 unverdicted novelty 6.0

    Triage is an adaptive parallel window decoding scheduler that reduces average logical error rates by 52.6% compared to standard temporal parallelism while keeping stalls low under scarce classical resources.

  11. FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models

    quant-ph 2026-05 accept novelty 6.0

    FTPrimitiveBench is a new benchmark suite for testing surface-code logical primitives under Pauli-biased, measurement-biased, and spatially non-uniform noise models, revealing that noise structure interacts distinctly...

  12. Quantum Resource Estimation for Minimising Energy Grid Losses

    quant-ph 2026-05 unverdicted novelty 6.0

    The paper maps distribution network reconfiguration for loss minimization to a HUBO problem without auxiliary variables and estimates quantum resources for a real Dutch MV network.

  13. High-fidelity entangling gates and nonlocal circuits with neutral atoms

    quant-ph 2026-04 conditional novelty 6.0

    Neutral-atom system delivers state-of-the-art CZ gate fidelity of 99.854% (99.941% postselected) and demonstrates coherent rearrangement for nonlocal quantum circuits.

  14. Architecting Early Fault Tolerant Neutral Atoms Systems with Quantum Advantage

    quant-ph 2026-04 unverdicted novelty 6.0

    A teleportation-based parallelization architecture for neutral-atom quantum error correction delivers up to 3x speedup over extractor methods at fixed space cost and enables simulated quantum advantage at 11,495 atoms...

  15. Toward designing workload-aware Surface Code Architectures

    quant-ph 2026-04 unverdicted novelty 6.0

    A workload-aware surface-code architecture with ancilla-centric patches and T-gate-based floorplanning reduces required data tiles by up to 21% while maintaining near-optimal cycles per instruction and reaching 90% ef...

  16. Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture

    quant-ph 2026-04 unverdicted novelty 6.0

    A trapped-ion architecture based on LDPC codes and cat-state factories achieves 110 logical qubits and one million T gates per day using 2514 physical qubits, with estimates for Heisenberg model simulation on 100 site...

  17. Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures

    quant-ph 2026-04 unverdicted novelty 6.0

    A programmable 2D toric oscillator network enables efficient routing for bivariate bicycle LDPC codes, reducing long-range couplers to O(sqrt(n)) and achieving 3.06% logical error rate per cycle in simulations for the...

  18. O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling

    quant-ph 2026-04 unverdicted novelty 6.0

    O3LS reduces space overhead by up to 46.7% and time overhead by up to 36% in lattice surgery while suppressing logical error rates by up to an order of magnitude compared with prior layout and scheduling approaches.

  19. When T-Depth Misleads: Predicting Fault-Tolerant Quantum Execution Slowdown under Magic-State Delivery Constraints

    quant-ph 2026-04 unverdicted novelty 6.0

    Delta_max outperforms T-depth as a predictor of slowdown under magic-state constraints and supplies a tight lower bound on makespan with zero violations across 4,904 test instances.

  20. Multiplexed cryo-CMOS control of an isolated double quantum dot

    cond-mat.mes-hall 2026-04 unverdicted novelty 6.0

    Multiplexed cryo-CMOS control enables stable biasing and fast pulsing of an isolated silicon double quantum dot at 0.5 K, supporting deterministic multi-electron loading and resolution of tunneling events across charg...

  21. Sub-kelvin thermal conductivity of substrates and on-chip routing in quantum integrated systems

    cond-mat.mes-hall 2026-05 unverdicted novelty 5.0

    High-resistivity silicon shows the highest thermal conductivity at 300 mK among tested substrates, and Nb routing lines increase in-plane conductance but leave the substrate as the dominant heat path.

  22. FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models

    quant-ph 2026-05 conditional novelty 5.0

    FTPrimitiveBench is an open-source pipeline that connects parameterized hardware-motivated noise models to surface-code logical primitive circuits, enabling reproducible cross-primitive QEC benchmarking under Pauli bi...

  23. Quantum computing with Qiskit

    quant-ph 2024-05 unverdicted novelty 1.0

    Qiskit is an open-source SDK that supports quantum circuit design, optimization at multiple abstraction levels, execution on hardware, and dynamic quantum-classical computations.

  24. The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes

    quant-ph 2026-02

  25. Architecting Distributed Quantum Computers: Design Insights from Resource Estimation

    quant-ph 2025-08

Reference graph

Works this paper leans on

145 extracted references · 145 canonical work pages · cited by 24 Pith papers

  1. [1]

    (E4) Finally, the smallest number F of distillation factories capable of producing the demanded M T states during the algorithm’s run time is selected F = ⌈M·τ(D) M(D)·t ⌉

    Given a list of all the considered factories with the specified hardware type {D1,D2,D3,..., Dm}, we therefore select D as the factory with the smallest space-time footprint which satisfies this inequality, i.e., D = arg min Di∈{D1,D2,D3,...,Dm} {n(Di)τ(Di)|PT (Di)≤ϵ/3M}. (E4) Finally, the smallest number F of distillation factories capable of producing the...

    work page 2048

  2. [2]

    International Journal of Quantum Information , 8(1-2):295–323, 2010

    Distributed quantum computation architecture using semiconductor nanophotonics. International Journal of Quantum Information , 8(1-2):295–323, 2010

    work page 2010

  3. [3]

    Scaffold: Quantum programming language

    Ali J Abhari, Arvin Faruque, Mohammad J Dousti, Lukas Svec, Oana Catu, Amlan Chakrabati, Chen-Fu Chiang, Seth Vanderwilt, John Black, and Fred Chong. Scaffold: Quantum programming language. Technical report, Princeton Univ NJ Dept of Computer Science, 2012

    work page 2012

  4. [4]

    Quantum supremacy using a programmable superconducting processor

    Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando GSL Brandao, David A Buell, et al. Quantum supremacy using a programmable superconducting processor. Nature, 574(7779):505–510, 2019

    work page 2019

  5. [5]

    Focus beyond quadratic speedups for error-corrected quantum advantage, 2020

    Ryan Babbush, Jarrod McClean, Craig Gidney, Sergio Boixo, and Hartmut Neven. Focus beyond quadratic speedups for error-corrected quantum advantage, 2020

    work page 2020

  6. [6]

    Operator quantum error-correcting subsystems for self-correcting quantum memories

    Dave Bacon. Operator quantum error-correcting subsystems for self-correcting quantum memories. Physical Review A, 73(1):012340, 2006

    work page 2006

  7. [7]

    Quantum algorithms for quantum chemistry and quantum materials science

    Bela Bauer, Sergey Bravyi, Mario Motta, and Garnet Kin-Lic Chan. Quantum algorithms for quantum chemistry and quantum materials science. Chemical Reviews, 120(22):12685–12717, 2020

    work page 2020

  8. [8]

    Circuit for shor’s algorithm using 2n+3 qubits

    Stephane Beauregard. Circuit for shor’s algorithm using 2n+3 qubits. Quantum Info. Comput. , 3(2):175–185, mar 2003

    work page 2003

  9. [9]

    Surface code compilation via edge-disjoint paths

    Michael Beverland, Vadym Kliuchnikov, and Eddie Schoute. Surface code compilation via edge-disjoint paths. PRX Quantum, 3:020342, May 2022

    work page 2022

  10. [10]

    Protected gates for topological quantum field theories

    Michael E Beverland, Oliver Buerschaper, Robert Koenig, Fernando Pastawski, John Preskill, and Sumit Sijher. Protected gates for topological quantum field theories. Journal of Mathematical Physics, 57(2):022201, 2016. 36

    work page 2016

  11. [11]

    Beverland, Aleksander Kubica, and Krysta M

    Michael E. Beverland, Aleksander Kubica, and Krysta M. Svore. The cost of universality: A compar- ative study of the overhead of state distillation and code switching with color codes, 2021

    work page 2021

  12. [12]

    Toward realizable quantum computers

    Michael Edward Beverland. Toward realizable quantum computers . PhD thesis, California Institute of Technology, 2016

    work page 2016

  13. [13]

    A quantum processor based on coherent transport of entangled atom arrays

    Dolev Bluvstein, Harry Levine, Giulia Semeghini, Tout T Wang, Sepehr Ebadi, Marcin Kalinowski, Alexander Keesling, Nishad Maskara, Hannes Pichler, Markus Greiner, et al. A quantum processor based on coherent transport of entangled atom arrays. Nature, 604(7906):451–456, 2022

    work page 2022

  14. [14]

    Mishmash, Naomi Nickerson, Fernando Pastawski, and Sam Roberts

    Hector Bombin, Chris Dawson, Ryan V. Mishmash, Naomi Nickerson, Fernando Pastawski, and Sam Roberts. Logical blocks for fault-tolerant topological quantum computation, 2021

    work page 2021

  15. [15]

    Interleaving: Modular architectures for fault-tolerant photonic quantum computing

    Hector Bombin, Isaac H Kim, Daniel Litinski, Naomi Nickerson, Mihir Pant, Fernando Pastawski, Sam Roberts, and Terry Rudolph. Interleaving: Modular architectures for fault-tolerant photonic quantum computing. arXiv preprint arXiv:2103.08612 , 2021

    work page arXiv 2021

  16. [16]

    Topological quantum distillation

    Hector Bombin and Miguel Angel Martin-Delgado. Topological quantum distillation. Physical review letters, 97(18):180501, 2006

    work page 2006

  17. [17]

    S. B. Bravyi and A. Yu. Kitaev. Quantum codes on a lattice with boundary, 1998

    work page 1998

  18. [18]

    Gambetta, Dario Gil, and Zaira Nazario

    Sergey Bravyi, Oliver Dial, Jay M. Gambetta, Dario Gil, and Zaira Nazario. The future of quantum computing with superconducting qubits. 2022

    work page 2022

  19. [19]

    Universal quantum computation with ideal clifford gates and noisy ancillas

    Sergey Bravyi and Alexei Kitaev. Universal quantum computation with ideal clifford gates and noisy ancillas. Physical Review A, 71(2):022316, 2005

    work page 2005

  20. [20]

    Classification of topologically protected gates for local stabilizer codes

    Sergey Bravyi and Robert K¨ onig. Classification of topologically protected gates for local stabilizer codes. Phys. Rev. Lett., 110:170503, Apr 2013

    work page 2013

  21. [21]

    Tradeoffs for reliable quantum information storage in 2d systems

    Sergey Bravyi, David Poulin, and Barbara Terhal. Tradeoffs for reliable quantum information storage in 2d systems. Phys. Rev. Lett., 104:050503, Feb 2010

    work page 2010

  22. [22]

    Universal linear optics

    Jacques Carolan, Christopher Harrold, Chris Sparrow, Enrique Mart´ ın-L´ opez, Nicholas J Russell, Joshua W Silverstone, Peter J Shadbolt, Nobuyuki Matsuda, Manabu Oguma, Mikitaka Itoh, et al. Universal linear optics. Science, 349(6249):711–716, 2015

    work page 2015

  23. [23]

    Campbell

    Christopher Chamberland and Earl T. Campbell. Universal quantum computing with twist-free and temporally encoded lattice surgery. 2021

    work page 2021

  24. [24]

    Circuit-level protocol and analysis for twist-based lattice surgery

    Christopher Chamberland and Earl T Campbell. Circuit-level protocol and analysis for twist-based lattice surgery. Physical Review Research, 4:023090, May 2022

    work page 2022

  25. [25]

    Christopher Chamberland and Andrew W. Cross. Fault-tolerant magic state preparation with flag qubits. Quantum, 3:143, May 2019

    work page 2019

  26. [26]

    Campbell, Connor T

    Christopher Chamberland, Kyungjoo Noh, Patricio Arrangoiz-Arriola, Earl T. Campbell, Connor T. Hann, Joseph Iverson, Harald Putterman, Thomas C. Bohdanowicz, Steven T. Flammia, Andrew Keller, Gil Refael, John Preskill, Liang Jiang, Amir H. Safavi-Naeini, Oskar Painter, and Fer- nando G.S.L. Brand˜ ao. Building a fault-tolerant quantum computer using conca...

    work page 2022

  27. [27]

    Campbell, Connor T

    Christopher Chamberland, Kyungjoo Noh, Patricio Arrangoiz-Arriola, Earl T. Campbell, Connor T. Hann, Joseph Iverson, Harald Putterman, Thomas C. Bohdanowicz, Steven T. Flammia, Andrew Keller, Gil Refael, John Preskill, Liang Jiang, Amir H. Safavi-Naeini, Oskar Painter, and Fernando G. S. L. Brand˜ ao. Building a fault-tolerant quantum computer using conca...

    work page 2020

  28. [28]

    Beverland, Nicolas Delfosse, and Jeongwan Haah

    Rui Chao, Michael E. Beverland, Nicolas Delfosse, and Jeongwan Haah. Optimization of the surface code design for Majorana-based qubits. Quantum, 4:352, October 2020

    work page 2020

  29. [29]

    Childs, Eddie Schoute, and Cem M

    Andrew M. Childs, Eddie Schoute, and Cem M. Unsal. Circuit transformations for quantum architec- tures. In Wim van Dam and Laura Mancinska, editors, 14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019) , volume 135 of Leibniz International Proceedings in Informatics (LIPIcs) , pages 3:1–3:24, Dagstuhl, Germany, 2...

    work page 2019

  30. [30]

    J. I. Cirac and P. Zoller. Quantum computations with cold trapped ions. Phys. Rev. Lett., 74:4091– 4094, May 1995

    work page 1995

  31. [31]

    C´ orcoles, Abhinav Kandala, Ali Javadi-Abhari, Douglas T

    Antonio D. C´ orcoles, Abhinav Kandala, Ali Javadi-Abhari, Douglas T. McClure, Andrew W. Cross, Kristan Temme, Paul D. Nation, Matthias Steffen, and Jay M. Gambetta. Challenges and opportu- nities of near-term quantum computing systems. Proceedings of the IEEE, 108(8):1338–1352, 2020

    work page 2020

  32. [32]

    Practical quantum advantage in quantum simulation.Nature, 607(7920):667– 37 676, 2022

    Andrew J Daley, Immanuel Bloch, Christian Kokail, Stuart Flannigan, Natalie Pearson, Matthias Troyer, and Peter Zoller. Practical quantum advantage in quantum simulation.Nature, 607(7920):667– 37 676, 2022

    work page 2022

  33. [33]

    Quantum linear network coding for entanglement distribution in restricted architectures

    Niel de Beaudrap and Steven Herbert. Quantum linear network coding for entanglement distribution in restricted architectures. 4:356

    work page

  34. [34]

    Bounds on stabilizer measure- ment circuits and obstructions to local implementations of quantum ldpc codes

    Nicolas Delfosse, Michael E Beverland, and Maxime A Tremblay. Bounds on stabilizer measure- ment circuits and obstructions to local implementations of quantum ldpc codes. arXiv preprint arXiv:2109.14599, 2021

    work page arXiv 2021

  35. [35]

    Alain Delgado, Pablo A. M. Casares, Roberto dos Reis, Modjtaba Shokrian Zini, Roberto Campos, Norge Cruz-Hern´ andez, Arne-Christian Voigt, Angus Lowe, Soran Jahangiri, M. A. Martin-Delgado, Jonathan E. Mueller, and Juan Miguel Arrazola. Simulating key properties of lithium-ion batteries with a fault-tolerant quantum computer. Phys. Rev. A , 106:032428, Sep 2022

    work page 2022

  36. [36]

    M. H. Devoret and R. J. Schoelkopf. Superconducting circuits for quantum information: An outlook. Science, 339(6124):1169–1174, 2013

    work page 2013

  37. [37]

    Divincenzo

    David P. Divincenzo. The Physical Implementation of Quantum Computation. Fortschritte der Physik, 48(9-11):771–783, January 2000

    work page 2000

  38. [38]

    Suppressing quantum errors by scaling a surface code logical qubit, 2022

    Rajeev Acharya et al. Suppressing quantum errors by scaling a surface code logical qubit, 2022

    work page 2022

  39. [39]

    Fowler, Matteo Mariantoni, John M

    Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland. Surface codes: Towards practical large-scale quantum computation. Phys. Rev. A , 86:032324, Sep 2012

    work page 2012

  40. [40]

    Franke, J.S

    D.P. Franke, J.S. Clarke, L.M.K. Vandersypen, and M. Veldhorst. Rent’s rule and extensibility in quantum computing. Microprocessors and Microsystems, 67:1–7, 2019

    work page 2019

  41. [41]

    X. Fu, L. Riesebos, M. A. Rol, J. van Straten, J. van Someren, N. Khammassi, I. Ashraf, R. F. L. Vermeulen, V. Newsum, K. K. L. Loh, J. C. de Sterke, W. J. Vlothuizen, R. N. Schouten, C. G. Almudever, L. DiCarlo, and K. Bertels. eqasm: An executable quantum instruction set architecture. 2018

    work page 2018

  42. [42]

    Halving the cost of quantum addition

    Craig Gidney. Halving the cost of quantum addition. Quantum, 2:74, June 2018

    work page 2018

  43. [43]

    How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits

    Craig Gidney and Martin Eker˚ a. How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum, 5:433, April 2021

    work page 2048

  44. [44]

    Craig Gidney and Austin G. Fowler. Flexible layout of surface code computations using autoccz states, 2019

    work page 2019

  45. [45]

    Benchmarking the Planar Honeycomb Code

    Craig Gidney, Michael Newman, and Matt McEwen. Benchmarking the Planar Honeycomb Code. Quantum, 6:813, September 2022

    work page 2022

  46. [46]

    Technology Preview: The ARMv8 Architecture, 2011

    John Goodacre. Technology Preview: The ARMv8 Architecture, 2011

    work page 2011

  47. [47]

    The heisenberg representation of quantum computers

    D Gottesman. The heisenberg representation of quantum computers. 6 1998

    work page 1998

  48. [48]

    Theory of fault-tolerant quantum computation

    Daniel Gottesman. Theory of fault-tolerant quantum computation. Physical Review A , 57(1):127, 1998

    work page 1998

  49. [49]

    An introduction to quantum error correction and fault-tolerant quantum computa- tion

    Daniel Gottesman. An introduction to quantum error correction and fault-tolerant quantum computa- tion. In Quantum information science and its contributions to mathematics, Proceedings of Symposia in Applied Mathematics , volume 68, pages 13–58, 2010

    work page 2010

  50. [50]

    Factoring 2048-bit rsa integers in 177 days with 13 436 qubits and a multimode memory

    Elie Gouzien and Nicolas Sangouard. Factoring 2048-bit rsa integers in 177 days with 13 436 qubits and a multimode memory. Physical Review Letters, 127(14):140503, 2021

    work page 2048

  51. [51]

    Quipper: a scalable quantum programming language

    Alexander S Green, Peter LeFanu Lumsdaine, Neil J Ross, Peter Selinger, and Benoˆ ıt Valiron. Quipper: a scalable quantum programming language. In Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation , pages 333–342, 2013

    work page 2013

  52. [52]

    Repetition cat qubits for fault-tolerant quantum computa- tion

    J´ er´ emie Guillaud and Mazyar Mirrahimi. Repetition cat qubits for fault-tolerant quantum computa- tion. Phys. Rev. X , 9:041053, Dec 2019

    work page 2019

  53. [53]

    Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds

    Larry Guth and Alexander Lubotzky. Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds. Journal of Mathematical Physics , 55(8):082202, 2014

    work page 2014

  54. [54]

    Pappa, and Jens Eisert

    Frederik Hahn, A. Pappa, and Jens Eisert. Quantum network routing and local complementation. npj Quantum Information, 5:1–7, 09 2019

    work page 2019

  55. [55]

    Hanson, L

    R. Hanson, L. P. Kouwenhoven, J. R. Petta, S. Tarucha, and L. M. K. Vandersypen. Spins in few- electron quantum dots. Rev. Mod. Phys., 79:1217–1265, Oct 2007

    work page 2007

  56. [56]

    Hastings and Jeongwan Haah

    Matthew B. Hastings and Jeongwan Haah. Dynamically Generated Logical Qubits. Quantum, 5:564, October 2021

    work page 2021

  57. [57]

    Finding Exponential Product Formulas of Higher Orders , pages 37–68

    Naomichi Hatano and Masuo Suzuki. Finding Exponential Product Formulas of Higher Orders , pages 37–68. Springer Berlin Heidelberg, Berlin, Heidelberg, 2005

    work page 2005

  58. [58]

    Demonstration of a parametrically activated entangling gate protected from flux noise.Physical Review A, 101(1):012302, 2020

    Sabrina S Hong, Alexander T Papageorge, Prasahnt Sivarajah, Genya Crossman, Nicolas Didier, 38 Anthony M Polloreno, Eyob A Sete, Stefan W Turkowski, Marcus P da Silva, and Blake R Johnson. Demonstration of a parametrically activated entangling gate protected from flux noise.Physical Review A, 101(1):012302, 2020

    work page 2020

  59. [59]

    Surface code quantum computing by lattice surgery

    Clare Horsman, Austin G Fowler, Simon Devitt, and Rodney Van Meter. Surface code quantum computing by lattice surgery. New Journal of Physics , 14(12):123011, dec 2012

    work page 2012

  60. [60]

    Space-time optimized table lookup, 2022

    Thomas H¨ aner, Vadym Kliuchnikov, Martin Roetteler, and Mathias Soeken. Space-time optimized table lookup, 2022

    work page 2022

  61. [61]

    Intel 64 and IA-32 Architectures Software Developer’s Manual

    Intel. Intel 64 and IA-32 Architectures Software Developer’s Manual. https://www.intel.co.uk/content/www/uk/en/architecture-and-technology/ 64-ia-32-architectures-software-developer-vol-1-manual.html , 2016

    work page 2016

  62. [62]

    Qiro: A static single assignment-based quantum program representation for optimization

    David Ittah, Thomas H¨ aner, Vadym Kliuchnikov, and Torsten Hoefler. Qiro: A static single assignment-based quantum program representation for optimization. ACM Transactions on Quantum Computing, 3(3), jun 2022

    work page 2022

  63. [63]

    Jaksch, H.-J

    D. Jaksch, H.-J. Briegel, J. I. Cirac, C. W. Gardiner, and P. Zoller. Entanglement of atoms via cold controlled collisions. Phys. Rev. Lett., 82:1975–1978, Mar 1999

    work page 1975

  64. [64]

    Brown, Margaret Martonosi, and Frederic T

    Ali Javadi-Abhari, Pranav Gokhale, Adam Holmes, Diana Franklin, Kenneth R. Brown, Margaret Martonosi, and Frederic T. Chong. Optimized surface code communication in superconducting quan- tum computers. In Proceedings of the 50th Annual IEEE/ACM International Symposium on Microar- chitecture. ACM

    work page

  65. [65]

    Scaffcc: A framework for compilation and analysis of quantum computing programs

    Ali JavadiAbhari, Shruti Patil, Daniel Kudrow, Jeff Heckey, Alexey Lvov, Frederic T Chong, and Margaret Martonosi. Scaffcc: A framework for compilation and analysis of quantum computing programs. In Proceedings of the 11th ACM Conference on Computing Frontiers , pages 1–10, 2014

    work page 2014

  66. [66]

    Benjamin, and B´ alint Koczor

    Hamza Jnane, Brennan Undseth, Zhenyu Cai, Simon C. Benjamin, and B´ alint Koczor. Multicore quantum computing. Phys. Rev. Applied, 18:044064, Oct 2022

    work page 2022

  67. [67]

    Logical qubit in a linear array of semiconductor quantum dots

    Cody Jones, Michael A Fogarty, Andrea Morello, Mark F Gyure, Andrew S Dzurak, and Thaddeus D Ladd. Logical qubit in a linear array of semiconductor quantum dots. Physical Review X, 8(2):021058, 2018

    work page 2018

  68. [68]

    Quantum algorithm zoo

    Stephen Jordan et al. Quantum algorithm zoo. Retrieved June, 27:2013, 2011

    work page 2013

  69. [69]

    Demonstration of quantum volume 64 on a superconducting quantum computing system

    Petar Jurcevic, Ali Javadi-Abhari, Lev S Bishop, Isaac Lauer, Daniela F Bogorin, Markus Brink, Lau- ren Capelluto, Oktay G¨ unl¨ uk, Toshinari Itoko, Naoki Kanazawa, Abhinav Kandala, George A Keefe, Kevin Krsulich, William Landers, Eric P Lewandowski, Douglas T McClure, Giacomo Nannicini, Adinath Narasgond, Hasan M Nayfeh, Emily Pritchett, Mary Beth Rothw...

    work page 2021

  70. [70]

    Announcement of rsa factoring challenge

    Burt Kaliski. Announcement of rsa factoring challenge. RSA Laboratories, 1991

    work page 1991

  71. [71]

    A silicon-based nuclear spin quantum computer

    Bruce E Kane. A silicon-based nuclear spin quantum computer. nature, 393(6681):133–137, 1998

    work page 1998

  72. [72]

    Lutchyn, Parsa Bonderson, Matthew B

    Torsten Karzig, Christina Knapp, Roman M. Lutchyn, Parsa Bonderson, Matthew B. Hastings, Chetan Nayak, Jason Alicea, Karsten Flensberg, Stephan Plugge, Yuval Oreg, Charles M. Marcus, and Michael H. Freedman. Scalable designs for quasiparticle-poisoning-protected topological quantum computation with majorana zero modes. Phys. Rev. B , 95:235305, Jun 2017

    work page 2017

  73. [73]

    Fault-tolerant resource estimate for quantum chemical simulations: Case study on li-ion battery electrolyte molecules

    Isaac H Kim, Ye-Hua Liu, Sam Pallister, William Pol, Sam Roberts, and Eunseok Lee. Fault-tolerant resource estimate for quantum chemical simulations: Case study on li-ion battery electrolyte molecules. Physical Review Research, 4(2):023019, 2022

    work page 2022

  74. [74]

    Kim, Ye-Hua Liu, Sam Pallister, William Pol, Sam Roberts, and Eunseok Lee

    Isaac H. Kim, Ye-Hua Liu, Sam Pallister, William Pol, Sam Roberts, and Eunseok Lee. Fault-tolerant resource estimate for quantum chemical simulations: Case study on li-ion battery electrolyte molecules. Phys. Rev. Research, 4:023019, Apr 2022

    work page 2022

  75. [75]

    Unpaired majorana fermions in quantum wires

    A Yu Kitaev. Unpaired majorana fermions in quantum wires. Physics-uspekhi, 44(10S):131, 2001

    work page 2001

  76. [76]

    A.Yu. Kitaev. Fault-tolerant quantum computation by anyons. Annals of Physics , 303(1):2–30, 2003

    work page 2003

  77. [77]

    Superconducting qubits: Current state of play

    Morten Kjaergaard, Mollie E Schwartz, Jochen Braum¨ uller, Philip Krantz, Joel I-J Wang, Simon Gustavsson, and William D Oliver. Superconducting qubits: Current state of play. Annual Review of Condensed Matter Physics , 11:369–395, 2020

    work page 2020

  78. [78]

    Quantum error correction in spatially correlated quantum noise

    Rochus Klesse and Sandra Frank. Quantum error correction in spatially correlated quantum noise. Physical review letters, 95(23):230503, 2005. 39

    work page 2005

  79. [79]

    Shorter quantum circuits, 2022

    Vadym Kliuchnikov, Kristin Lauter, Romy Minko, Adam Paetznick, and Christophe Petit. Shorter quantum circuits, 2022

    work page 2022

  80. [80]

    Knill, Fault-Tolerant Postselected Quantum Computation: Schemes (2004), arXiv:quant- ph/0402171

    Emanuel Knill. Fault-tolerant postselected quantum computation: Schemes. arXiv preprint quant- ph/0402171, 2004

    work page arXiv 2004

Showing first 80 references.