Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era
arXiv:2301.04150 · doi:10.22331/q-2025-07-21-1800
Abstract
Fault-tolerant quantum computation (FTQC) is essential to implement quantum algorithms in a noise-resilient way, and thus to enjoy advantages of quantum computers even with presence of noise. In FTQC, a quantum circuit is decomposed into universal gates that can be fault-tolerantly implemented, for example, Clifford+T gates. Here, T gate is usually regarded as an essential resource for quantum computation because its action cannot be simulated efficiently on classical computers and it is experimentally difficult to implement fault-tolerantly. Practically, it is highly likely that only a limited number of T gates are available in the near future. Pre-FTQC era, due to the constraint on available resources, it is vital to precisely estimate the decomposition error of a whole circuit. In this paper, we propose that the Clifford+T decomposition error for a given quantum circuit containing a large number of quantum gates can be modeled as the depolarizing noise by averaging the decomposition error for each quantum gate in the circuit, and our model provides more accurate error estimation than the naive estimation. We exemplify this by taking unitary coupled-cluster (UCC) ansatz used in the applications of quantum computers to quantum chemistry as an example. We theoretically evaluate the approximation error of UCC ansatz when decomposed into Clifford+T gates, and the numerical simulation for a wide variety of molecules verified that our model well explains the total decomposition error of the ansatz. Our results enable the precise and efficient usage of quantum resources in the early-stage applications of quantum computers and fuel further research towards what quantum computation can achieve in the upcoming future.
arXiv comment28 pages, (5+22) figures, v3: published version
References in corpus (39)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A variational eigenvalue solver on a quantum processor
- Quantum computational advantage using photons
- Quantum Teleportation is a Universal Computational Primitive
- Dynamical Decoupling of Open Quantum Systems
- Quantum computational chemistry
- Improved Simulation of Stabilizer Circuits
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Chemistry in the Age of Quantum Computing
- Quantum Algorithms Revisited
- Quantum Computing with Very Noisy Devices
- Strong quantum computational advantage using a superconducting quantum processor
- A Theory of Fault-Tolerant Quantum Computation
- Elucidating Reaction Mechanisms on Quantum Computers
- Quantum Error Mitigation
- Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- Methodology for quantum logic gate constructions
- Active stabilisation, quantum computation and quantum state synthesis
- Qulacs: a fast and versatile quantum circuit simulator for research purpose
- Even more efficient quantum computations of chemistry through tensor hypercontraction
- Quantum computing enhanced computational catalysis
- Is there evidence for exponential quantum advantage in quantum chemistry?
- A Quantum Computing View on Unitary Coupled Cluster Theory
- Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
- Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
- Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
- Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras
- The electronic complexity of the ground-state of the FeMo cofactor of nitrogenase as relevant to quantum simulations
- Early Fault-Tolerant Quantum Computing
- Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
- Shorter gate sequences for quantum computing by mixing unitaries
- Hunting for quantum-classical crossover in condensed matter problems
- Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations
- On proving the robustness of algorithms for early fault-tolerant quantum computers
- Probabilistic unitary synthesis with optimal accuracy
- Classical variational optimization of PREPARE circuit for quantum phase estimation of quantum chemistry Hamiltonians