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.

26 pages, 10 Figures, 9 tables

References in corpus (11)

• Surface codes: Towards practical large-scale quantum computation
• Resource-efficient linear optical quantum computation
• Topological fault-tolerance in cluster state quantum computation
• Magic state distillation with low overhead
• New Benchmark Set of Transition-Metal Coordination Reactions for the Assessment of Density Functionals
• Quantum circuits of T-depth one
• Novel constructions for the fault-tolerant Toffoli gate
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• A magic state's fidelity can be superior to the operations that created it
• Simple scheme for encoding and decoding a qubit in unknown state for various topological codes
• Quantum block lookahead adders and the wait for magic states

Cited by in corpus (54)

• 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
• Fault-tolerant quantum computation of molecular observables
• Continuous Hamiltonian dynamics on digital quantum computers without discretization error
• Faster quantum chemistry simulations on a quantum computer with improved tensor factorization and active volume compilation
• Rise of conditionally clean ancillae for efficient quantum circuit constructions
• High ground state overlap via quantum embedding methods
• Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation
• Modeling the Performance of Early Fault-Tolerant Quantum Algorithms
• Compilation of a simple chemistry application to quantum error correction primitives
• Fault-tolerant logical measurements via homological measurement
• On proving the robustness of algorithms for early fault-tolerant quantum computers
• Low-overhead quantum computing with the color code
• Weight Reduced Stabilizer Codes with Lower Overhead
• TFermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry
• Code switching revisited: Low-overhead magic state preparation using color codes
• Estimation of electrostatic interaction energies on a trapped-ion quantum computer
• Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
• LUCI in the Surface Code with Dropouts
• Efficient ground-state energy estimation and certification on early fault-tolerant quantum computers
• Digital-analog quantum genetic algorithm using Rydberg-atom arrays
• Molecular Properties from Quantum Krylov Subspace Diagonalization
• Randomized semi-quantum matrix processing
• Minimizing resource overhead in fusion-based quantum computation using hybrid spin-photon devices
• Resource-optimized fault-tolerant simulation of the Fermi-Hubbard model and high-temperature superconductor models
• The resource cost of large scale quantum computing
• End-to-end switchless architecture for fault-tolerant photonic quantum computing
• Does the full configuration interaction method based on quantum phase estimation with Trotter decomposition satisfy the size consistency condition?
• Phase estimation with partially randomized time evolution
• High-precision and low-depth quantum algorithm design for eigenstate problems
• 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
• 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
• Circuit-level fault tolerance of cat codes