Toward the first quantum simulation with quantum speedup
From MaRDI portal
Abstract: With quantum computers of significant size now on the horizon, we should understand how to best exploit their initially limited abilities. To this end, we aim to identify a practical problem that is beyond the reach of current classical computers, but that requires the fewest resources for a quantum computer. We consider quantum simulation of spin systems, which could be applied to understand condensed matter phenomena. We synthesize explicit circuits for three leading quantum simulation algorithms, employing diverse techniques to tighten error bounds and optimize circuit implementations. Quantum signal processing appears to be preferred among algorithms with rigorous performance guarantees, whereas higher-order product formulas prevail if empirical error estimates suffice. Our circuits are orders of magnitude smaller than those for the simplest classically-infeasible instances of factoring and quantum chemistry.
Recommendations
- Using quantum computers for quantum simulation
- An algebraic quantum circuit compression algorithm for Hamiltonian simulation
- Quantum algorithms for Hamiltonian simulation
- Faster quantum chemistry simulation on fault-tolerant quantum computers
- The challenge of quantum computer simulations of physical phenomena
Cited in
(52)- Toward prethreshold gate-based quantum simulation of chemical dynamics: using potential energy surfaces to simulate few-channel molecular collisions
- Quantum algorithm design: techniques and applications
- Algorithmic simulation of far-from-equilibrium dynamics using quantum computer
- Qsimulation V2.0: an optimized quantum simulator
- The variational quantum eigensolver: a review of methods and best practices
- Quantum generative adversarial networks based on Rényi divergences
- Quantum simulation of the ground-state Stark effect in small molecules: a case study using IBM Q
- Digital quantum simulation of dynamical topological invariants on near-term quantum computers
- Modeling complex quantum dynamics: evolution of numerical algorithms in the HPC context
- A survey on HHL algorithm: from theory to application in quantum machine learning
- Quantum science and quantum technology
- A little bit of classical magic to achieve (super-)quantum speedup
- Quantum harmonic oscillator model for fine-grained expressway traffic volume simulation considering individual heterogeneity
- Sample-size-reduction of quantum states for the noisy linear problem
- Quantum algorithm for preparing the ground state of a physical system through multi-step quantum resonant transitions
- Digital quantum simulation of non-equilibrium quantum many-body systems
- RISQ - reduced instruction set quantum computers
- Quantum Circuit Simulation
- Quantum circuits for spin and flavor degrees of freedom of quarks forming nucleons
- ACCELERATION OF QUANTUM ALGORITHMS USING THREE-QUBIT GATES
- scientific article; zbMATH DE number 7559364 (Why is no real title available?)
- An algebraic quantum circuit compression algorithm for Hamiltonian simulation
- Faster quantum chemistry simulation on fault-tolerant quantum computers
- Quantum algorithm for simulating real time evolution of lattice Hamiltonians
- Quantum advantage with shallow circuits
- scientific article; zbMATH DE number 6789291 (Why is no real title available?)
- Massively parallel quantum computer simulator, eleven years later
- A user-centric quantum benchmarking test suite and evaluation framework
- Clifford algebras, quantum neural networks and generalized quantum Fourier transform
- Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
- Digital Simulation of Single Qubit Markovian Open Quantum Systems: A Tutorial
- \textsf{symQV}: automated symbolic verification of quantum programs
- Average-case speedup for product formulas
- Using quantum computers for quantum simulation
- Dense outputs from quantum simulations
- Robust iterative method for symmetric quantum signal processing in all parameter regimes
- Quantum signal processing and nonlinear Fourier analysis
- Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling
- Quantum eigenvalue processing
- Selection and improvement of product formulae for best performance of quantum simulation
- Quantum algorithm for linear non-unitary dynamics with near-optimal dependence on all parameters
- Infinite quantum signal processing for arbitrary Szegő functions
- On Schrödingerization-based quantum algorithms for linear dynamical systems with inhomogeneous terms
- Quantum differential equation solvers: limitations and fast-forwarding
- Working session: Quantum signal processing and nonlinear Fourier analysis. Abstracts from the working session held October 6--11, 2024
- Uniform observable error bounds of Trotter formulae for the semiclassical Schrödinger equation
- Approximating exponentials of commutators by optimized product formulas
- On the Trotter error in many-body quantum dynamics with Coulomb potentials
- Quantum time-marching algorithms for solving linear transport problems including boundary conditions
- Schrödingerization-based quantum circuits for Maxwell's equations with time-dependent source terms
- Hamiltonian locality testing via Trotterized postselection
- Optimized Lie-Trotter-Suzuki decompositions for two and three non-commuting terms
This page was built for publication: Toward the first quantum simulation with quantum speedup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4967461)
