Long-time simulations with high fidelity on quantum hardware
- URL: http://arxiv.org/abs/2102.04313v1
- Date: Mon, 8 Feb 2021 16:18:50 GMT
- Title: Long-time simulations with high fidelity on quantum hardware
- Authors: Joe Gibbs, Kaitlin Gili, Zo\"e Holmes, Benjamin Commeau, Andrew
Arrasmith, Lukasz Cincio, Patrick J. Coles and Andrew Sornborger
- Abstract summary: We show that it is possible to implement long-time, high fidelity simulations on current hardware.
Specifically, we simulate an XY-model spin chain on the Rigetti and IBM quantum computers.
This is a factor of 150 longer than is possible using the iterated Trotter method.
- Score: 1.8909337252764988
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Moderate-size quantum computers are now publicly accessible over the cloud,
opening the exciting possibility of performing dynamical simulations of quantum
systems. However, while rapidly improving, these devices have short coherence
times, limiting the depth of algorithms that may be successfully implemented.
Here we demonstrate that, despite these limitations, it is possible to
implement long-time, high fidelity simulations on current hardware.
Specifically, we simulate an XY-model spin chain on the Rigetti and IBM quantum
computers, maintaining a fidelity of at least 0.9 for over 600 time steps. This
is a factor of 150 longer than is possible using the iterated Trotter method.
Our simulations are performed using a new algorithm that we call the fixed
state Variational Fast Forwarding (fsVFF) algorithm. This algorithm decreases
the circuit depth and width required for a quantum simulation by finding an
approximate diagonalization of a short time evolution unitary. Crucially, fsVFF
only requires finding a diagonalization on the subspace spanned by the initial
state, rather than on the total Hilbert space as with previous methods,
substantially reducing the required resources.
Related papers
- Subspace-Based Local Compilation of Variational Quantum Circuits for Large-Scale Quantum Many-Body Simulation [0.0]
This paper proposes a hybrid quantum-classical algorithm for compiling the time-evolution operator.
It achieves a 95% reduction in circuit depth compared to Trotterization while maintaining accuracy.
We estimate the gate count needed to execute the quantum simulations using the LSVQC on near-term quantum computing architectures.
arXiv Detail & Related papers (2024-07-19T09:50:01Z) - 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) - Nonlinear dynamics as a ground-state solution on quantum computers [39.58317527488534]
We present variational quantum algorithms (VQAs) that encode both space and time in qubit registers.
The spacetime encoding enables us to obtain the entire time evolution from a single ground-state computation.
arXiv Detail & Related papers (2024-03-25T14:06:18Z) - Nuclear Spectra from Quantum Lanczos Algorithm with Real-Time Evolution
and Multiple Reference States [0.0]
I performed numerical simulations to find the low-lying eigenstates of $20$Ne, $22$Na, and $29$Na to compare imaginary- and real-time evolution.
I present the quantum circuits for the QLanczos algorithm with real-time evolution and multiple references.
arXiv Detail & Related papers (2023-09-01T23:25:57Z) - Towards Neural Variational Monte Carlo That Scales Linearly with System
Size [67.09349921751341]
Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors.
The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems.
We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
arXiv Detail & Related papers (2022-12-21T19:00:04Z) - Online Convex Optimization of Programmable Quantum Computers to Simulate
Time-Varying Quantum Channels [26.888629265226264]
An arbitrary quantum channel cannot be exactly simulated using a finite-dimensional programmable quantum processor.
We study the challenging setting in which the channel to be simulated varies adversarially with time.
arXiv Detail & Related papers (2022-12-09T23:37:55Z) - 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) - 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) - Fragmented imaginary-time evolution for early-stage quantum signal
processors [0.0]
Simulating quantum imaginary-time evolution (QITE) is a major promise of quantum computation.
Our main contribution is a new generation of deterministic, high-precision QITE algorithms.
We present two QITE-circuit sub-routines with excellent complexity scaling.
arXiv Detail & Related papers (2021-10-25T18:02:24Z) - Fast-Forwarding with NISQ Processors without Feedback Loop [0.0]
We present the Classical Quantum Fast Forwarding (CQFF) as an alternative diagonalisation based algorithm for quantum simulation.
CQFF removes the need for a classical-quantum feedback loop and controlled multi-qubit unitaries.
Our work provides a $104$ improvement over the previous record.
arXiv Detail & Related papers (2021-04-05T14:29:33Z) - Simulation of Quantum Computing on Classical Supercomputers [23.350853237013578]
We propose a scheme based on cutting edges of undirected graphs.
This scheme cuts edges of undirected graphs with large tree width to obtain many undirected subgraphs.
It can simulate 120-qubit 3-regular QAOA algorithm on 4096-core supercomputer.
arXiv Detail & Related papers (2020-10-28T13:26:41Z)
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.