Related papers: Qubit stabilizer states are complex projective 3-d…
We present a method for implementing stabilizer-based codes with encoding schemes of the operator quantum error correction paradigm, e.g., the "standard" five-qubit and CSS codes, on solid-state qubits with Ising or XY-type interactions.…
In this work, we compute the number of $[[n,k]]_d$ stabilizer codes made up of $d$-dimensional qudits, for arbitrary positive integers $d$. In a seminal work by Gross (Ref. [23]) the number of $[[n,k]]_d$ stabilizer codes was computed for…
We develop a framework for the classification of invertible translation-invariant stabilizer codes modulo condensation and stabilization with simple codes. We introduce generalizations of the Pauli groups of local unitaries for quantum…
We propose a method for the tomographic reconstruction of qubit states for a general class of solid state systems in which the Hamiltonians are represented by spin operators, e.g., with Heisenberg-, $XXZ$-, or XY- type exchange…
We propose a method for the stabilisation of quantum computations (including quantum state storage). The method is based on the operation of projection into $\cal SYM$, the symmetric subspace of the full state space of $R$ redundant copies…
We present an approach to simulating quantum computation based on a classical model that directly imitates discrete quantum systems. Qubits are represented as harmonic functions in a 2D vector space. Multiplication of qubit representations…
We propose a systematic scheme for the construction of graphs associated with binary stabilizer codes. The scheme is characterized by three main steps: first, the stabilizer code is realized as a codeword-stabilized (CWS) quantum code;…
We classify, up to local unitary equivalence, the set of $n$-qubit states that is stabilized by the diagonal subgroup of the local unitary group. We exhibit a basis for this set, parameterized by diagrams of nonintersecting chords…
Stabilizer states, which are also known as the Clifford states, have been commonly utilized in quantum information, quantum error correction, and quantum circuit simulation due to their simple mathematical structure. In this work, we apply…
Well-controlled quantum devices with their increasing system size face a new roadblock hindering further development of quantum technologies: The effort of quantum tomography---the characterization of processes and states within a quantum…
The qutrit comes next in complexity after qubit as a resource for quantum information processing. The qubit density matrix can be easily visualized using Bloch sphere representation of its states. In contrast, this simplicity is in general…
Operator quantum error correction is a recently developed theory that provides a generalized framework for active error correction and passive error avoiding schemes. In this paper, we describe these codes in the stabilizer formalism of…
In a new branch of quantum computing, information is encoded into coherent states, the primary carriers of optical communication. To exploit it, quantum bits of these coherent states are needed, but it is notoriously hard to make…
If a measurement is made on one half of a bipartite system, then, conditioned on the outcome, the other half has a new reduced state. If these reduced states defy classical explanation -- that is, if shared randomness cannot produce these…
Quantum circuits for loading probability distributions into quantum states are essential subroutines in quantum algorithms used in physics, finance engineering, and machine learning. The ability to implement these with high accuracy in…
We study the task of agnostic tomography: given copies of an unknown $n$-qubit state $\rho$ which has fidelity $\tau$ with some state in a given class $C$, find a state which has fidelity $\ge \tau - \epsilon$ with $\rho$. We give a new…
Inspired by recent advances in the manipulation of superconducting circuits coupled to mechanical modes in the quantum regime, we propose a protocol for generating superpositions of orthogonally squeezed states in a quantum harmonic…
The quantum guesswork quantifies the minimum number of queries needed to guess the state of a quantum ensemble if one is allowed to query only one state at a time. Previous approaches to the computation of the guesswork were based on…
Quantum computers have the potential to solve important problems which are fundamentally intractable on a classical computer. The underlying physics of quantum computing platforms supports using multi-valued logic, which promises a boost in…
A formalism for the construction of some classes of Gazeau$-$Klauder squeezed states, corresponding to arbitrary solvable quantum systems with a known discrete spectrum, are introduced. As some physical applications, the proposed structure…