Related papers: Quantum State Designs via Magic Teleportation
In most stabilizer-based quantum computing schemes, so-called magic states are a necessary resource for implementing non-transversal quantum gates. With the resource theory of magic, it is possible to analyze and quantify the generation of…
Numerical simulation of individual open quantum systems has proven advantages over density operator computations. Quantum state diffusion with a moving basis (MQSD) provides a practical numerical simulation method which takes full advantage…
We investigate the statistical properties of orthogonal, or real, Clifford circuits doped with magic and imaginary resources. By developing the Weingarten calculus for the real Clifford group, we derive the exact overlap distribution of…
We find a scaling reduction in the stabilizer rank of the twelve-qubit tensored $T$ gate magic state. This lowers its asymptotic bound to $2^{\sim 0.463 t}$ for multi-Pauli measurements on $t$ magic states, improving over the best…
A set of stabilizer operations augmented by some special initial states known as 'magic states', gives the possibility of universal fault-tolerant quantum computation. However, magic state preparation inevitably involves nonideal operations…
Measurement based (MB) quantum computation allows for universal quantum computing by measuring individual qubits prepared in entangled multipartite states, known as graph states. Unless corrected for, the randomness of the measurements…
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…
Quantum measurement is universal for quantum computation. The model of quantum computation introduced by Nielsen and further developed by Leung relies on a generalized form of teleportation. In order to simulate any n-qubit unitary…
We propose a general scheme for dissipatively preparing arbitrary pure quantum states on a multipartite qubit register in a finite number of basic control blocks. Our "splitting-subspace" approach relies on control resources that are…
One of the primary objectives in the field of quantum state learning is to develop algorithms that are time-efficient for learning states generated from quantum circuits. Earlier investigations have demonstrated time-efficient algorithms…
Entangled multipartite states are resources for universal quantum computation, but they can also give rise to ensembles of unitary transformations, a topic usually studied in the context of random quantum circuits. Using several graph state…
The leading approach to fault tolerant quantum computing requires a continual supply of magic states. When a new magic state is first encoded, its initial fidelity will be too poor for use in the computation. This necessitates a…
This thesis discusses the young fields of quantum pseudo-randomness and quantum learning algorithms. We present techniques for derandomising algorithms to decrease randomness resource requirements and improve efficiency. One key object in…
We introduce the Clifford entropy, a measure of how close an arbitrary unitary is to a Clifford unitary, which generalizes the stabilizer entropy for states. We show that this quantity vanishes if and only if a unitary is Clifford, is…
We introduce a model of non-unitary quantum dynamics that exhibits infinitely long-lived discrete spatiotemporal order robust against any unitary or dissipative perturbation. Ergodicity is evaded by combining a sequence of projective…
Transferring the state of an information carrier from a sender to a receiver is an essential primitive in both classical and quantum communication and information processing. In a quantum process known as teleportation the unknown state of…
We present novel algorithms to estimate outcomes for qubit quantum circuits. Notably, these methods can simulate a Clifford circuit in linear time without ever writing down stabilizer states explicitly. These algorithms outperform previous…
Magic, a key quantum resource beyond entanglement, remains poorly understood in terms of its structure and classification. In this paper, we demonstrate a striking connection between high-dimensional symmetric lattices and quantum magic…
This work augments the recently introduced Stabilizer Tensor Network (STN) protocol with magic state injection, reporting a new framework with significantly enhanced ability to simulate circuits with an extensive number of non-Clifford…
Transversal gates on quantum error correction codes have been a promising approach for fault-tolerant quantum computing, but are limited by the Eastin-Knill no-go theorem. Existing solutions like gate teleportation and magic state…