Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantum gates and quantum algorithms with Clifford algebra technique
128
0
0.0
(
0
)
Added by
Norma Mankoc Borstnik
Publication date
2008
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We use our Clifford algebra technique, that is nilpotents and projectors which are binomials of the Clifford algebra objects $gamma^a$ with the property ${gamma^a,gamma^b}_+ = 2 eta^{ab}$, for representing quantum gates and quantum algorithms needed in quantum computers in an elegant way. We identify $n$-qubits with spinor representations of the group SO(1,3) for a system of $n$ spinors. Representations are expressed in terms of products of projectors and nilpotents. An algorithm for extracting a particular information out of a general superposition of $2^n$ qubit states is presented. It reproduces for a particular choice of the initial state the Grovers algorithm.
rate research
Read More
Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a small-scale ion trap quantum information processor. We further adapt the method to state preparation and quantum algorithms with in-sequence measurements.
We introduce the method of using an annealing genetic algorithm to the numerically complex problem of looking for quantum logic gates which simultaneously have highest fidelity and highest success probability. We first use the linear optical quantum nonlinear sign (NS) gate as an example to illustrate the efficiency of this method. We show that by appropriately choosing the annealing parameters, we can reach the theoretical maximum success probability (1/4 for NS) for each attempt. We then examine the controlled-z (CZ) gate as the first new problem to be solved. We show results that agree with the highest known maximum success probability for a CZ gate (2/27) while maintaining a fidelity of 0.9997. Since the purpose of our algorithm is to optimize a unitary matrix for quantum transformations, it could easily be applied to other areas of interest such as quantum optics and quantum sensors.
In this paper, we study in the context of quantum vertex algebras a certain Clifford-like algebra introduced by Jing and Nie. We establish bases of PBW type and classify its $mathbb N$-graded irreducible modules by using a notion of Verma module. On the other hand, we introduce a new algebra, a twin of the original algebra. Using this new algebra we construct a quantum vertex algebra and we associate $mathbb N$-graded modules for Jing-Nies Clifford-like algebra with $phi$-coordinated modules for the quantum vertex algebra. We also show that the adjoint module for the quantum vertex algebra is irreducible.
Many quantum information protocols require the implementation of random unitaries. Because it takes exponential resources to produce Haar-random unitaries drawn from the full $n$-qubit group, one often resorts to $t$-designs. Unitary $t$-designs mimic the Haar-measure up to $t$-th moments. It is known that Clifford operations can implement at most $3$-designs. In this work, we quantify the non-Clifford resources required to break this barrier. We find that it suffices to inject $O(t^{4}log^{2}(t)log(1/varepsilon))$ many non-Clifford gates into a polynomial-depth random Clifford circuit to obtain an $varepsilon$-approximate $t$-design. Strikingly, the number of non-Clifford gates required is independent of the system size -- asymptotically, the density of non-Clifford gates is allowed to tend to zero. We also derive novel bounds on the convergence time of random Clifford circuits to the $t$-th moment of the uniform distribution on the Clifford group. Our proofs exploit a recently developed variant of Schur-Weyl duality for the Clifford group, as well as bounds on restricted spectral gaps of averaging operators.
Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical algorithms. Building on the quantum intuition of these results, we step back into the classical domain, and explore its usefulness in designing classical algorithms. We achieve an algorithm for solving the major linear-algebraic problems in time $O(n^{omega+ u})$ for any $ u>0$, where $omega$ is the optimal matrix-product constant. Thus our algorithm is optimal w.r.t. matrix multiplication, and comparable to the state-of-the-art algorithm for these problems due to Demmel et. al. Being derived from quantum intuition, our proposed algorithm is completely disjoint from all previous classical algorithms, and builds on a combination of low-discrepancy sequences and perturbation analysis. As such, we hope it motivates further exploration of quantum techniques in this respect, hopefully leading to improvements in our understanding of space complexity and numerical stability of these problems.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
