Related papers: Noisy Stabilizer Formalism
We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a…
Stabilizer states form an important class of states in quantum information, and are of central importance in quantum error correction. Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from…
The present work analyzes state-stabilization techniques for decoupling a subsystem from environmental interactions. The proposed framework uses analytical and numerical tools to find an approximate decoherence-free subspace (DFS) with…
The quantum stabilizer formalism became foundational for understanding error correction soon after the realization of the first useful quantum error correction codes. Stabilizers provide a way to describe sets of quantum states which are…
Quantum magic, quantified by nonstabilizerness, measures departures from stabilizer structure and underlies potential quantum speedups. We introduce an efficient classical framework for computing stabilizer R\'enyi entropies and stabilizer…
Since Shor's discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features of quantum computers - the difficulty of…
Sensitivity to noise makes most of the current quantum computing schemes prone to error and nonscalable, allowing only for small proof-of-principle devices. Topologically-protected quantum computing aims at solving this problem by encoding…
In quantum information transformation and quantum computation, the most critical issues are security and accuracy. These features, therefore, stimulate research on quantum state characterization. A characterization tool, Quantum state…
We propose a heuristic method to obtain the approximate groundstate for a Hamiltonian in the qubit form, based on the stabilizer formalism. These states may serve as proper initial states for further refined computation. It would be…
Active stabilisation of a quantum system is the active suppression of noise (such as decoherence) in the system, without disrupting its unitary evolution. Quantum error correction suggests the possibility of achieving this, but only if the…
The most well-known tool for studying contextuality in quantum computation is the n-qubit stabilizer state tableau representation. We provide an extension that describes not only the quantum state, but is also outcome deterministic. The…
The classical simulation of quantum dynamics plays an important role in our understanding of quantum complexity, and in the development of quantum technologies. Efficient techniques such as those based on the Gottesman-Knill theorem for…
Quantum computers have enabled solving problems beyond the current computers' capabilities. However, this requires handling noise arising from unwanted interactions in these systems. Several protocols have been proposed to address efficient…
We present a breeding protocol that distills pure copies of any stabilizer state from noisy copies and a pool of predistilled pure copies of the same state, by means of local Clifford operations, Pauli measurements and classical…
The stabiliser fragment of quantum theory is a foundational building block for quantum error correction and the fault-tolerant compilation of quantum programs. In this article, we develop a sound, universal and complete denotational…
Keller and Kindler recently established a quantitative version of the famous Benjamini~--Kalai--Schramm Theorem on noise sensitivity of Boolean functions. The result was extended to the continuous Gaussian setting by Keller, Mossel and Sen…
State preparation that initializes quantum systems in a fiducial state and measurements to read outcomes after the evolution of quantum states, both essential elements in quantum information processing in general, may contain noise from…
The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates,…
Bell's Theorem started with two qubits, spins $1/2$. It is a no-go statement on classical (local causal) models of quantum correlations. Only after 25 years, it turned out that for three qubits the situation is even more mind boggling.…
The quantum measurement process by a single-electron transistor or a quantum point contact coupled to a quantum bit is studied. We find a unified description of the statistics of the monitored quantity, the current, in the regime of strong…