QuRE: The Quantum Resource Estimator toolbox
Abstract
We describe QuRE, the Quantum Resource Estimator. QuRE is a layout estimation tool that estimates the cost of practical implementations of quantum circuits in a variety of competing physical quantum technologies and with a variety of strategies for fault tolerant encoding. For each specified algorithm, QuRE estimates quantities such as number of physical qubits, execution time, probability of success of the computation, and physical gate counts for elementary quantum gate types of a specified technology. Out of the box, QuRE supports estimation for six physical quantum technologies, seven quantum algorithms, and with error correction using the Steane [1], [2], Bacon-Shor [3], Knill [4] or surface [5], [6] error correction codes. Moreover, QuRE is extendable and can easily accommodate other choices. After describing QuRE, we use it to investigate the tradeoff between concatenated and surface error correction coding techniques, demonstrating the existence of a crossover point for the Ground State Estimation Algorithm [7].
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Higher gate fidelities lead to a reduction of the overhead of physical qubits needed for encoding.
“In view of implementing fault-tolerant codes, higher gate fidelities also lead to a reduction of the overhead of physical qubits needed for encoding [75].”
From Neutral atom quantum computing hardware: performance and end-user perspective (2023) · cites this paper as [75]
Cites
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · cited 1× · see citing works
“Additional space is also needed to distill and store magic states which are required to implement S and T quantum gates [15].”
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 3× · see citing works
“The tool-box supports estimation for six physical quantum technologies, seven quantum algorithms, and with error correction using the Steane [1], [2], Bacon-Shor [3], Knill [4] or surface [5], [6] QECCs.”
High-threshold universal quantum computation on the surface code
Fowler, A. G., Stephens, A. M., & Groszkowski, P. (2009) · Physical Review A · doi:10.1103/physreva.80.052312 · Cited by 486 · cited 1× · see citing works
“CNOT operations can be done easily between smooth and rough hole pairs by a braiding procedure where one of the rough holes is “grown” and “shrunk” to move around a smooth hole in the other hole pair [18].”
Simulation of electronic structure Hamiltonians using quantum computers
Whitfield, J. D., Biamonte, J., & Aspuru-Guzik, A. (2011) · Molecular Physics · doi:10.1080/00268976.2011.552441 · Cited by 472 · cited 4× · see citing works
“FOR THE GROUND STATE ESTIMATION ALGORITHM [7].”
InfluentialLayered architecture for quantum computing
Jones, N. C., Van Meter, R., Fowler, A. G., McMahon, P. L., Kim, J., Ladd, T. D., & Yamamoto, Y. (2012) · Physical Review X · doi:10.1103/physrevx.2.031007 · Cited by 332 · see citing works
Subsystem Fault Tolerance with the Bacon-Shor Code
Aliferis, P., & Cross, A. W. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.220502 · Cited by 203 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Neutral atom quantum computing hardware: performance and end-user perspective
Wintersperger, K., Dommert, F., Ehmer, T., Hoursanov, A., Klepsch, J., Mauerer, W., Reuber, G., Strohm, T., Yin, M., & Luber, S. (2023) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-023-00190-1 · Cited by 117 · see citing works
- Authors
- Suchara, M., Kubiatowicz, J., Faruque, A., Chong, F. T., Lai, C.-Y., & Paz, G.
- Affiliations
- University of California, Berkeley (US)
- University of California, Santa Barbara (US)
- University of Southern California (US)
- Venue
- 2013 IEEE 31st International Conference on Computer Design (ICCD)
- Publisher
- IEEE
- Published
- 2013-10
- Pages
- 419-426
- ISSN
- 1063-6404 (ISSN-L)
- OpenAlex
- W3102303141
- Cited by
- 45
- References
- 6
- Citations by year
- 2026: 1 · 2025: 4 · 2024: 4 · 2023: 7 · 2022: 1 · 2021: 8 · 2020: 8 · 2019: 5 · 2018: 1 · 2017: 2 · 2016: 1 · 2015: 1 · 2013: 2
- FWCI
- 0.86
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) (publishedVersion)
- Griffith Research Online (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum resource estimation, quantum circuit simulation, Steane code, Bacon-Shor code, surface code, quantum algorithms, execution time prediction
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
