Random Compiler for Fast Hamiltonian Simulation.
Explore this paper's citation graph
Summary
A randomized compiler for Hamiltonian simulation where gate probabilities are proportional to the strength of a corresponding term in the Hamiltonian, especially suited to electronic structure Hamiltonians relevant to quantum chemistry.
- Type
- article
- Published
- 2018-11-19
- Cited by
- 390
- References
- 50
- Access
- Open access
- OpenAlex
- https://openalex.org/W31491106
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:54052506
Keywords
Physics
References
- Trotterization in universal quantum simulators under faulty control
- Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations
- Quantum information and computation
- On the Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
- Reducing the quantum-computing overhead with complex gate distillation
- A and V
- General theory of fractal path integrals with applications to many‐body theories and statistical physics
- Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors
- Surface codes: Towards practical large-scale quantum computation
- Simulated Quantum Computation of Molecular Energies
- Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space.
- Gate count estimates for performing quantum chemistry on small quantum computers
- Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
- Fractal decomposition of exponential operators with applications to many-body theories and Monte Carlo simulations
- Entanglement-free Heisenberg-limited phase estimation
- The interaction of TIGIT with PVR and PVRL2 inhibits human NK cell cytotoxicity
- Simulating Hamiltonian dynamics with a truncated Taylor series.
- Quantum algorithms revisited
- A variational eigenvalue solver on a photonic quantum processor
- Noise tailoring for scalable quantum computation via randomized compiling
Cited by
- The Road to Quantum Computational Supremacy
- Faster quantum simulation by randomization
- Quantum computational chemistry
- Quantum compilation and circuit optimisation via energy dissipation
- Nearly optimal lattice simulation by product formulas
- Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
- Optimising trotter-suzuki decompositions for quantum simulation using evolutionary strategies
- Q# and NWChem: Tools for Scalable Quantum Chemistry on Quantum Computers
- Lower bounds on the non-Clifford resources for quantum computations
- Subspace variational quantum simulator
- Time-dependent Hamiltonian simulation with L^1-norm scaling
- Analysis of superfast encoding performance for electronic structure simulations
- Well-conditioned multiproduct Hamiltonian simulation
- A Random Approach to Quantum Simulation
- Resource-efficient digital quantum simulation of d-level systems for photonic, vibrational, and spin-s Hamiltonians
- Stochastic gradient descent for hybrid quantum-classical optimization
- Quantum Hamiltonian-Based Models and the Variational Quantum Thermalizer Algorithm
- Variational fast forwarding for quantum simulation beyond the coherence time
- Compilation by stochastic Hamiltonian sparsification
- Quantum Algorithmic Techniques for Fault-Tolerant Quantum Computers
Related papers
No related papers recorded.