Quantum Error-Corrected Computation of Molecular Energies
Pith reviewed 2026-05-22 16:03 UTC · model grok-4.3
The pith
Error-corrected quantum circuits compute molecular hydrogen ground-state energy to 0.001 hartree accuracy.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
By encoding qubits in the [[7,1,3]] color code and integrating Steane QEC gadgets together with partially fault-tolerant Clifford+R_Z techniques into a quantum phase estimation circuit, the ground-state energy of molecular hydrogen is experimentally obtained to within E - E_FCI = 0.001(13) hartree on the Quantinuum H2-2 processor.
What carries the argument
Steane QEC gadgets inserted into the quantum phase estimation circuit for real-time correction on color-code-encoded qubits, combined with partially fault-tolerant Clifford plus arbitrary-angle rotation operations.
If this is right
- Error-corrected circuits can outperform bare circuits for molecular energy estimation even when total gate count rises.
- The demonstrated pipeline supplies a concrete template for scaling quantum chemistry calculations to larger molecules on logical qubits.
- Memory noise is the dominant error source, so future hardware improvements should prioritize longer coherence times over gate-error reduction.
- Real-time error correction can be maintained across thousands of physical operations without destroying the phase information needed for energy extraction.
Where Pith is reading between the lines
- Lowering memory noise on current hardware would immediately allow this same approach to reach chemical accuracy for molecules beyond hydrogen.
- The same style of gadget insertion could be applied to other quantum simulation tasks such as dynamics or open-system evolution.
- Optimizing error-correction protocols specifically for idle-qubit protection rather than gate fidelity is a high-leverage near-term engineering target.
Load-bearing premise
The integration of Steane QEC gadgets and partially fault-tolerant Clifford+R_Z techniques into the QPE circuit produces a net fidelity gain despite the added gates and measurements.
What would settle it
Executing the identical phase-estimation circuit without the Steane QEC gadgets and finding that the absolute error in the energy estimate exceeds 0.001 hartree or that circuit fidelity does not increase would falsify the net-benefit claim.
Figures
read the original abstract
We present the first demonstration of an end-to-end pipeline with quantum error correction (QEC) for a quantum computation of the electronic structure of molecular systems. We calculate the ground-state energy of molecular hydrogen, using quantum phase estimation (QPE) on qubits encoded with the $[[7,1,3]]$ color code on Quantinuum H2-2. We obtain improvements in computational fidelity by (1) introducing several partially fault-tolerant (FT) techniques for the Clifford+$R_{Z}$ (arbitrary-angle single-qubit rotation) gate set, and (2) integrating Steane QEC gadgets for real-time error correction. In particular, the latter enhances the QPE circuits' performance despite the complexity of the extra QEC circuitry. The encoded circuits contain up to 1585 (546) fixed and 7202 (1702) conditional physical two-qubit gates (mid-circuit measurements), and $\sim$3900 ($\sim$760) total operations are applied on average. The energy $E$ is experimentally estimated to within $E - E_{\mathrm{FCI}} = 0.001(13)$ hartree, where $E_{\mathrm{FCI}}$ denotes the exact ground state energy within the given basis set. Additionally, we conduct numerical simulations with tunable noise parameters to identify the dominant sources of noise. We find that orienting the QEC protocols towards higher memory noise protection is the most promising avenue to improve our experimental results.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript reports the first experimental demonstration of an end-to-end pipeline incorporating quantum error correction for computing molecular electronic structure. Using quantum phase estimation on the [[7,1,3]] color code implemented on the Quantinuum H2-2 trapped-ion processor, the authors compute the ground-state energy of H2. They combine partially fault-tolerant Clifford + R_Z techniques with Steane QEC gadgets for real-time correction, reporting an experimental energy estimate E - E_FCI = 0.001(13) hartree. Numerical simulations with tunable noise parameters identify memory noise as the dominant error source and suggest directions for improvement.
Significance. If the net fidelity gain from the Steane QEC integration holds, this constitutes a meaningful advance toward fault-tolerant quantum chemistry simulations by showing that error-corrected circuits can be executed on current hardware for a chemically relevant task. The direct hardware result achieving near-chemical accuracy, the scale of the encoded circuits (up to ~3900 operations on average), and the noise-model simulations that pinpoint memory noise as the limiting factor are concrete strengths. The work provides a useful benchmark for future QEC implementations in quantum simulation.
major comments (2)
- Abstract: The statement that integrating Steane QEC gadgets 'enhances the QPE circuits' performance despite the complexity of the extra QEC circuitry' is central to the 'first demonstration with QEC' claim, yet no side-by-side experimental control (identical QPE circuit on the same device without the Steane gadgets) is described. The reported accuracy E - E_FCI = 0.001(13) hartree could therefore reflect the partially FT baseline rather than a verified QEC benefit; this assumption requires direct experimental isolation or a clear justification for its omission.
- Abstract: The uncertainty 0.001(13) hartree is presented without explicit detail on the statistical analysis, error budgeting, or how the 13 in the last digit was obtained from the circuit output and post-processing. This information is load-bearing for assessing whether the result truly matches the exact FCI value inside the stated uncertainty.
minor comments (1)
- The parenthetical notation used for gate counts (e.g., 1585 (546) fixed and 7202 (1702) conditional) and operation totals should be defined explicitly in the text or a table caption to improve readability.
Simulated Author's Rebuttal
We appreciate the referee's thorough review and positive evaluation of our work as a meaningful advance. We address the major comments in detail below, providing clarifications and indicating revisions where appropriate.
read point-by-point responses
-
Referee: Abstract: The statement that integrating Steane QEC gadgets 'enhances the QPE circuits' performance despite the complexity of the extra QEC circuitry' is central to the 'first demonstration with QEC' claim, yet no side-by-side experimental control (identical QPE circuit on the same device without the Steane gadgets) is described. The reported accuracy E - E_FCI = 0.001(13) hartree could therefore reflect the partially FT baseline rather than a verified QEC benefit; this assumption requires direct experimental isolation or a clear justification for its omission.
Authors: We thank the referee for highlighting this important point. The partially fault-tolerant techniques constitute the baseline implementation, while the Steane QEC gadgets provide the real-time error correction that enables the end-to-end fault-tolerant pipeline. Although a direct experimental run of the identical circuit without the Steane gadgets was not performed—due to the integrated design of our protocol and hardware time constraints—our numerical simulations with tunable noise parameters demonstrate that the QEC contributes significantly to suppressing errors, particularly memory noise. We have added a new paragraph in the revised manuscript justifying the omission of the control experiment and elaborating on how the simulations isolate the QEC benefit. This supports our claim that the integration enhances performance. revision: partial
-
Referee: Abstract: The uncertainty 0.001(13) hartree is presented without explicit detail on the statistical analysis, error budgeting, or how the 13 in the last digit was obtained from the circuit output and post-processing. This information is load-bearing for assessing whether the result truly matches the exact FCI value inside the stated uncertainty.
Authors: We agree that additional details on the uncertainty estimation are necessary for full transparency. The value 0.001(13) is obtained from the standard deviation of the mean across repeated experimental executions of the full circuit, incorporating both statistical sampling error from the phase estimation and systematic contributions estimated from the noise model simulations. We have expanded the supplementary information and methods section with a dedicated subsection on statistical analysis, including the error budget breakdown, bootstrap methods used for uncertainty quantification, and how post-processing of the circuit outputs leads to the reported precision. These revisions ensure the uncertainty is rigorously justified. revision: yes
Circularity Check
Experimental demonstration is self-contained with no circular derivation
full rationale
The paper reports a direct experimental measurement of the molecular hydrogen ground-state energy using a QEC-enhanced QPE circuit on Quantinuum H2-2 hardware, achieving E - E_FCI = 0.001(13) hartree. This result is obtained from the quantum circuit output and validated against an independent classical FCI benchmark for the same basis set. No load-bearing steps reduce by construction to fitted parameters, self-definitions, or self-citation chains; the claims of performance enhancement rest on the observed experimental fidelity and supporting noise simulations rather than any tautological reduction. The work is therefore self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
free parameters (1)
- tunable noise parameters
axioms (1)
- domain assumption The [[7,1,3]] color code and Steane gadgets provide the stated error protection when applied to the QPE circuit.
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/AbsoluteFloorClosure.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We present the first demonstration of an end-to-end pipeline with quantum error correction (QEC) for a quantum computation of the electronic structure of molecular systems... integrating Steane QEC gadgets for real-time error correction.
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
The encoded circuits contain up to 1585 (546) fixed and 7202 (1702) conditional physical two-qubit gates... The energy E is experimentally estimated to within E - E_FCI = 0.001(13) hartree.
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 5 Pith papers
-
Syndrome resampling enhances quantum error correction thresholds
Syndrome resampling increases QEC thresholds and cuts logical errors by up to four orders of magnitude by biasing toward likely syndromes, linked to Rényi coherent information phase transitions.
-
Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture
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...
-
Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting
Heterogeneous quantum architectures with task-specific hardware and QEC encodings deliver up to 138x lower physical-qubit overhead than monolithic baselines for fault-tolerant algorithms, including RSA-2048 factoring ...
-
A High Motional Frequency Ion Trapping Regime for Quantum Information Science
High motional frequency ion trapping reduces decoherence effects and accelerates experimental duty cycles in quantum information science.
-
Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State
Review of quantum computing methods and potential for non-ground-state quantum chemistry including reaction dynamics, mechanisms, and finite temperatures.
Reference graph
Works this paper leans on
-
[1]
Preparation of|Φ⟩and|+⟩
-
[2]
Application ofU k on the system register condi- tioned on the ancilla qubit (ctrl-U k)
-
[3]
Application of a phase-shift gate,R Z(β)
-
[4]
The parameters{k l}and{β l}are randomly sampled fromk∈ {1,2,
Measurement of the ancilla qubit in theX-basis. The parameters{k l}and{β l}are randomly sampled fromk∈ {1,2, . . . , k max}andβ∈ {0, π 2 }, respectively, wherek max controls the precision of QPE, and deter- mines the maximum depth of the circuit (3). The prob- ability of measuringm∈ {0,1}from a single ideal exe- cution of the circuit (3) is expressed as, ...
-
[5]
Partial-fault tolerance FT designs assume that each physical operation (e.g., gates, measurements) can fail with a small probabilityp, introducing random Pauli errors on affected qubits, but such a failure does not propagate to an undetectable (and thus uncorrectable) logical error. For distance three, this means that circuits are designed so that every s...
-
[6]
Arbitrary-angle logical rotations We now present our implementations of an arbitrary- angle logical rotation as summarized in Table I. They are represented by colored boxes in quantum circuit dia- grams. 5 RGT |θ⟩preparation Measurement Circuit R D Z(θ) No N/A N/A R D Z(θ) = RZZ (θ) R RGT Z (θ) Yes non FT + QED FT R RGT Z (θ) = Z R RGT Z (2θ) |θ QED ⟩ X T...
work page 2000
-
[7]
A. Aspuru-Guzik, A. D. Dutoi, P. J. Love, and M. Head- Gordon, Simulated quantum computation of molecular energies, Science309, 1704 (2005)
work page 2005
-
[8]
P. J. J. O’Malley, R. Babbush, I. D. Kivlichan, J. Romero, J. R. McClean, R. Barends, J. Kelly, P. Roushan, A. Tranter, N. Ding, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, A. G. Fowler, E. Jef- frey, E. Lucero, A. Megrant, J. Y. Mutus, M. Neeley, C. Neill, C. Quintana, D. Sank, A. Vainsencher, J. Wen- ner, T. C. White, P. V. Coveney, P. J. Lo...
-
[9]
Y. Cao, J. Romero, J. P. Olson, M. Degroote, P. D. John- son, M. Kieferov´ a, I. D. Kivlichan, T. Menke, B. Per- opadre, N. P. D. Sawaya, S. Sim, L. Veis, and A. Aspuru- Guzik, Quantum chemistry in the age of quantum com- puting, Chem. Rev.119, 10856 (2019)
work page 2019
-
[10]
S. McArdle, S. Endo, A. Aspuru-Guzik, S. C. Benjamin, and X. Yuan, Quantum computational chemistry, Rev. Mod. Phys.92, 015003 (2020)
work page 2020
-
[11]
G. K.-L. Chan, Spiers memorial lecture: Quantum chem- istry, classical heuristics, and quantum advantage, Fara- day Discuss.254, 11 (2024)
work page 2024
-
[12]
M. A. Nielsen and I. Chuang,Quantum Computation and Quantum Information(Cambridge University Press, New York, 2010)
work page 2010
- [13]
-
[14]
Campbell, Random compiler for fast hamiltonian sim- ulation, Phys
E. Campbell, Random compiler for fast hamiltonian sim- ulation, Phys. Rev. Lett.123, 070503 (2019)
work page 2019
- [15]
- [16]
-
[17]
J. Lee, D. W. Berry, C. Gidney, W. J. Huggins, J. R. Mc- Clean, N. Wiebe, and R. Babbush, Even more efficient quantum computations of chemistry through tensor hy- percontraction, PRX Quantum2, 030305 (2021)
work page 2021
-
[18]
A. Caesura, C. L. Cortes, W. Pol, S. Sim, M. Steudtner, G.-L. R. Anselmetti, M. Degroote, N. Moll, R. Santa- gati, M. Streif, and C. S. Tautermann, Faster quantum chemistry simulations on a quantum computer with im- proved tensor factorization and active volume compila- tion (2025), arXiv:2501.06165 [quant-ph]
-
[19]
A. Y. Kitaev, Quantum measurements and the abelian stabilizer problem (1995), arXiv:quant-ph/9511026
work page internal anchor Pith review Pith/arXiv arXiv 1995
-
[20]
A. Y. Kitaev, A. Shen, and M. N. Vyalyi,Classical and quantum computation, 47 (American Mathematical Soc., 2002)
work page 2002
- [21]
-
[22]
B. L. Higgins, D. W. Berry, S. D. Bartlett, H. M. Wise- man, and G. J. Pryde, Entanglement-free Heisenberg- limited phase estimation, Nature450, 393 (2007)
work page 2007
-
[23]
K. M. Svore, M. B. Hastings, and M. Freedman, Faster phase estimation, Quantum Inf. Comput.14, 306 (2014)
work page 2014
-
[24]
N. Wiebe and C. Granade, Efficient Bayesian phase esti- mation, Phys. Rev. Lett.117, 010503 (2016)
work page 2016
-
[25]
T. E. O’Brien, B. Tarasinski, and B. M. Terhal, Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments, New J. Phys.21, 023022 (2019)
work page 2019
-
[26]
R. D. Somma, Quantum eigenvalue estimation via time series analysis, New J. Phys.21, 123025 (2019)
work page 2019
- [27]
-
[28]
K. Wan, M. Berta, and E. T. Campbell, Randomized quantum algorithm for statistical phase estimation, Phys. Rev. Lett.129, 030503 (2022)
work page 2022
-
[29]
Z. Ding and L. Lin, Even shorter quantum circuit for phase estimation on early fault-tolerant quantum com- puters with applications to ground-state energy estima- tion, PRX Quantum4, 020331 (2023)
work page 2023
-
[30]
K. Yamamoto, S. Duffield, Y. Kikuchi, and D. Mu˜ noz Ramo, Demonstrating bayesian quantum phase estima- tion with quantum error detection, Phys. Rev. Res.6, 013221 (2024)
work page 2024
-
[31]
B. Paul, S. B. Mandal, K. Sugisaki, and B. P. Das, Ap- plications of the quantum phase difference estimation al- gorithm to the excitation energies in spin systems on a NISQ device, arXiv [quant-ph] (2025), arXiv:2502.19809 [quant-ph]
work page internal anchor Pith review Pith/arXiv arXiv 2025
-
[32]
L. Clinton, T. S. Cubitt, R. Garcia-Patron, A. Monta- naro, S. Stanisic, and M. Stroeks, Quantum phase es- timation without controlled unitaries, arXiv [quant-ph] (2024), arXiv:2410.21517 [quant-ph]
-
[33]
Gottesman,Stabilizer Codes and Quantum Error Cor- rection, Ph.D
D. Gottesman,Stabilizer Codes and Quantum Error Cor- rection, Ph.D. thesis, California Institute of Technology (1997)
work page 1997
-
[34]
A. M. Steane, Active stabilization, quantum computa- tion, and quantum state synthesis, Phys. Rev. Lett.78, 2252 (1997)
work page 1997
-
[35]
S. Dangwal, S. Vittal, L. M. Seifert, F. T. Chong, and G. S. Ravi, Variational quantum algorithms in the era of early fault tolerance (2025), arXiv:2503.20963 [quant-ph]
- [36]
-
[37]
Y. Akahoshi, K. Maruyama, H. Oshima, S. Sato, and K. Fujii, Partially fault-tolerant quantum computing ar- chitecture with error-corrected clifford gates and space- time efficient analog rotations, PRX Quantum5, 010337 (2024)
work page 2024
-
[38]
C. N. Self, M. Benedetti, and D. Amaro, Protecting ex- pressive circuits with a quantum error detection code, Nature Physics20, 219 (2024). 10
work page 2024
-
[39]
K. Mayer, C. Ryan-Anderson, N. Brown, E. Durso- Sabina, C. H. Baldwin, D. Hayes, J. M. Dreiling, C. Foltz, J. P. Gaebler, T. M. Gatterman, J. A. Gerber, K. Gilmore, D. Gresh, N. Hewitt, C. V. Horst, J. Jo- hansen, T. Mengle, M. Mills, S. A. Moses, P. E. Siegfried, B. Neyenhuis, J. Pino, and R. Stutz, Benchmarking logi- cal three-qubit quantum fourier tran...
-
[40]
B. W. Reichardt, D. Aasen, R. Chao, A. Chernogu- zov, W. van Dam, J. P. Gaebler, D. Gresh, D. Luc- chetti, M. Mills, S. A. Moses, B. Neyenhuis, A. Paet- znick, A. Paz, P. E. Siegfried, M. P. da Silva, K. M. Svore, Z. Wang, and M. Zanner, Demonstration of quan- tum computation and error correction with a tesseract code (2024)
work page 2024
-
[41]
M. P. da Silva, C. Ryan-Anderson, J. M. Bello-Rivas, A. Chernoguzov, J. M. Dreiling, C. Foltz, F. Frachon, J. P. Gaebler, T. M. Gatterman, L. Grans-Samuelsson, D. Hayes, N. Hewitt, J. Johansen, D. Lucchetti, M. Mills, S. A. Moses, B. Neyenhuis, A. Paz, J. Pino, P. Siegfried, J. Strabley, A. Sundaram, D. Tom, S. J. Wernli, M. Zan- ner, R. P. Stutz, and K. ...
work page internal anchor Pith review Pith/arXiv arXiv 2024
-
[42]
B. W. Reichardt, A. Paetznick, D. Aasen, I. Basov, J. M. Bello-Rivas, P. Bonderson, R. Chao, W. van Dam, M. B. Hastings, A. Paz, M. P. da Silva, A. Sundaram, K. M. Svore, A. Vaschillo, Z. Wang, M. Zanner, W. B. Cairncross, C.-A. Chen, D. Crow, H. Kim, J. M. Kin- dem, J. King, M. McDonald, M. A. Norcia, A. Ryou, M. Stone, L. Wadleigh, K. Barnes, P. Battagl...
work page internal anchor Pith review Pith/arXiv arXiv 2024
-
[43]
K. C. Miao, M. McEwen, J. Atalaya, D. Kafri, L. P. Pryadko, A. Bengtsson, A. Opremcak, K. J. Satzinger, Z. Chen, P. V. Klimov, C. Quintana, R. Acharya, K. An- derson, M. Ansmann, F. Arute, K. Arya, A. Asfaw, J. C. Bardin, A. Bourassa, J. Bovaird, L. Brill, B. B. Buckley, D. A. Buell, T. Burger, B. Burkett, N. Bush- nell, J. Campero, B. Chiaro, R. Collins,...
work page 2023
-
[44]
Google Quantum AI and Collaborators, Quantum error correction below the surface code threshold, Nature638, 920 (2025)
work page 2025
-
[45]
D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. B. Ataides, N. Maskara, I. Cong, X. Gao, P. S. Rodriguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V. Vuleti´ c, and M. D. Lukin, Logical quantum processor based on reconfigurable atom arrays, Nature626, 58–65 (2023)
work page 2023
-
[46]
L. Caune, L. Skoric, N. S. Blunt, A. Ruban, J. McDaniel, J. A. Valery, A. D. Patterson, A. V. Gramolin, J. Ma- janiemi, K. M. Barnes, T. Bialas, O. Bu˘ gdaycı, O. Craw- ford, G. P. Geh´ er, H. Krovi, E. Matekole, C. Topal, S. Po- letto, M. Bryant, K. Snyder, N. I. Gillespie, G. Jones, K. Johar, E. T. Campbell, and A. D. Hill, Demonstrat- ing real-time and...
-
[47]
N. Lacroixet al., Scaling and logic in the color code on a superconducting quantum processor (2024), arXiv:2412.14256 [quant-ph]
-
[48]
N. S. Blunt, G. P. Geh´ er, and A. E. Moylett, Compila- tion of a simple chemistry application to quantum error correction primitives, Phys. Rev. Res.6, 013325 (2024)
work page 2024
-
[49]
J. M. Pino, J. M. Dreiling, C. Figgatt, J. P. Gaebler, S. A. Moses, M. S. Allman, C. H. Baldwin, M. Foss-Feig, D. Hayes, K. Mayer, C. Ryan-Anderson, and B. Neyen- huis, Demonstration of the trapped-ion quantum CCD computer architecture, Nature592, 209 (2021)
work page 2021
-
[50]
S. A. Moses, C. H. Baldwin, M. S. Allman, R. An- cona, L. Ascarrunz, C. Barnes, J. Bartolotta, B. Bjork, P. Blanchard, M. Bohn, J. G. Bohnet, N. C. Brown, N. Q. Burdick, W. C. Burton, S. L. Campbell, J. P. Campora, C. Carron, J. Chambers, J. W. Chan, Y. H. Chen, A. Chernoguzov, E. Chertkov, J. Colina, J. P. Curtis, R. Daniel, M. DeCross, D. Deen, C. Delan...
work page 2023
-
[51]
C. J. Trout and K. R. Brown, Magic state distillation and gate compilation in quantum algorithms for quantum chemistry, Int. J. Quantum Chem.115, 1296 (2015)
work page 2015
-
[52]
A. Szabo and N. S. Ostlund,Modern Quantum Chem- istry: Introduction to Advanced Electronic Structure The- ory(Dover, New York, 1996)
work page 1996
-
[53]
T. Helgaker, P. Jorgensen, and J. Olsen,Molecular Electronic-Structure Theory(Wiley, New York, 2014)
work page 2014
-
[54]
W. v. Dam, H. Liu, G. H. Low, A. Paetznick, A. Paz, S. Marcus, A. Sundaram, K. Svore, and M. Troyer, End- to-end quantum simulation of a chemical system
- [55]
-
[56]
A. Tranter, C. Di Paola, D. Mu˜ noz Ramo, D. Z. Manrique, D. Gowland, E. Plekhanov, G. Greene- Diniz, G. Christopoulou, G. Prokopiou, H. D. J. Keen, I. Polyak, I. T. Khan, J. Pilipczuk, J. J. M. Kirsopp, K. Yamamoto, M. Tudorovskaya, M. Krompiec, M. Sze, N. Fitzpatrick, R. J. Anderson, and V. Bhasker, In- Quanto: Quantum Computational Chemistry (2022)
work page 2022
-
[57]
Q. Sun, T. C. Berkelbach, N. S. Blunt, G. H. Booth, S. Guo, Z. Li, J. Liu, J. D. McClain, E. R. Sayfutyarova, S. Sharma, S. Wouters, and G. K.-L. Chan, Pyscf: the python-based simulations of chemistry framework, Wiley Interdiscip. Rev. Comput. Mol. Sci.8, e1340 (2018)
work page 2018
-
[58]
C. Ryan-Anderson, PECOS: Performance Estima- tor of Codes On Surfaces,https://github.com/ PECOS-packages/PECOS(2018)
work page 2018
-
[59]
Lloyd, Universal quantum simulators, Science273, 1073 (1996)
S. Lloyd, Universal quantum simulators, Science273, 1073 (1996)
work page 1996
-
[60]
A. Steane, Multiple-particle interference and quantum er- ror correction, Proceedings of the Royal Society of Lon- don. Series A: Mathematical, Physical and Engineering Sciences452, 2551 (1997)
work page 1997
-
[61]
C. Ryan-Anderson, J. G. Bohnet, K. Lee, D. Gresh, A. Hankin, J. P. Gaebler, D. Francois, A. Chernoguzov, D. Lucchetti, N. C. Brown, T. M. Gatterman, S. K. Halit, K. Gilmore, J. A. Gerber, B. Neyenhuis, D. Hayes, and R. P. Stutz, Realization of real-time fault-tolerant quan- tum error correction, Phys. Rev. X11, 041058 (2021)
work page 2021
-
[62]
Magic state cultivation: growing T states as cheap as CNOT gates
C. Gidney, N. Shutty, and C. Jones, Magic state culti- vation: growing t states as cheap as cnot gates (2024), arXiv:2409.17595 [quant-ph]
work page internal anchor Pith review Pith/arXiv arXiv 2024
-
[63]
C. Gidney and A. G. Fowler, Efficient magic state fac- tories with a catalyzed|CCZ⟩to 2|T⟩transformation, Quantum3, 135 (2019)
work page 2019
-
[64]
D. Litinski, A Game of Surface Codes: Large-Scale Quan- tum Computing with Lattice Surgery, Quantum3, 128 (2019)
work page 2019
-
[65]
S. Bravyi and A. Kitaev, Universal quantum computa- tion with ideal clifford gates and noisy ancillas, Phys. Rev. A71, 022316 (2005)
work page 2005
- [66]
-
[67]
Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates
V. Kliuchnikov, D. Maslov, and M. Mosca, Fast and ef- ficient exact synthesis of single qubit unitaries generated by clifford and t gates (2013), arXiv:1206.5236 [quant- ph]
work page internal anchor Pith review Pith/arXiv arXiv 2013
-
[68]
A. Y. Kitaev, Quantum computations: algorithms and error correction, Russian Mathematical Surveys52, 1191 (1997)
work page 1997
-
[69]
R. Chao and B. W. Reichardt, Quantum error correction with only two extra qubits, Phys. Rev. Lett.121, 050502 (2018)
work page 2018
-
[70]
H. Goto, Minimizing resource overheads for fault-tolerant preparation of encoded states of the steane code, Sci. Rep.6, 19578 (2016)
work page 2016
-
[71]
L. Postler, F. Butt, I. Pogorelov, C. D. Marciniak, S. Heußen, R. Blatt, P. Schindler, M. Rispler, M. M¨ uller, and T. Monz, Demonstration of fault-tolerant steane quantum error correction, PRX Quantum5, 030326 (2024)
work page 2024
-
[72]
S. Sivarajah, S. Dilkes, A. Cowtan, W. Simmons, A. Edg- ington, and R. Duncan, t—ket⟩: a retargetable com- piler for NISQ devices, Quantum Sci. Technol.6, 014003 (2020)
work page 2020
-
[73]
Quantinuum nexus (2024)
work page 2024
-
[74]
A. W. Cross, L. S. Bishop, J. A. Smolin, and J. M. Gam- betta, Open quantum assembly language, arXiv [quant- ph] (2017), arXiv:1707.03429 [quant-ph]
work page internal anchor Pith review Pith/arXiv arXiv 2017
- [75]
-
[76]
Digital quantum magnetism on a trapped-ion quantum computer
R. Haghshenaset al., Digital quantum magnetism at the frontier of classical simulations (2025), arXiv:2503.20870 [quant-ph]
work page internal anchor Pith review Pith/arXiv arXiv 2025
-
[77]
Quantinuum System: Emulator Noise Model, accessed on August 6th, 2025
work page 2025
- [78]
-
[79]
S. Dasu, B. Criger, C. Foltz, J. A. Gerber, C. N. Gilbreth, K. Gilmore, C. A. Holliman, N. K. Lysne, A. R. Milne, D. Okuno, G. Vittorini, and D. Hayes, Order-of-magnitude extension of qubit lifetimes with a decoherence-free subspace quantum error correction code (2025), arXiv:2503.22107 [quant-ph]
-
[80]
A. Dua, A. Kubica, L. Jiang, S. T. Flammia, and M. J. Gullans, Clifford-deformed surface codes, PRX Quantum 5, 10.1103/prxquantum.5.010347 (2024)
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.