EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
From MaRDI portal
Publication:2971052
DOI10.1017/fms.2017.2zbMath1364.68213arXiv1312.1414OpenAlexW2593381501WikidataQ59438236 ScholiaQ59438236MaRDI QIDQ2971052
Rolando Somma, Robin Kothari, Richard Cleve, Andrew M. Childs, Dominic W. Berry
Publication date: 4 April 2017
Published in: Forum of Mathematics, Sigma, Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.1414
Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (38)
Efficient quantum circuits for Szegedy quantum walks ⋮ Optimal large-scale quantum state tomography with Pauli measurements ⋮ Duality quantum computer and the efficient quantum simulations ⋮ Improved reversible and quantum circuits for Karatsuba-based integer multiplication. ⋮ A Trotter-Suzuki approximation for Lie groups with applications to Hamiltonian simulation ⋮ (\(s, \ln^\kappa\))-weak tractability of linear problems ⋮ Quantum simulation of quantum field theories as quantum chemistry ⋮ Quantum spectral methods for differential equations ⋮ An ancilla-based quantum simulation framework for non-unitary matrices ⋮ Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target ⋮ Quantum algorithm for linear differential equations with exponentially improved dependence on precision ⋮ Context-aware quantum simulation of a matrix stored in quantum memory ⋮ Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture ⋮ Total functions in QMA ⋮ Quantum algorithm for preparing the ground state of a physical system through multi-step quantum resonant transitions ⋮ Wave Matrix Lindbladization I: Quantum Programs for Simulating Markovian Dynamics ⋮ Succinct description and efficient simulation of non-Markovian open quantum systems ⋮ Wave Matrix Lindbladization II: General Lindbladians, Linear Combinations, and Polynomials ⋮ Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision ⋮ Probabilistic nonunitary gate in imaginary time evolution ⋮ EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS ⋮ Optimization of quantum Hamiltonian evolution: From two projection operators to local Hamiltonians ⋮ Unnamed Item ⋮ A survey on HHL algorithm: from theory to application in quantum machine learning ⋮ Efficient quantum algorithms for state measurement and linear algebra applications ⋮ A Complete Characterization of Unitary Quantum Space ⋮ A quantum eigensolver for symmetric tridiagonal matrices ⋮ Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bounding the costs of quantum simulation of many-body physics in real space ⋮ Optimized Lie-Trotter-Suzuki decompositions for two and three non-commuting terms ⋮ The ghost in the radiation: robust encodings of the black hole interior ⋮ Exponentially more precise quantum simulation of fermions in second quantization ⋮ EC-\((s, t)\)-weak tractability of multivariate linear problems in the average case setting ⋮ How quantum is the speedup in adiabatic unstructured search? ⋮ Quantum approach to accelerate finite volume method on steady computational fluid dynamics problems ⋮ Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
Uses Software
Cites Work
- On the relationship between continuous- and discrete-time quantum walk
- Quantum Arthur-Merlin games
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Efficient algorithms for privately releasing marginals via convex relaxations
- Quantum algorithms for learning symmetric juntas via the adversary bound
- Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target
- The Geometry of Differential Privacy: The Small Database and Approximate Cases
- Faster Algorithms for Privately Releasing Marginals
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately Releasing Conjunctions and the Statistical Query Barrier
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Lower Bounds in Differential Privacy
- Iterative Constructions and Private Data Release
- Zero-knowledge against quantum attacks
- Universal Computation by Multiparticle Quantum Walk
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
- Characterizing the sample complexity of private learners
- Faster private release of marginals on small databases
- Discrete-query quantum algorithm for NAND trees
- Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
- Simulating Sparse Hamiltonians with Star Decompositions
- Universal Quantum Simulators
- Simulating quantum dynamics on a quantum computer
- Product formula methods for time-dependent Schrodinger problems
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Adiabatic quantum state generation and statistical zero knowledge
- Exponential algorithmic speedup by a quantum walk
- Differential Privacy and the Fat-Shattering Dimension of Linear Queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- General theory of fractal path integrals with applications to many-body theories and statistical physics
- Collusion-secure fingerprinting for digital data
- On the complexity of differentially private data release
- Efficient discrete-time simulations of continuous-time quantum query algorithms
- Advances in Cryptology – CRYPTO 2004
- Quantum lower bounds by polynomials
- Quantum Query Complexity of State Conversion
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Exponentially more precise quantum simulation of fermions in second quantization
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
