Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups
We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.
quant-ph↗
arXiv subjects
Thomas Beth
Publications and source records attributed to Thomas Beth.
Fast Quantum Fourier Transforms for a Class of Non-abelian Groups
An algorithm is presented allowing the construction of fast Fourier transforms for any solvable group on a classical computer. The special structure of the recursion formula being the core of this algorithm makes it a good starting point to obtain systematically fast Fourier transforms for solvable groups on a quantum computer. The inherent structure of the Hilbert space imposed by the qubit architecture suggests to consider groups of order 2^n first (where n is the number of qubits). As an example, fast quantum Fourier transforms for all 4 classes of non-abelian 2-groups with cyclic normal subgroup of index 2 are explicitly constructed in terms of quantum circuits. The (quantum) complexity of the Fourier transform for these groups of size 2^n is O(n^2) in all cases.
quant-ph↗
Computing Local Invariants of Qubit Systems
We investigate means to describe the non-local properties of quantum systems and to test if two quantum systems are locally equivalent. For this we consider quantum systems that consist of several subsystems, especially multiple qubits. We compute invariant polynomials, i. e., polynomial functions of the entries of the density operator which are invariant under local unitary operations. As an example, we consider a system of two qubits. We compute the Molien series for the corresponding representation which gives information about the number of linearly independent invariants. Furthermore, we present a set of polynomials which generate all invariants (at least) up to degree 23. Finally, the use of invariants to check whether two density operators are locally equivalent is demonstrated.
quant-ph↗
On the Complexity of Quantum Searching Using Complex Queries
We discuss the quantum search algorithm using complex queries that has recently been published by Grover (quant-ph/9706005). We recall the algorithm adding some details showing which complex query has to be evaluated. Based on this version of the algorithm we discuss its complexity.
quant-ph↗
A Note on Non-Additive Quantum Codes
A method to combine two quantum error-correcting codes is presented. Even when starting with additive codes, the resulting code might be non-additive. Furthermore, the notion of the erasure space is introduced which gives a full characterisation of the erasure-correcting capabilities of the codes. For the special case that the two codes are unitary images of each other, the erasure space and the pure erasure space of the resulting code can be calculated.
quant-ph↗
Codes for the Quantum Erasure Channel
The quantum erasure channel (QEC) is considered. Codes for the QEC have to correct for erasures, i. e., arbitrary errors at known positions. We show that four qubits are necessary and sufficient to encode one qubit and correct one erasure, in contrast to five qubits for unknown positions. Moreover, a family of quantum codes for the QEC, the quantum BCH codes, that can be efficiently decoded is introduced.
quant-ph↗