Related papers: Stabilizer Tensor Networks: universal quantum simu…

Quantum computer simulators are an indispensable tool for prototyping quantum algorithms and verifying the functioning of existing quantum computer hardware. The current largest quantum computers feature more than one thousand qubits,…

Modern day quantum simulators can prepare a wide variety of quantum states but the accurate estimation of observables from tomographic measurement data often poses a challenge. We tackle this problem by developing a quantum state tomography…

Quantum computers promise to revolutionise electronic simulations by overcoming the exponential scaling of many-electron problems. While electronic wave functions can be represented using a product of fermionic unitary operators, shallow…

We introduce a flexible and graphically intuitive framework that constructs complex quantum error correction codes from simple codes or states, generalizing code concatenation. More specifically, we represent the complex code constructions…

Stabilizer states constitute a set of pure states which plays a dominant role in quantum error correction, measurement--based quantum computation, and quantum communication. Central in these applications are the local symmetries of these…

The future development of quantum technologies relies on creating and manipulating quantum systems of increasing complexity, with key applications in computation, simulation and sensing. This poses severe challenges in the efficient…

Stabilizer states admit compact classical descriptions, but many downstream tasks still require their full amplitude vectors. Since the output itself has size $2^n$, the main algorithmic question is whether one can materialize an $n$-qubit…

We investigate for which resource states an efficient classical simulation of measurement based quantum computation is possible. We show that the Schmidt--rank width, a measure recently introduced to assess universality of resource states,…

Understanding dissipation in 2D quantum many-body systems is a remarkably difficult open challenge. Here we show how numerical simulations for this problem are possible by means of a tensor network algorithm that approximates steady-states…

Circuit simulation tools are critical for developing and assessing quantum-error-correcting and fault-tolerant strategies. In this work, we present SOFT, a high-performance SimulatOr for universal Fault-Tolerant quantum circuits.…

A universal quantum simulator would enable efficient simulation of quantum dynamics by implementing quantum-simulation algorithms on a quantum computer. Specifically the quantum simulator would efficiently generate qubit-string states that…

The ability to selectively measure, initialize, and reuse qubits during a quantum circuit enables a mapping of the spatial structure of certain tensor-network states onto the dynamics of quantum circuits, thereby achieving dramatic resource…

The stabilizer ground state is defined is the lowest energy stabilizer state with respect to a given Hamiltonian. In many cases it is highly degenerate and does not give a unique stabilizer state. We define the optimal stabilizer ground…

The rise of programmable quantum devices has motivated the exploration of circuit models which could realize novel physics. A promising candidate is a class of hybrid circuits, where entangling unitary dynamics compete with disentangling…

Tensor network methods are taking a central role in modern quantum physics and beyond. They can provide an efficient approximation to certain classes of quantum states, and the associated graphical language makes it easy to describe and…

Diagrammatic representation and manipulation of tensor networks has proven to be a useful tool in mathematics, physics, and computer science. Here we present several important and mostly well-known theorems regarding the dualities between…

The Gottesman-Knill theorem asserts that quantum circuits composed solely of Clifford gates can be efficiently simulated classically. This theorem hinges on the fact that Clifford gates map Pauli strings to other Pauli strings, thereby…

We extend the recently introduced notion of tensor enumerator to the circuit enumerator. We provide a mathematical framework that offers a novel method for analyzing circuits and error models without resorting to Monte Carlo techniques. We…

The study of the boundary between classically simulable and computationally complex quantum dynamics is fundamental to understanding which physical resources may enable enhanced information-processing capabilities. We investigate this…

We study operator scrambling in quantum circuits built from `super-Clifford' gates. For such circuits it was established in arXiv:2002.12824 that the time evolution of operator entanglement for a large class of many-body operators can be…