Related papers: Classical representation of local Clifford operato…
Accurately estimating observables on noisy quantum devices remains a central challenge for near-term quantum algorithms. While quantum error mitigation techniques can reduce noise-induced bias, they often rely on unverifiable assumptions…
The commutative depth model allows gates that commute with each other to be performed in parallel. We show how to compute Clifford operations in constant commutative depth more efficiently than was previously known. Bravyi, Maslov, and Nam…
We construct $\ell $-spin-flipping matrices from the coefficient matrices of pure states of $n$ qubits and show that the $\ell $-spin-flipping matrices are congruent and unitary congruent whenever two pure states of $n$ qubits are SLOCC and…
We derive necessary and sufficient conditions for the LU-equivalence of two general (pure or mixed) $n$-qubit states as well as we determine the local unitary operators connecting them. Almost all relevant information is contained in the…
The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation is exploited to analyze a particular class of quantum…
We study the entanglement structure of tripartite stabilizer states on $N$ qudits of dimension $D$, distributed across parties $A$, $B$, and $C$, under arbitrary local unitaries. Prior work by Bravyi et al. and Looi et al. showed that qubit…
Clifford theory relates the representation theory of finite groups to those of a fixed normal subgroup by means of induction and restriction, which is an adjoint pair of functors. We generalize this result to the situation of a…
We describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties, can be privately implemented against a quantum version of classical semi-honest adversaries that we call…
Simulating quantum many-body dynamics is important both for fundamental understanding of physics and practical applications for quantum information processing. Therefore, classical simulation methods have been developed so far.…
Recently, operator quantum error-correcting codes have been proposed to unify and generalize decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. This note introduces a natural construction of such codes in…
The transition from a classical to quantum theory is investigated within the context of orthogonal and symplectic Clifford algebras, first for particles, and then for fields. It is shown that the generators of Clifford algebras have the…
A classical result in differential geometry due to Lichnerowicz [8] is concerned with the decomposition of the square of Dirac operators defined by Clifford connections on a Clifford module ${\cal E}$\ over a Riemannian manifold $M$.…
For two symmetric quantum states one may be interested in maximizing the overlap under local operations applied to one of them. The question arises whether the maximal overlap can be obtained by applying the same local operation to each…
We present an algorithm that decomposes any $n$-qubit Clifford operator into a circuit consisting of three subcircuits containing only CNOT or CPHASE gates with layers of one-qubit gates before and after each of these subcircuits. As with…
Classifying locally equivalent graph states, and stabilizer states more broadly, is a significant problem in the theories of quantum information and multipartite entanglement. A special focus is given to those graph states for which…
I present a new approach for designing quantum error-correcting codes that guarantees a physically natural implementation of Clifford operations. Inspired by the scheme put forward by Gottesman, Kitaev, and Preskill for encoding a qubit in…
We consider four-dimensional qudits as qubit pairs and their qudit Pauli operators as qubit Clifford operators. This introduces a nesting, $C_1^2 \subset C_2^4 \subset C_3^2$, where $C_n^m$ is the $n$th level of the $m$-dimensional qudit…
We introduce Natural Qubit Algebra (NQA), a compact real operator calculus for qubit systems based on a $2\times2$ block alphabet $\{I,X,Z,W\}\subset\mathrm{Mat}(2,\mathbb{R})$ and tensor-word representations. The resulting multiplication…
We consider the problem of $\textit{subgroup testing}$ for a quantum circuit $C$: given access to $C$, determine whether it implements a unitary that is $a$-close or $b$-far from a subgroup $\mathcal{G}$ of the unitary group. It encompasses…
It is the prevailing belief that quantum error correcting techniques will be required to build a utility-scale quantum computer able to perform computations that are out of reach of classical computers. The QECCs that have been most…