相关论文: Group Representations, Error Bases and Quantum Cod…
A formulation for evaluating the performance of quantum error correcting codes for a general error model is presented. In this formulation, the correlation between errors is quantified by a Hamiltonian description of the noise process. We…
In this paper, the space complexity of nonuniform quantum computations is investigated. The model chosen for this are quantum branching programs, which provide a graphic description of sequential quantum algorithms. In the first part of the…
The effect of noise on a quantum system can be described by a set of operators obtained from the interaction Hamiltonian. Recently it has been shown that generalized quantum error correcting codes can be derived by studying the algebra of…
We introduce an intrinsic formulation of quantum error correction based on representation theory, in which error-protection structure is encoded directly in a unitary group representation, rather than being tied to a particular embedding…
Symmetry adapted bases in quantum chemistry and bases adapted to quantum information share a common characteristics: both of them are constructed from subspaces of the representation space of the group SO(3) or its double group (i.e.,…
We consider a twisted version of quantum groups corepresentations. This generalization amounts to include in the theory the case where quantum space coordinates and its endomorphism matrix entries belong to a non-commutative quadratic…
We define and show how to construct nonbinary quantum stabilizer codes. Our approach is based on nonbinary error bases. It generalizes the relationship between selforthogonal codes over $GF_{4}$ and binary quantum codes to one between…
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a…
A group theoretic framework is introduced that simplifies the description of known quantum error-correcting codes and greatly facilitates the construction of new examples. Codes are given which map 3 qubits to 8 qubits correcting 1 error, 4…
Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes exploit the noncommutative geometry of…
A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and `hidden' or `unknown' subgroups of Abelian groups. It is already known how to…
Certain quantum codes allow logic operations to be performed on the encoded data, such that a multitude of errors introduced by faulty gates can be corrected. An important class of such operations are {\em transversal}, acting bitwise…
Quantum Fourier transformation is important in many quantum algorithms. In this paper, we generalize quantum Fourier transformation over the Abelian group $\mathbb{Z}_N$ from two different points to get more efficient unitary…
A permutation-invariant code on m qubits is a subspace of the symmetric subspace of the m qubits. We derive permutation-invariant codes that can encode an increasing amount of quantum information while suppressing leading order spontaneous…
This work presents an optimization-based scalable quantum neural network framework for approximating $n$-qubit unitaries through generic parametric representation of unitaries, which are obtained as product of exponential of basis elements…
An overview of quantum computing and in particular the Hidden Subgroup Problem are presented from a mathematical viewpoint. Detailed proofs are supplied for many important results from the literature, and notation is unified, making it…
CSS codes are a subfamily of stabilizer codes especially appropriate for fault-tolerant quantum computations. A very simple method is proposed to encode a general qudit when a Calderbank-Shor-Steane quantum code, defined over a q-ary…
The existence is proved of a class of open quantum systems that admits a linear subspace ${\cal C}$ of the space of states such that the restriction of the dynamical semigroup to the states built over $\cal C$ is unitary. Such subspace…
Fault-tolerant quantum computation is a technique that is necessary to build a scalable quantum computer from noisy physical building blocks. Key for the implementation of fault-tolerant computations is the ability to perform a universal…
Motivated by the recent rapid development of complexity theory applied to quantum mechanical processes we present the complete derivation of Nielsen's complexity of unitaries belonging to the representations of oscillator group. Our…