Accurate Learning of Equivariant Quantum Systems from a Single Ground State
- URL: http://arxiv.org/abs/2405.12309v1
- Date: Mon, 20 May 2024 18:13:15 GMT
- Title: Accurate Learning of Equivariant Quantum Systems from a Single Ground State
- Authors: Štěpán Šmíd, Roberto Bondesan,
- Abstract summary: We show how to learn properties of all ground states for systems with periodic boundary conditions from a single ground state sample.
We prove that the prediction error tends to zero in the thermodynamic limit and numerically verify the results.
- Score: 7.980273012483663
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Predicting properties across system parameters is an important task in quantum physics, with applications ranging from molecular dynamics to variational quantum algorithms. Recently, provably efficient algorithms to solve this task for ground states within a gapped phase were developed. Here we dramatically improve the efficiency of these algorithms by showing how to learn properties of all ground states for systems with periodic boundary conditions from a single ground state sample. We prove that the prediction error tends to zero in the thermodynamic limit and numerically verify the results.
Related papers
- Efficiency of Dynamical Decoupling for (Almost) Any Spin-Boson Model [44.99833362998488]
We analytically study the dynamical decoupling of a two-level system coupled with a structured bosonic environment.
We find sufficient conditions under which dynamical decoupling works for such systems.
Our bounds reproduce the correct scaling in various relevant system parameters.
arXiv Detail & Related papers (2024-09-24T04:58:28Z) - Reaction dynamics with qubit-efficient momentum-space mapping [42.408991654684876]
We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response.
We consider a qubit-efficient mapping on a lattice, which can be efficiently performed using momentum-space basis states.
arXiv Detail & Related papers (2024-03-30T00:21:46Z) - Improved iterative quantum algorithm for ground-state preparation [4.921552273745794]
We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian system.
Our approach has advantages including the higher success probability at each iteration, the measurement precision-independent sampling complexity, the lower gate complexity, and only quantum resources are required when the ancillary state is well prepared.
arXiv Detail & Related papers (2022-10-16T05:57:43Z) - Real-Time Krylov Theory for Quantum Computing Algorithms [0.0]
New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information.
We develop the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware.
We discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.
arXiv Detail & Related papers (2022-08-01T18:00:48Z) - Variational Approach to Quantum State Tomography based on Maximal
Entropy Formalism [3.6344381605841187]
We employ the maximal entropy formalism to construct the least biased mixed quantum state that is consistent with the given set of expectation values.
We employ a parameterized quantum circuit and a hybrid quantum-classical variational algorithm to obtain such a target state making our recipe easily implementable on a near-term quantum device.
arXiv Detail & Related papers (2022-06-06T01:16:22Z) - Probing finite-temperature observables in quantum simulators of spin
systems with short-time dynamics [62.997667081978825]
We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality.
We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
arXiv Detail & Related papers (2022-06-03T18:00:02Z) - Quantum Davidson Algorithm for Excited States [42.666709382892265]
We introduce the quantum Krylov subspace (QKS) method to address both ground and excited states.
By using the residues of eigenstates to expand the Krylov subspace, we formulate a compact subspace that aligns closely with the exact solutions.
Using quantum simulators, we employ the novel QDavidson algorithm to delve into the excited state properties of various systems.
arXiv Detail & Related papers (2022-04-22T15:03:03Z) - Variational dynamics as a ground-state problem on a quantum computer [0.0]
We propose a variational quantum algorithm to study the real time dynamics of quantum systems as a ground-state problem.
The method is based on the original proposal of Feynman and Kitaev to encode time into a register of auxiliary qubits.
arXiv Detail & Related papers (2022-04-07T13:58:14Z) - Numerical Simulations of Noisy Quantum Circuits for Computational
Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules.
We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z) - 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 Quantum Algorithms for Steady States of Open Quantum Systems [2.740982822457262]
We propose a variational quantum algorithm to find the steady state of open quantum systems.
The fidelity between the optimal mixed state and the true steady state is over 99%.
This algorithm is derived from the natural idea of expressing mixed states with purification.
arXiv Detail & Related papers (2020-01-08T14:47:36Z)
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.