Efficient tensor network simulation of ibm's eagle kicked ising experiment
We report an accurate and efficient classical simulation of a kicked Ising quantum system on
the heavy hexagon lattice. A simulation of this system was recently performed on a 127-qubit …
the heavy hexagon lattice. A simulation of this system was recently performed on a 127-qubit …
Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
A recent quantum simulation of observables of the kicked Ising model on 127 qubits
implemented circuits that exceed the capabilities of exact classical simulation. We show that …
implemented circuits that exceed the capabilities of exact classical simulation. We show that …
Tensor-network decoding beyond 2d
Decoding algorithms based on approximate tensor-network (TN) contraction have proven
tremendously successful in decoding two-dimensional (2D) local quantum codes such as …
tremendously successful in decoding two-dimensional (2D) local quantum codes such as …
State-dependent mobility edge in kinetically constrained models
In this work, we show that the kinetically constrained quantum East model lies between a
quantum scarred and a many-body localized system featuring an unconventional type of …
quantum scarred and a many-body localized system featuring an unconventional type of …
Confinement in the transverse field ising model on the heavy hex lattice
Inspired by a recent quantum computing experiment [Y. Kim et al., Nature (London), 618,
500–5 (2023) NATUAS 0028-0836 10.1038/s41586-023-06096-3], we study the emergence …
500–5 (2023) NATUAS 0028-0836 10.1038/s41586-023-06096-3], we study the emergence …
A brief history of quantum vs classical computational advantage
R LaRose - arxiv preprint arxiv:2412.14703, 2024 - arxiv.org
In this review article we summarize all experiments claiming quantum computational
advantage to date. Our review highlights challenges, loopholes, and refutations appearing …
advantage to date. Our review highlights challenges, loopholes, and refutations appearing …
Nonequilibrium steady-state dynamics of Markov processes on graphs
We propose an analytic approach for the steady-state dynamics of Markov processes on
locally tree-like graphs. It is based on the definition of a probability distribution for infinite …
locally tree-like graphs. It is based on the definition of a probability distribution for infinite …
Improved real-space parallelizable matrix-product state compression and its application to unitary quantum dynamics simulation
Towards the efficient simulation of near-term quantum devices using tensor network states,
we introduce an improved real-space parallelizable matrix-product state (MPS) compression …
we introduce an improved real-space parallelizable matrix-product state (MPS) compression …
Large-scale quantum annealing simulation with tensor networks and belief propagation
Quantum annealing and quantum approximate optimization algorithms hold a great
potential to speed-up optimization problems. This could be game-changing for a plethora of …
potential to speed-up optimization problems. This could be game-changing for a plethora of …
Spectral Gaps of 2D and 3D Many-body Quantum Systems in the Thermodynamic Limit
We present an expression for the spectral gap, opening up new possibilities for performing
and accelerating spectral calculations of quantum many-body systems. We develop and …
and accelerating spectral calculations of quantum many-body systems. We develop and …