Problem specific classical optimization of Hamiltonian simulation
- URL: http://arxiv.org/abs/2306.07208v2
- Date: Thu, 12 Oct 2023 16:23:18 GMT
- Title: Problem specific classical optimization of Hamiltonian simulation
- Authors: Refik Mansuroglu and Felix Fischer and Michael J. Hartmann
- Abstract summary: We present a classical pre-processing routine for variational Hamiltonian simulation.
We show that there always exists potential for optimization with respect to a Trotter sequence of the same order.
We find accuracy improvements of more than three orders of magnitude for our method as compared to Trotter sequences of the same gate number.
- Score: 1.602751335094621
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Nonequilibrium time evolution of large quantum systems is a strong candidate
for quantum advantage. Variational quantum algorithms have been put forward for
this task, but their quantum optimization routines suffer from trainability and
sampling problems. Here, we present a classical pre-processing routine for
variational Hamiltonian simulation that circumvents the need of a quantum
optimization by expanding rigorous error bounds in a perturbative regime for
suitable time steps. The resulting cost function is efficiently computable on a
classical computer. We show that there always exists potential for optimization
with respect to a Trotter sequence of the same order and that the cost value
has the same scaling as for Trotter in simulation time and system size. Unlike
previous work on classical pre-processing, the method is applicable to any
Hamiltonian system independent of locality and interaction lengths. Via
numerical experiments for spin-lattice models, we find that our approach
significantly improves digital quantum simulations capabilities with respect to
Trotter sequences for the same resources. For short times, we find accuracy
improvements of more than three orders of magnitude for our method as compared
to Trotter sequences of the same gate number. Moreover, for a given gate number
and accuracy target, we find that the pre-optimization we introduce enables
simulation times that are consistently more than 10 times longer for a target
accuracy of 0.1%.
Related papers
- Making Trotterization adaptive and energy-self-correcting for NISQ
devices and beyond [0.0]
Simulation of continuous time evolution requires time discretization on both classical and quantum computers.
We introduce a quantum algorithm to solve this problem, providing a controlled solution of the quantum many-body dynamics of local observables.
Our algorithm can be potentially useful on a more general level whenever time discretization is involved concerning, for instance, also numerical approaches based on time-evolving block decimation methods.
arXiv Detail & Related papers (2022-09-26T12:54:32Z) - Classically optimized Hamiltonian simulation [0.0]
Hamiltonian simulation is a promising application for quantum computers.
We show that, compared to Trotter product formulas, the classically optimized circuits can be orders of magnitude more accurate.
arXiv Detail & Related papers (2022-05-23T16:14:43Z) - Identification of topological phases using classically-optimized
variational quantum eigensolver [0.6181093777643575]
Variational quantum eigensolver (VQE) is regarded as a promising candidate of hybrid quantum-classical algorithm for quantum computers.
We propose classically-optimized VQE (co-VQE), where the whole process of the optimization is efficiently conducted on a classical computer.
In co-VQE, we only use quantum computers to measure nonlocal quantities after the parameters are optimized.
arXiv Detail & Related papers (2022-02-07T02:26:58Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Variational Hamiltonian simulation for translational invariant systems
via classical pre-processing [0.0]
We introduce a variational algorithm which uses solutions of classical optimizations to predict efficient quantum circuits.
Our strategy can improve upon the Trotter- Suzuki accuracy by several orders of magnitude.
We can extrapolate our method to beyond classically simulatable system sizes.
arXiv Detail & Related papers (2021-06-07T14:59:50Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Fast and differentiable simulation of driven quantum systems [58.720142291102135]
We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods.
We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
arXiv Detail & Related papers (2020-12-16T21:43:38Z) - Quantum-optimal-control-inspired ansatz for variational quantum
algorithms [105.54048699217668]
A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form.
Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries.
This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
arXiv Detail & Related papers (2020-08-03T18:00:05Z) - Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware.
On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
arXiv Detail & Related papers (2020-04-15T05:16:24Z) - Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
Random quantum circuits are commonly viewed as hard to simulate classically.
We show that approximate simulation of typical instances is almost as hard as exact simulation.
We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
arXiv Detail & Related papers (2019-12-31T19:00:00Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.