Quantum computing critical exponents
- URL: http://arxiv.org/abs/2104.01168v1
- Date: Fri, 2 Apr 2021 17:38:20 GMT
- Title: Quantum computing critical exponents
- Authors: Henrik Dreyer, Mircea Bejan, Etienne Granet
- Abstract summary: We show that the Variational Quantum-Classical Simulation algorithm admits a finite circuit depth scaling collapse when targeting the critical point of the transverse field Ising chain.
The order parameter only collapses on one side of the transition due to a slowdown of the quantum algorithm when crossing the phase transition.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We show that the Variational Quantum-Classical Simulation algorithm admits a
finite circuit depth scaling collapse when targeting the critical point of the
transverse field Ising chain. The order parameter only collapses on one side of
the transition due to a slowdown of the quantum algorithm when crossing the
phase transition. In order to assess performance of the quantum algorithm and
compute correlations in a system of up to 752 qubits, we use techniques from
integrability to derive closed-form analytical expressions for expectation
values with respect to the output of the quantum circuit. We also reduce a
conjecture made by Ho and Hsieh about the exact preparation of the transverse
field Ising ground state to a system of equations.
Related papers
- Boundary Treatment for Variational Quantum Simulations of Partial Differential Equations on Quantum Computers [1.6318838452579472]
The paper presents a variational quantum algorithm to solve initial-boundary value problems described by partial differential equations.
The approach uses classical/quantum hardware that is well suited for quantum computers of the current noisy intermediate-scale quantum era.
arXiv Detail & Related papers (2024-02-28T18:19:33Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Quantum Computation of Phase Transition in Interacting Scalar Quantum
Field Theory [0.0]
It has been demonstrated that the critical point of the phase transition in scalar quantum field theory can be approximated via a Gaussian Effective Potential (GEP)
We perform quantum computations with various lattice sizes and obtain evidence of a transition from a symmetric to a symmetry-broken phase.
We implement the ten-site case on IBM quantum hardware using the Variational Quantum Eigensolver (VQE) algorithm to minimize the GEP.
arXiv Detail & Related papers (2023-03-04T14:11:37Z) - Universality of critical dynamics with finite entanglement [68.8204255655161]
We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement.
Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
arXiv Detail & Related papers (2023-01-23T19:23:54Z) - Adiabatic quantum computing with parameterized quantum circuits [0.0]
We propose a discrete version of adiabatic quantum computing that can be implemented in a near-term device.
We compare our proposed algorithm with the Variational Quantum Eigensolver on two classical optimization problems.
arXiv Detail & Related papers (2022-06-09T09:31:57Z) - 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) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - Measurement-induced entanglement phase transitions in variational
quantum circuits [0.4499833362998487]
Variational quantum algorithms (VQAs) classically optimize a parametrized quantum circuit to solve a computational task.
We study the entanglement transition in variational quantum circuits endowed with intermediate projective measurements.
Our work paves an avenue for greatly improving the trainability of quantum circuits by incorporating intermediate measurement protocols in currently available quantum hardware.
arXiv Detail & Related papers (2021-11-15T19:00:28Z) - Improving the Performance of Deep Quantum Optimization Algorithms with
Continuous Gate Sets [47.00474212574662]
Variational quantum algorithms are believed to be promising for solving computationally hard problems.
In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances.
Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
arXiv Detail & Related papers (2020-05-11T17:20:51Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z) - 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.