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

Abstract

We estimate the resources required in the fusion-based quantum computing scheme to simulate electrolyte molecules in Li-ion batteries on a fault-tolerant, photonic quantum computer. We focus on the molecules that can provide practical solutions to industrially relevant problems. Certain fault-tolerant operations require the use of single-qubit "magic states" prepared by dedicated "magic state factories" (MSFs). Producing and consuming magic states in parallel is typically a prohibitively expensive task, resulting in the serial application of fault-tolerant gates. However, for the systems considered, the MSF constitutes a negligible fraction of the total footprint of the quantum computer, allowing for the use of multiple MSFs to produce magic states in parallel. We suggest architectural and algorithmic techniques that can accommodate such a capability. We propose a method to consume multiple magic states simultaneously, which can potentially lead to an order of magnitude reduction in the computational runtime without additional expense in the footprint.

arXiv comment26 pages, 10 Figures, 9 tables

References in corpus (50)

• Fault-tolerant quantum computation by anyons
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Measurement-based quantum computation with cluster states
• Quantum computational chemistry
• Improved Simulation of Stabilizer Circuits
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Hamiltonian Simulation by Qubitization
• Resource-efficient linear optical quantum computation
• Elucidating Reaction Mechanisms on Quantum Computers
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Topological fault-tolerance in cluster state quantum computation
• Surface code quantum computing by lattice surgery
• A fault-tolerant one-way quantum computer
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Magic state distillation with low overhead
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Building a fault-tolerant quantum computer using concatenated cat codes
• Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
• Quantum computing enhanced computational catalysis
• New Benchmark Set of Transition-Metal Coordination Reactions for the Assessment of Density Functionals
• Quantum circuits of T-depth one
• Generation and sampling of quantum states of light in a silicon chip
• Almost-linear time decoding algorithm for topological codes
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Magic State Distillation: Not as Costly as You Think
• Novel constructions for the fault-tolerant Toffoli gate
• Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources
• Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
• Unfolding the color code
• Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
• The electronic complexity of the ground-state of the FeMo cofactor of nitrogenase as relevant to quantum simulations
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Hamiltonian Simulation Using Linear Combinations of Unitary Operations
• A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
• A magic state's fidelity can be superior to the operations that created it
• $\pi$-Corrected Heisenberg Limit
• Early fault-tolerant simulations of the Hubbard model
• Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates
• Quantum Chemistry Simulations of Dominant Products in Lithium-Sulfur Batteries
• Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
• Universal fault-tolerant measurement-based quantum computation
• Transversal Clifford gates on folded surface codes
• Simple scheme for encoding and decoding a qubit in unknown state for various topological codes
• Exponentially faster implementations of Select(H) for fermionic Hamiltonians
• The Promise of Quantum Simulation
• Magic State Distillation at Intermediate Size
• Quantum block lookahead adders and the wait for magic states

Cited by in corpus (55)

• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Low-overhead fault-tolerant quantum computing using long-range connectivity
• Early Fault-Tolerant Quantum Computing
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Benchmarking quantum computers
• Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision
• Towards near-term quantum simulation of materials
• Simulating key properties of lithium-ion batteries with a fault-tolerant quantum computer
• Efficient quantum computation of molecular forces and other energy gradients
• Optimizing resource efficiencies for scalable full-stack quantum computers
• Initial state preparation for quantum chemistry on quantum computers
• Partitioning qubits in hypergraph product codes to implement logical gates
• Morphing quantum codes
• Fold-Transversal Clifford Gates for Quantum Codes
• Seeking a quantum advantage with trapped-ion quantum simulations of condensed-phase chemical dynamics
• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
• Scalable Networking of Neutral-Atom Qubits: Nanofiber-Based Approach for Multiprocessor Fault-Tolerant Quantum Computer
• Quantum simulation of battery materials using ionic pseudopotentials
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Fault-tolerant Post-Selection for Low Overhead Magic State Preparation
• Efficient Construction of a Control Modular Adder on a Carry-Lookahead Adder Using Relative-phase Toffoli Gates
• Fault-tolerant quantum computation of molecular observables
• Faster quantum chemistry simulations on a quantum computer with improved tensor factorization and active volume compilation
• Continuous Hamiltonian dynamics on digital quantum computers without discretization error
• Rise of conditionally clean ancillae for efficient quantum circuit constructions
• Modeling the Performance of Early Fault-Tolerant Quantum Algorithms
• High ground state overlap via quantum embedding methods
• Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation
• Compilation of a simple chemistry application to quantum error correction primitives
• On proving the robustness of algorithms for early fault-tolerant quantum computers
• Fault-tolerant logical measurements via homological measurement
• TFermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry
• Weight Reduced Stabilizer Codes with Lower Overhead
• Low-overhead quantum computing with the color code
• Code switching revisited: Low-overhead magic state preparation using color codes
• Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
• LUCI in the Surface Code with Dropouts
• Estimation of electrostatic interaction energies on a trapped-ion quantum computer
• Digital-analog quantum genetic algorithm using Rydberg-atom arrays
• Efficient ground-state energy estimation and certification on early fault-tolerant quantum computers
• Resource-optimized fault-tolerant simulation of the Fermi-Hubbard model and high-temperature superconductor models
• Minimizing resource overhead in fusion-based quantum computation using hybrid spin-photon devices
• Molecular Properties from Quantum Krylov Subspace Diagonalization
• Randomized semi-quantum matrix processing
• End-to-end switchless architecture for fault-tolerant photonic quantum computing
• The resource cost of large scale quantum computing
• Phase estimation with partially randomized time evolution
• High-precision and low-depth quantum algorithm design for eigenstate problems
• Does the full configuration interaction method based on quantum phase estimation with Trotter decomposition satisfy the size consistency condition?
• Parallel Logical Measurements via Quantum Code Surgery
• Optimizing Quantum Chemistry Simulations with a Hybrid Quantization Scheme
• Qubit frugal entanglement determination with the deep multi-scale entanglement renormalization ansatz
• Circuit-level fault tolerance of cat codes
• Benchmarking Quantum Simulation of Chemical Hamiltonians using the Sorted-List Encoding
• Determining Molecular Ground State with Quantum Imaginary Time Evolution using Broken-Symmetry Wave Function