Related papers: Quantum circuits with classically simulable operat…
We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation [Nature 618, 500 (2023)]. Our approach is based on the projected entangled pair operator (PEPO)…
Quantum Information scrambling (QI-scrambling) is a pivotal area of inquiry within the study of quantum many-body systems. This research derives mathematical upper and lower bounds for the scrambling rate by applying the Maligranda…
We address the problem of the construction of quantum walks on Cayley graphs. Our main motivation is the relationship between quantum algorithms and quantum walks. In particular, we discuss the choice of the dimension of the local Hilbert…
Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…
Quantum computing gives direct access to the study of real-time dynamics of quantum many-body systems. In principle, it is possible to directly calculate non-equal-time correlation functions, from which one can detect interesting phenomena,…
We introduce a distributed classical simulation algorithm for general quantum circuits, and present numerical results for calculating the output probabilities of universal random circuits. We find that we can simulate more qubits to greater…
Quantum circuits utilizing measurement to evolve a quantum wave function offer a new and rich playground to engineer unconventional entanglement dynamics. Here we introduce a hybrid, non-reciprocal setup featuring a quantum circuit, whose…
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…
An initial coherent state is propagated exactly by a kicked quantum Hamiltonian and its associated classical stroboscopic map. The classical trajectories within the initial state are regular for low kicking strengths, then bifurcate and…
Information in a chaotic quantum system will scramble across the system, preventing any local measurement from reconstructing it. The scrambling dynamics is key to understanding a wide range of quantum many-body systems. Here we use Holevo…
Hamiltonian simulation, i.e., simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful…
Efficiently simulating quantum circuits on classical computers is a fundamental challenge in quantum computing. This paper presents a novel theoretical approach that achieves substantial speedups over existing simulators for a wide class of…
Magic states are essential for universal quantum computation and are widely viewed as a key source of quantum advantage, yet in realistic devices they are inevitably noisy. In this work, we characterize how noise on injected magic resources…
Generic quantum-circuit simulation appears intractable for conventional computers and may be unnecessary because useful quantum circuits exhibit significant structure that can be exploited during simulation. For example, Gottesman and Knill…
Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…
We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modelled classically. This question is useful for providing upper bounds on fault tolerant thresholds, and for understanding…
We devise a classical algorithm which efficiently computes the quantum expectation values arising in a class of continuous variable quantum circuits wherein the final quantum observable | after the Heisenberg evolution associated with the…
Though Cliffords and matchgates are both examples of classically simulable circuits, they are considered simulable for different reasons. The celebrated Gottesman-Knill explains the simulability Cliffords, and the efficient simulability of…
The main objective of quantum simulation is an in-depth understanding of many-body physics. It is important for fundamental issues (quantum phase transitions, transport, . . . ) and for the development of innovative materials. Analytic…
We consider quantum trajectories of composite systems as generated by the stochastic unraveling of the respective Lindblad-master-equation. Their classical limit is taken to correspond to local jumps between orthogonal states. Based on…