Efficient numerical simulation of complex Josephson quantum circuits
- URL: http://arxiv.org/abs/2010.14929v2
- Date: Wed, 16 Dec 2020 16:29:58 GMT
- Title: Efficient numerical simulation of complex Josephson quantum circuits
- Authors: Andrew J. Kerman
- Abstract summary: We present a new theoretical framework for approximate numerical simulation of Josephson quantum circuits.
Simulations based on this framework provide access to a degree of complexity and circuit size heretofore inaccessible to quantitative analysis.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Building on the established methods for superconducting circuit quantization,
we present a new theoretical framework for approximate numerical simulation of
Josephson quantum circuits. Simulations based on this framework provide access
to a degree of complexity and circuit size heretofore inaccessible to
quantitative analysis, including fundamentally new kinds of superconducting
quantum devices. This capability is made possible by two improvements over
previous methods: first, physically-motivated choices for the canonical circuit
modes and physical basis states which allow a highly-efficient matrix
representation; and second, an iterative method in which subsystems are
diagonalized separately and then coupled together, at increasing size scales
with each iteration, allowing diagonalization of Hamiltonians in extremely
large Hilbert spaces to be approximated using a sequence of diagonalizations in
much smaller spaces.
Related papers
- A quantum eigenvalue solver based on tensor networks [0.0]
Electronic ground states are of central importance in chemical simulations, but have remained beyond the reach of efficient classical algorithms.
We introduce a hybrid quantum-classical eigenvalue solver that constructs a wavefunction ansatz from a linear combination of matrix product states in rotated orbital bases.
This study suggests a promising new avenue for scaling up simulations of strongly correlated chemical systems on near-term quantum hardware.
arXiv Detail & Related papers (2024-04-16T02:04:47Z) - Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials.
It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method.
We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
arXiv Detail & Related papers (2024-02-22T16:33:48Z) - Stochastic Model of Qudit Measurement for Superconducting Quantum Information Processing [0.0]
This thesis focuses on modeling the dispersive measurement of a transmon qutrit in an open quantum system using quadrature detections.
Research has demonstrated the possibility of driving higher-order transitions in a transmon or designing innovative multimode superconducting circuits.
arXiv Detail & Related papers (2023-12-03T03:57:49Z) - Stochastic modeling of superconducting qudits in the dispersive regime [0.0773931605896092]
This work focuses on modeling the dispersive quadrature measurement in an open quantum system.
We verify our model with a series of experimental results on a transmon-type qutrit.
arXiv Detail & Related papers (2023-10-29T00:39:47Z) - Accelerating Quantum Optimal Control of Multi-Qubit Systems with
Symmetry-Based Hamiltonian Transformations [3.0126004742841253]
We present a novel, computationally efficient approach to accelerate quantum optimal control calculations of large multi-qubit systems.
Our approach reduces the Hamiltonian size of an $n$-qubit system from 2n by 2n to O(n by n) or O((2n / n) by (2n / n) under Sn or Dn symmetry.
arXiv Detail & Related papers (2023-09-12T00:08:17Z) - General quantum algorithms for Hamiltonian simulation with applications
to a non-Abelian lattice gauge theory [44.99833362998488]
We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers.
The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions.
The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
arXiv Detail & Related papers (2022-12-28T18:56:25Z) - 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) - Two-dimensional $\mathbb{Z}_2$ lattice gauge theory on a near-term
quantum simulator: variational quantum optimization, confinement, and
topological order [0.0]
We propose an implementation of a two-dimensional $mathbbZ$ lattice gauge theory model on a shallow quantum circuit.
The ground state preparation is numerically analyzed on a small lattice with a variational quantum algorithm.
Our work shows that variational quantum algorithms provide a useful technique to be added in the growing toolbox for digital simulations of lattice gauge theories.
arXiv Detail & Related papers (2021-12-22T10:45:33Z) - Variational Adiabatic Gauge Transformation on real quantum hardware for
effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
We introduce the Variational Adiabatic Gauge Transformation (VAGT)
VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit.
The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
arXiv Detail & Related papers (2021-11-16T20:50:08Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
Random quantum circuits are commonly viewed as hard to simulate classically.
We show that approximate simulation of typical instances is almost as hard as exact simulation.
We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
arXiv Detail & Related papers (2019-12-31T19:00:00Z)
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.