Quantum Many-Body Scars in Dual-Unitary Circuits
- URL: http://arxiv.org/abs/2307.06755v2
- Date: Wed, 17 Jan 2024 11:44:14 GMT
- Title: Quantum Many-Body Scars in Dual-Unitary Circuits
- Authors: Leonard Logari\'c, Shane Dooley, Silvia Pappalardi, John Goold
- Abstract summary: We present a method to construct dual-unitary circuits for which some simple initial states fail to thermalize.
This is achieved by embedding quantum many-body scars in a circuit of arbitrary size and local Hilbert space dimension.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Dual-unitary circuits are a class of quantum systems for which exact
calculations of various quantities are possible, even for circuits that are
nonintegrable. The array of known exact results paints a compelling picture of
dual-unitary circuits as rapidly thermalizing systems. However, in this Letter,
we present a method to construct dual-unitary circuits for which some simple
initial states fail to thermalize, despite the circuits being "maximally
chaotic," ergodic and mixing. This is achieved by embedding quantum many-body
scars in a circuit of arbitrary size and local Hilbert space dimension. We
support our analytic results with numerical simulations showing the stark
contrast in the rate of entanglement growth from an initial scar state compared
to nonscar initial states. Our results are well suited to an experimental test,
due to the compatibility of the circuit layout with the native structure of
current digital quantum simulators.
Related papers
- Dynamical simulations of many-body quantum chaos on a quantum computer [3.731709137507907]
We study a class of maximally chaotic circuits known as dual unitary circuits.
We show that a superconducting quantum processor with 91 qubits is able to accurately simulate these correlators.
We then probe dynamics beyond exact verification, by perturbing the circuits away from the dual unitary point.
arXiv Detail & Related papers (2024-11-01T17:57:13Z) - Simulating Quantum Circuits by Model Counting [0.0]
We show for the first time that a strong simulation of universal quantum circuits can be efficiently tackled through weighted model counting.
Our work paves the way to apply the existing array of powerful classical reasoning tools to realize efficient quantum circuit compilation.
arXiv Detail & Related papers (2024-03-11T22:40:15Z) - Circuit Cutting with Non-Maximally Entangled States [59.11160990637615]
Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices.
circuit cutting techniques enable the distribution of quantum computations through classical communication.
Quantum teleportation allows the distribution of quantum computations without an exponential increase in shots.
We propose a novel circuit cutting technique that leverages non-maximally entangled qubit pairs.
arXiv Detail & Related papers (2023-06-21T08:03:34Z) - Classical simulators as quantum error mitigators via circuit cutting [15.335377418439064]
We introduce an error mitigation framework that mitigates errors in a quantum circuit using circuit cutting.
Our technique involves cutting the circuit in such a way that we run the circuit that needs to be executed on the quantum hardware.
We perform error mitigation qubit by qubit and then provide a way to combine the different probabilities from each of the individual qubit error mitigation runs.
arXiv Detail & Related papers (2022-12-14T16:54:35Z) - Gaussian initializations help deep variational quantum circuits escape
from the barren plateau [87.04438831673063]
Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years.
However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number.
This result leads to a general belief that deep quantum circuits will not be feasible for practical tasks.
arXiv Detail & Related papers (2022-03-17T15:06:40Z) - Free Mode Removal and Mode Decoupling for Simulating General
Superconducting Quantum Circuits [4.568911586155097]
We consider and solve two issues involved in simulating general superconducting circuits.
One is the handling of free modes in the circuit, that is, circuit modes with no potential term in the Hamiltonian.
The other is the challenge of simulating strongly coupled multimode circuits.
arXiv Detail & Related papers (2020-11-20T18:59:29Z) - Efficient simulatability of continuous-variable circuits with large
Wigner negativity [62.997667081978825]
Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures.
We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable.
We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
arXiv Detail & Related papers (2020-05-25T11:03:42Z) - Hardware-Encoding Grid States in a Non-Reciprocal Superconducting
Circuit [62.997667081978825]
We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code.
We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
arXiv Detail & Related papers (2020-02-18T16:45:09Z) - Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum
Computer Using Inherent Qubit Decoherence [53.20999552522241]
We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems.
We present three methods for implementing the thermal relaxation.
We find excellent agreement between our results, experimental data, and the theoretical prediction.
arXiv Detail & Related papers (2020-01-03T11:48:11Z) - 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.