Sketching phase diagrams using low-depth variational quantum algorithms
- URL: http://arxiv.org/abs/2301.09369v1
- Date: Mon, 23 Jan 2023 11:25:04 GMT
- Title: Sketching phase diagrams using low-depth variational quantum algorithms
- Authors: Jan Lukas Bosse, Raul Santos and Ashley Montanaro
- Abstract summary: We investigate using quantum computers and the Variational Quantum Eigensolver (VQE) for this task.
In contrast to the task of preparing the exact ground state using VQE, sketching phase diagrams might require less quantum resources and accuracy.
We find that it is possible to predict the location of phase transitions up to reasonable accuracy using states produced by VQE.
- Score: 0.04297070083645048
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Mapping out phase diagrams of quantum systems using classical simulations can
be challenging or intractable due to the computational resources required to
simulate even small quantum systems far away from the thermodynamic limit. We
investigate using quantum computers and the Variational Quantum Eigensolver
(VQE) for this task. In contrast to the task of preparing the exact ground
state using VQE, sketching phase diagrams might require less quantum resources
and accuracy, because low fidelity approximations to the ground state may be
enough to correctly identify different phases. We used classical numerical
simulations of low-depth VQE circuits to compute order parameters for four
well-studied spin and fermion models which represent a mix of 1D and 2D, and
exactly-solvable and classically hard systems. We find that it is possible to
predict the location of phase transitions up to reasonable accuracy using
states produced by VQE even when their overlap with the true ground state is
small. Further, we introduce a model-agnostic predictor of phase transitions
based on the speed with which the VQE energy improves with respect to the
circuit depth, and find that in some cases this is also able to predict phase
transitions.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Compact fermionic quantum state preparation with a natural-orbitalizing variational quantum eigensolving scheme [0.0]
Near-term quantum state preparation is typically realized by means of the variational quantum eigensolver (VQE) algorithm.
We present a refined VQE scheme that consists in topping VQE with state-informed updates of the elementary fermionic modes.
For a fixed circuit structure, the method is shown to enhance the capabilities of the circuit to reach a state close to the target state without incurring too much overhead from shot noise.
arXiv Detail & Related papers (2024-06-20T10:23:28Z) - Unveiling quantum phase transitions from traps in variational quantum algorithms [0.0]
We introduce a hybrid algorithm that combines quantum optimization with classical machine learning.
We use LASSO for identifying conventional phase transitions and the Transformer model for topological transitions.
Our protocol significantly enhances efficiency and precision, opening new avenues in the integration of quantum computing and machine learning.
arXiv Detail & Related papers (2024-05-14T09:01:41Z) - Classical-to-Quantum Transfer Learning Facilitates Machine Learning with Variational Quantum Circuit [62.55763504085508]
We prove that a classical-to-quantum transfer learning architecture using a Variational Quantum Circuit (VQC) improves the representation and generalization (estimation error) capabilities of the VQC model.
We show that the architecture of classical-to-quantum transfer learning leverages pre-trained classical generative AI models, making it easier to find the optimal parameters for the VQC in the training stage.
arXiv Detail & Related papers (2023-05-18T03:08:18Z) - Simulating non-unitary dynamics using quantum signal processing with
unitary block encoding [0.0]
We adapt a recent advance in resource-frugal quantum signal processing to explore non-unitary imaginary time evolution on quantum computers.
We test strategies for optimising the circuit depth and the probability of successfully preparing the desired imaginary-time evolved states.
We find that QET-U for non-unitary dynamics is flexible, intuitive and straightforward to use, and suggest ways for delivering quantum advantage in simulation tasks.
arXiv Detail & Related papers (2023-03-10T19:00:33Z) - A self-consistent field approach for the variational quantum
eigensolver: orbital optimization goes adaptive [52.77024349608834]
We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE)
This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
arXiv Detail & Related papers (2022-12-21T23:15:17Z) - 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) - Improved variational quantum eigensolver via quasi-dynamical evolution [0.0]
The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm designed for current and near-term quantum devices.
There are problems with VQE that forbid a favourable scaling towards quantum advantage.
We propose and extensively test a quantum annealing inspired algorithm that supplements VQE.
The improved VQE avoids barren plateaus, exits local minima, and works with low-depth circuits.
arXiv Detail & Related papers (2022-02-21T11:21:44Z) - Simulating the Mott transition on a noisy digital quantum computer via
Cartan-based fast-forwarding circuits [62.73367618671969]
Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model.
Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models.
This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
arXiv Detail & Related papers (2021-12-10T17:32:15Z) - Determining ground-state phase diagrams on quantum computers via a
generalized application of adiabatic state preparation [61.49303789929307]
We use a local adiabatic ramp for state preparation to allow us to directly compute ground-state phase diagrams on a quantum computer via time evolution.
We are able to calculate an accurate phase diagram on both two and three site systems using IBM quantum machines.
arXiv Detail & Related papers (2021-12-08T23:59:33Z)
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.