Quantum adiabatic brachistochrone for open systems
- URL: http://arxiv.org/abs/2006.13718v2
- Date: Wed, 13 Jan 2021 11:24:33 GMT
- Title: Quantum adiabatic brachistochrone for open systems
- Authors: Alan C. Santos, Celso J. Villas-Boas, Romain Bachelard
- Abstract summary: We compute a quantum adiabatic brachistochrone (QAB) for open systems.
A numerical protocol is devised, which allows to compute the QAB for arbitrary quantum systems.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose a variational principle to compute a quantum adiabatic
brachistochrone (QAB) for open systems. Using the notion of "adiabatic speed"
based on the energy gaps, we derive a Lagrangian associated to the functional
measuring the time spent to achieve adiabatic behavior, which in turn allows us
to perform the optimization. The QAB is illustrated for non-unitary dynamics of
STIRAP process, the Deutsch-Jozsa quantum computing algorithm and of a transmon
qutrit. A numerical protocol is devised, which allows to compute the QAB for
arbitrary quantum systems for which exact simulations can be afforded. We also
establish sufficient conditions for the equivalence between the Lagrangians,
and thus the QAB, of open and closed systems.
Related papers
- Efficient charge-preserving excited state preparation with variational quantum algorithms [33.03471460050495]
We introduce a charge-preserving VQD (CPVQD) algorithm, designed to incorporate symmetry and the corresponding conserved charge into the VQD framework.
Results show applications in high-energy physics, nuclear physics, and quantum chemistry.
arXiv Detail & Related papers (2024-10-18T10:30:14Z) - Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers.
Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
arXiv Detail & Related papers (2024-06-17T14:10:10Z) - Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale.
Our experiments show that this approach significantly outperforms the adiabatic algorithm.
arXiv Detail & Related papers (2024-05-31T17:07:43Z) - GRAPE optimization for open quantum systems with time-dependent
decoherence rates driven by coherent and incoherent controls [77.34726150561087]
The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control.
We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls.
The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
arXiv Detail & Related papers (2023-07-17T13:37:18Z) - Quantum Thermal State Preparation [39.91303506884272]
We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations.
We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states.
Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
arXiv Detail & Related papers (2023-03-31T17:29:56Z) - Digital quantum simulation of non-perturbative dynamics of open systems
with orthogonal polynomials [0.0]
We propose the use of the Time Evolving Density operator with Orthogonal Polynomials Algorithm (TEDOPA) on a quantum computer.
We show that exponential scalings of computational resources can potentially be avoided for time-evolution simulations of the systems considered in this work.
arXiv Detail & Related papers (2022-03-28T11:16:33Z) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z) - Hybrid quantum variational algorithm for simulating open quantum systems
with near-term devices [0.0]
Hybrid quantum-classical (HQC) algorithms make it possible to use near-term quantum devices supported by classical computational resources.
We develop an HQC algorithm using an efficient variational optimization approach to simulate open system dynamics.
arXiv Detail & Related papers (2020-08-12T13:49:29Z) - Sufficient conditions for adiabaticity in open quantum systems [0.0]
We introduce sufficient conditions for the adiabatic approximation in open quantum systems.
We first illustrate our results by showing that the adiabatic approximation for open systems is compatible with the description of quantum thermodynamics at thermal equilibrium.
We also apply our sufficient conditions as a tool in quantum control, evaluating the adiabatic behavior for the Hamiltonians of both the Deutsch algorithm and the Landau-Zener model under decoherence.
arXiv Detail & Related papers (2020-07-29T22:19:42Z) - How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory? [0.0]
Adiabatic evolution of quantum systems have been studied as a potential means that physically realizes quantum computation.
This paper asks a bold question of how to make adiabatic quantum computation fit into the rapidly progressing framework of quantum automata theory.
arXiv Detail & Related papers (2020-01-15T11:29:59Z) - 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.