Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:cond-mat/0505288 · Physical Review Letters

Exploiting Quantum Parallelism to Simulate Quantum Random Many-Body Systems

B. Paredes, Frank Verstraete, J. I. Cirac

Published Sep 29, 2005• 94 citations
arXivHTMLPDF

Abstract

We present an algorithm that exploits quantum parallelism to simulate randomness in a quantum system. In our scheme, all possible realizations of the random parameters are encoded quantum mechanically in a superposition state of an auxiliary system. We show how our algorithm allows for the efficient simulation of dynamics of quantum random spin chains with known numerical methods. We propose an experimental realization based on atoms in optical lattices in which disorder could be simulated in parallel and in a controlled way through the interaction with another atomic species.

DOI
10.1103/physrevlett.95.140501

Related papers

Randomness and structure in quantum many-body dynamics

Daniel K. Mark

We present several discoveries in quantum many-body dynamics and their applications. We discover types of universal randomness that emerge in many-body dynamics, now known as "deep thermalization" and "Hilbert space ergodicity." These discoveries have been enabled by recent advances in programmable quantum simulators, in particular their capability to perform measurements with unprecedented precision in both space and time. This universality allows for a number of practical applications adapted from the quantum information literature, including benchmarking, noise channel learning and state tomography. These applications rely on naturally-realized quantum dynamics and do not require fine-tuned controls. Hence, they are applicable to analog quantum simulators, and we realize several of these protocols in experiment. These results in emergent randomness are broadly applicable to generic many-body systems. We also discover new structures in specific systems realized in modern experimental platforms, namely in a lattice gauge theory realized in neutral atom arrays, and in optical lattice quantum gas microscopes. Finally, we identify a new type of structure present in the emergent randomness, governed by the presence of anti-unitary symmetries. Together, these results advance our understanding of quantum many-body dynamics and illustrate that much remains to be discovered in this active field of research.

•May 1, 2026•0 citations

Architectures for Quantum Simulation Showing a Quantum Speedup

Juan Bermejo-Vega, Dominik Hangleiter, Martin Schwarz +2 more

One of the main aims in the field of quantum simulation is to achieve a quantum speedup, often referred to as "quantum computational supremacy," referring to the experimental realization of a quantum device that computationally outperforms classical computers.In this work, we show that one can devise versatile and feasible schemes of two-dimensional, dynamical, quantum simulators showing such a quantum speedup, building on intermediate problems involving nonadaptive, measurement-based, quantum computation.In each of the schemes, an initial product state is prepared, potentially involving an element of randomness as in disordered models, followed by a short-time evolution under a basic translationally invariant Hamiltonian with simple nearest-neighbor interactions and a mere sampling measurement in a fixed basis.The correctness of the final-state preparation in each scheme is fully efficiently certifiable.We discuss experimental necessities and possible physical architectures, inspired by platforms of cold atoms in optical lattices and a number of others, as well as specific assumptions that enter the complexity-theoretic arguments.This work shows that benchmark settings exhibiting a quantum speedup may require little control, in contrast to universal quantum computing.Thus, our proposal puts a convincing experimental demonstration of a quantum speedup within reach in the near term.

arXiv:1703.00466•Physical Review X•Apr 9, 2018•122 citations

Simulating Complex Quantum Dynamics

Yaakov S. Weinstein, C. Stephen Hellberg

We demonstrate scalable quantum algorithms that realize pseudo-random operators that reproduce statistical properties of the three universal classes of random matrices: unitary, symmetric, and symplectic. These algorithms can be used to simulate and study characteristics of many complex quantum systems and processes which are well described by random matrices, such as the nuclear level spacings of large atoms and chaotic scattering. Modified versions of the algorithms are introduced for quantum cellular automata.

•Feb 20, 2004•0 citations

Quantum Glass of Interacting Bosons with Off-Diagonal Disorder

Anna M. Piekarska, T. K. Kopeć

We study disordered interacting bosons described by the Bose-Hubbard model with Gaussian-distributed random tunneling amplitudes. It is shown that the off-diagonal disorder induces a spin-glass-like ground state, characterized by randomly frozen quantum-mechanical U(1) phases of bosons. To access criticality, we employ the "n-replica trick," as in the spin-glass theory, and the Trotter-Suzuki method for decomposition of the statistical density operator, along with numerical calculations. The interplay between disorder, quantum, and thermal fluctuations leads to phase diagrams exhibiting a glassy state of bosons, which are studied as a function of model parameters. The considered system may be relevant for quantum simulators of optical-lattice bosons, where the randomness can be introduced in a controlled way. The latter is supported by a proposition of experimental realization of the system in question.

arXiv:1803.08156•Physical Review Letters•Apr 16, 2018•8 citations

Simulating quantum mechanics on a quantum computer

Bruce M. Boghosian, Washington Taylor

Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrödinger equation for interacting many-body systems are presented in some detail. These algorithms would make it possible to simulate nonrelativistic quantum systems on a quantum computer with an exponential speedup compared to simulations on classical computers. Issues involved in simulating relativistic systems of Dirac or gauge particles are discussed.

arXiv:quant-ph/9701019•Physica D Nonlinear Phenomena•Sep 1, 1998•171 citations

Digital lattice gauge theories

Erez Zohar, Alessandro Farace, Benni Reznik +1 more

We propose a general scheme for a digital construction of lattice gauge theories with dynamical fermions. In this method, the four-body interactions arising in models with $2+1$ dimensions and higher are obtained stroboscopically, through a sequence of two-body interactions with ancillary degrees of freedom. This yields stronger interactions than the ones obtained through perturbative methods, as typically done in previous proposals, and removes an important bottleneck in the road towards experimental realizations. The scheme applies to generic gauge theories with Lie or finite symmetry groups, both Abelian and non-Abelian. As a concrete example, we present the construction of a digital quantum simulator for a ${\mathbb{Z}}_{3}$ lattice gauge theory with dynamical fermionic matter in $2+1$ dimensions, using ultracold atoms in optical lattices, involving three atomic species, representing the matter, gauge, and auxiliary degrees of freedom, that are separated in three different layers. By moving the ancilla atoms with a proper sequence of steps, we show how we can obtain the desired evolution in a clean, controlled way.

arXiv:1607.08121•Physical Review A•Feb 6, 2017•152 citations
We present an algorithm that exploits quantum parallelism to simulate randomness in a quantum system. In our scheme, all possible realizations of the random parameters are encoded quantum mechanically in a superposition state of an auxiliary system. We show how our algorithm allows for the efficient simulation of dynamics of quantum random spin chains with known numerical methods. We propose an experimental realization based on atoms in optical lattices in which disorder could be simulated in parallel and in a controlled way through the interaction with another atomic species.
We present several discoveries in quantum many-body dynamics and their applications. We discover types of universal randomness that emerge in many-body dynamics, now known as "deep thermalization" and "Hilbert space ergodicity." These discoveries have been enabled by recent advances in programmable quantum simulators, in particular their capability to perform measurements with unprecedented precision in both space and time. This universality allows for a number of practical applications adapted from the quantum information literature, including benchmarking, noise channel learning and state tomography. These applications rely on naturally-realized quantum dynamics and do not require fine-tuned controls. Hence, they are applicable to analog quantum simulators, and we realize several of these protocols in experiment. These results in emergent randomness are broadly applicable to generic many-body systems. We also discover new structures in specific systems realized in modern experimental platforms, namely in a lattice gauge theory realized in neutral atom arrays, and in optical lattice quantum gas microscopes. Finally, we identify a new type of structure present in the emergent randomness, governed by the presence of anti-unitary symmetries. Together, these results advance our understanding of quantum many-body dynamics and illustrate that much remains to be discovered in this active field of research.
One of the main aims in the field of quantum simulation is to achieve a quantum speedup, often referred to as "quantum computational supremacy," referring to the experimental realization of a quantum device that computationally outperforms classical computers.In this work, we show that one can devise versatile and feasible schemes of two-dimensional, dynamical, quantum simulators showing such a quantum speedup, building on intermediate problems involving nonadaptive, measurement-based, quantum computation.In each of the schemes, an initial product state is prepared, potentially involving an element of randomness as in disordered models, followed by a short-time evolution under a basic translationally invariant Hamiltonian with simple nearest-neighbor interactions and a mere sampling measurement in a fixed basis.The correctness of the final-state preparation in each scheme is fully efficiently certifiable.We discuss experimental necessities and possible physical architectures, inspired by platforms of cold atoms in optical lattices and a number of others, as well as specific assumptions that enter the complexity-theoretic arguments.This work shows that benchmark settings exhibiting a quantum speedup may require little control, in contrast to universal quantum computing.Thus, our proposal puts a convincing experimental demonstration of a quantum speedup within reach in the near term.
We demonstrate scalable quantum algorithms that realize pseudo-random operators that reproduce statistical properties of the three universal classes of random matrices: unitary, symmetric, and symplectic. These algorithms can be used to simulate and study characteristics of many complex quantum systems and processes which are well described by random matrices, such as the nuclear level spacings of large atoms and chaotic scattering. Modified versions of the algorithms are introduced for quantum cellular automata.
We study disordered interacting bosons described by the Bose-Hubbard model with Gaussian-distributed random tunneling amplitudes. It is shown that the off-diagonal disorder induces a spin-glass-like ground state, characterized by randomly frozen quantum-mechanical U(1) phases of bosons. To access criticality, we employ the "n-replica trick," as in the spin-glass theory, and the Trotter-Suzuki method for decomposition of the statistical density operator, along with numerical calculations. The interplay between disorder, quantum, and thermal fluctuations leads to phase diagrams exhibiting a glassy state of bosons, which are studied as a function of model parameters. The considered system may be relevant for quantum simulators of optical-lattice bosons, where the randomness can be introduced in a controlled way. The latter is supported by a proposition of experimental realization of the system in question.
Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrödinger equation for interacting many-body systems are presented in some detail. These algorithms would make it possible to simulate nonrelativistic quantum systems on a quantum computer with an exponential speedup compared to simulations on classical computers. Issues involved in simulating relativistic systems of Dirac or gauge particles are discussed.
We propose a general scheme for a digital construction of lattice gauge theories with dynamical fermions. In this method, the four-body interactions arising in models with 2+12+12+1 dimensions and higher are obtained stroboscopically, through a sequence of two-body interactions with ancillary degrees of freedom. This yields stronger interactions than the ones obtained through perturbative methods, as typically done in previous proposals, and removes an important bottleneck in the road towards experimental realizations. The scheme applies to generic gauge theories with Lie or finite symmetry groups, both Abelian and non-Abelian. As a concrete example, we present the construction of a digital quantum simulator for a Z3{\mathbb{Z}}_{3}Z3​ lattice gauge theory with dynamical fermionic matter in 2+12+12+1 dimensions, using ultracold atoms in optical lattices, involving three atomic species, representing the matter, gauge, and auxiliary degrees of freedom, that are separated in three different layers. By moving the ancilla atoms with a proper sequence of steps, we show how we can obtain the desired evolution in a clean, controlled way.