scholarly journals Universal Quantum Computing and Three-Manifolds

2018 ◽  
Author(s):  
Michel Planat ◽  
Raymond Aschheim ◽  
Marcelo Amaral ◽  
Klee Irwin
Keyword(s):  
Quantum Computing ◽  
Bloch Sphere ◽  
Borromean Rings ◽  
Single Qubit ◽  
Whitehead Link ◽  
Trefoil Knot ◽  
Universal Quantum ◽  
Dehn Fillings ◽  
Knots And Links ◽  
Positive Operator Valued Measure

A single qubit may be represented on the Bloch sphere or similarly on the 3-sphere S3. Our goal is to dress this correspondence by converting the language of universal quantum computing (UQC) to that of 3-manifolds. A magic state and the Pauli group acting on it define a model of UQC as a positive operator-valued measure (POVM) that one recognizes to be a 3-manifold M3. More precisely, the d-dimensional POVMs defined from subgroups of finite index of the modular group PSL(2, Z) correspond to d-fold M3- coverings over the trefoil knot. In this paper, one also investigates quantum information on a few ‘universal’ knots and links such as the figure-of-eight knot, the Whitehead link and Borromean rings, making use of the catalog of platonic manifolds available on the software SnapPy. Further connections between POVMs based UQC and M3’s obtained from Dehn fillings are explored.

scholarly journals Universal Quantum Computing and Three-Manifolds

Symmetry ◽  
2018 ◽  
Vol 10 (12) ◽  
pp. 773 ◽  
Author(s):  
Michel Planat ◽  
Raymond Aschheim ◽  
Marcelo Amaral ◽  
Klee Irwin
Keyword(s):  
Quantum Computing ◽  
Bloch Sphere ◽  
Borromean Rings ◽  
Single Qubit ◽  
Whitehead Link ◽  
Trefoil Knot ◽  
Universal Quantum ◽  
Dehn Fillings ◽  
Knots And Links ◽  
Positive Operator Valued Measure

A single qubit may be represented on the Bloch sphere or similarly on the 3-sphere S 3 . Our goal is to dress this correspondence by converting the language of universal quantum computing (UQC) to that of 3-manifolds. A magic state and the Pauli group acting on it define a model of UQC as a positive operator-valued measure (POVM) that one recognizes to be a 3-manifold M 3 . More precisely, the d-dimensional POVMs defined from subgroups of finite index of the modular group P S L ( 2 , Z ) correspond to d-fold M 3 - coverings over the trefoil knot. In this paper, we also investigate quantum information on a few ‘universal’ knots and links such as the figure-of-eight knot, the Whitehead link and Borromean rings, making use of the catalog of platonic manifolds available on the software SnapPy. Further connections between POVMs based UQC and M 3 ’s obtained from Dehn fillings are explored.

scholarly journals Universal Quantum Computing and Three-Manifolds

2018 ◽  
Author(s):  
Michel Planat ◽  
Raymond Aschheim ◽  
Marcelo Amaral ◽  
Klee Irwin
Keyword(s):  
Quantum Computing ◽  
Modular Group ◽  
Bloch Sphere ◽  
Borromean Rings ◽  
Single Qubit ◽  
Whitehead Link ◽  
Trefoil Knot ◽  
Universal Quantum ◽  
Dehn Fillings ◽  
Knots And Links

A single qubit may be represented on the Bloch sphere or similarly on the $3$-sphere $S^3$. Our goal is to dress this correspondence by converting the language of universal quantum computing (uqc) to that of $3$-manifolds. A magic state and the Pauli group acting on it define a model of uqc as a POVM that one recognizes to be a $3$-manifold $M^3$. E. g., the $d$-dimensional POVMs defined from subgroups of finite index of the modular group $PSL(2,\mathbb{Z})$ correspond to $d$-fold $M^3$- coverings over the trefoil knot. In this paper, one also investigates quantum information on a few \lq universal' knots and links such as the figure-of-eight knot, the Whitehead link and Borromean rings, making use of the catalog of platonic manifolds available on SnapPy. Further connections between POVMs based uqc and $M^3$'s obtained from Dehn fillings are explored.

scholarly journals Quantum computing thanks to Bianchi groups

2019 ◽  
Vol 198 ◽  
pp. 00012 ◽  
Author(s):  
Michel Planat
Keyword(s):  
Quantum Computing ◽  
Trefoil Knot ◽  
Integer Ring ◽  
Universal Quantum ◽  
A Chain ◽  
Low Dimensional ◽  
Free Subgroups ◽  
Knots And Links ◽  
Good Agreement ◽  
Positive Operator Valued Measure

It has been shown that the concept of a magic state (in universal quantum computing: uqc) and that of a minimal informationally complete positive operator valued measure: MIC-POVMs (in quantum measurements) are in good agreement when such a magic state is selected in the set of non-stabilizer eigenstates of permutation gates with the Pauli group acting on it [1]. Further work observed that most found low-dimensional MICs may be built from subgroups of the modular group PS L(2, Z) [2] and that this can be understood from the picture of the trefoil knot and related 3-manifolds [3]. Here one concentrates on Bianchi groups PS L(2, O10) (with O10 the integer ring over the imaginary quadratic field) whose torsion-free subgroups define the appropriate knots and links leading to MICs and the related uqc. One finds a chain of Bianchi congruence n-cusped links playing a significant role [4].

scholarly journals Quantum Computing, Seifert Surfaces, and Singular Fibers

2019 ◽  
Vol 1 (1) ◽  
pp. 12-22 ◽  
Author(s):  
Michel Planat ◽  
Raymond Aschheim ◽  
Marcelo M. Amaral ◽  
Klee Irwin
Keyword(s):  
Quantum Computing ◽  
Quantum Computer ◽  
Complete Information ◽  
Singular Fiber ◽  
Dynkin Diagrams ◽  
Singular Fibers ◽  
Seifert Surfaces ◽  
Trefoil Knot ◽  
Universal Quantum

The fundamental group π 1 ( L ) of a knot or link L may be used to generate magic states appropriate for performing universal quantum computation and simultaneously for retrieving complete information about the processed quantum states. In this paper, one defines braids whose closure is the L of such a quantum computer model and computes their braid-induced Seifert surfaces and the corresponding Alexander polynomial. In particular, some d-fold coverings of the trefoil knot, with d = 3 , 4, 6, or 12, define appropriate links L, and the latter two cases connect to the Dynkin diagrams of E 6 and D 4 , respectively. In this new context, one finds that this correspondence continues with Kodaira’s classification of elliptic singular fibers. The Seifert fibered toroidal manifold Σ ′ , at the boundary of the singular fiber E 8 ˜ , allows possible models of quantum computing.

scholarly journals Benchmarking an 11-qubit quantum computer

2019 ◽  
Vol 10 (1) ◽  
Author(s):  
K. Wright ◽  
K. M. Beck ◽  
S. Debnath ◽  
J. M. Amini ◽  
Y. Nam ◽  
...  
Keyword(s):  
Quantum Computing ◽  
Quantum Physics ◽  
Quantum Computer ◽  
Success Rates ◽  
Single Qubit ◽  
The Past ◽  
Large Numbers ◽  
Universal Quantum ◽  
Qubit Gate ◽  
Fully Connected

AbstractThe field of quantum computing has grown from concept to demonstration devices over the past 20 years. Universal quantum computing offers efficiency in approaching problems of scientific and commercial interest, such as factoring large numbers, searching databases, simulating intractable models from quantum physics, and optimizing complex cost functions. Here, we present an 11-qubit fully-connected, programmable quantum computer in a trapped ion system composed of 13 171Yb+ ions. We demonstrate average single-qubit gate fidelities of 99.5$$\%$$%, average two-qubit-gate fidelities of 97.5$$\%$$%, and SPAM errors of 0.7$$\%$$%. To illustrate the capabilities of this universal platform and provide a basis for comparison with similarly-sized devices, we compile the Bernstein-Vazirani and Hidden Shift algorithms into our native gates and execute them on the hardware with average success rates of 78$$\%$$% and 35$$\%$$%, respectively. These algorithms serve as excellent benchmarks for any type of quantum hardware, and show that our system outperforms all other currently available hardware.

scholarly journals Data re-uploading for a universal quantum classifier

Quantum ◽  
2020 ◽  
Vol 4 ◽  
pp. 226 ◽  
Author(s):  
Adrián Pérez-Salinas ◽  
Alba Cervera-Lierta ◽  
Elies Gil-Fuster ◽  
José I. Latorre
Keyword(s):  
Quantum Circuit ◽  
Complex Data ◽  
Bloch Sphere ◽  
Single Qubit ◽  
Multiple Dimensions ◽  
Universal Quantum

A single qubit provides sufficient computational capabilities to construct a universal quantum classifier when assisted with a classical subroutine. This fact may be surprising since a single qubit only offers a simple superposition of two states and single-qubit gates only make a rotation in the Bloch sphere. The key ingredient to circumvent these limitations is to allow for multiple data re-uploading. A quantum circuit can then be organized as a series of data re-uploading and single-qubit processing units. Furthermore, both data re-uploading and measurements can accommodate multiple dimensions in the input and several categories in the output, to conform to a universal quantum classifier. The extension of this idea to several qubits enhances the efficiency of the strategy as entanglement expands the superpositions carried along with the classification. Extensive benchmarking on different examples of the single- and multi-qubit quantum classifier validates its ability to describe and classify complex data.

scholarly journals Group Geometrical Axioms for Magic States of Quantum Computing

Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 948 ◽  
Author(s):  
Michel Planat ◽  
Raymond Aschheim ◽  
Marcelo M. Amaral ◽  
Klee Irwin
Keyword(s):  
Quantum Computing ◽  
Fundamental Group ◽  
Free Group ◽  
Normal Closure ◽  
Trefoil Knot ◽  
Universal Quantum ◽  
Nontrivial Subgroup ◽  
Low Dimensional ◽  
Figure Eight Knot ◽  
Stabilizer States

Let H be a nontrivial subgroup of index d of a free group G and N be the normal closure of H in G. The coset organization in a subgroup H of G provides a group P of permutation gates whose common eigenstates are either stabilizer states of the Pauli group or magic states for universal quantum computing. A subset of magic states consists of states associated to minimal informationally complete measurements, called MIC states. It is shown that, in most cases, the existence of a MIC state entails the two conditions (i) N = G and (ii) no geometry (a triple of cosets cannot produce equal pairwise stabilizer subgroups) or that these conditions are both not satisfied. Our claim is verified by defining the low dimensional MIC states from subgroups of the fundamental group G = π 1 ( M ) of some manifolds encountered in our recent papers, e.g., the 3-manifolds attached to the trefoil knot and the figure-eight knot, and the 4-manifolds defined by 0-surgery of them. Exceptions to the aforementioned rule are classified in terms of geometric contextuality (which occurs when cosets on a line of the geometry do not all mutually commute).

scholarly journals QUANTUM CIRCUITS FOR SINGLE-QUBIT MEASUREMENTS CORRESPONDING TO PLATONIC SOLIDS

2004 ◽  
Vol 02 (03) ◽  
pp. 353-377 ◽  
Author(s):  
THOMAS DECKER ◽  
DOMINIK JANZING ◽  
THOMAS BETH
Keyword(s):  
Fourier Transform ◽  
Quantum Circuits ◽  
Platonic Solid ◽  
Bloch Sphere ◽  
Platonic Solids ◽  
Quantum Operations ◽  
Single Qubit ◽  
Orthogonal Measurement ◽  
Computational Basis ◽  
Positive Operator Valued Measure

Each platonic solid defines a single-qubit positive operator-valued measure (POVM) by interpreting its vertices as points on the Bloch sphere. We construct simple circuits for implementing these kinds of measurements and other simple types of symmetric POVMs on one qubit. Each implementation consists of a discrete Fourier transform and some elementary quantum operations followed by an orthogonal measurement in the computational basis.

Both Toffoli and Controlled-NOT need little help to universal quantum computing

2003 ◽  
Vol 3 (1) ◽  
pp. 84-92
Author(s):  
Y-Y Shi
Keyword(s):  
Quantum Computing ◽  
Quantum Computation ◽  
Quantum Circuit ◽  
Single Qubit ◽  
Universal Quantum ◽  
Qubit Gate ◽  
Computational Basis ◽  
Universal Gates

What additional gates are needed for a set of classical universal gates to do universal quantum computation? We prove that any single-qubit real gate suffices, except those that preserve the computational basis. The Gottesman-Knill Theorem implies that any quantum circuit involving only the Controlled-NOT and Hadamard gates can be efficiently simulated by a classical circuit. In contrast, we prove that Controlled-NOT plus any single-qubit real gate that does not preserve the computational basis and is not Hadamard (or its like) are universal for quantum computing. Previously only a generic gate, namely a rotation by an angle incommensurate with \pi, is known to be sufficient in both problems, if only one single-qubit gate is added.

Universal quantum computing in linear nearest neighbor architectures

2011 ◽  
Vol 11 (3&4) ◽  
pp. 300-312
Author(s):  
Preethika Kumar ◽  
Steven R. Skinner
Keyword(s):  
Quantum Computing ◽  
Solid State ◽  
Control Parameter ◽  
Nearest Neighbor ◽  
Quantum Computer ◽  
Gate Operation ◽  
One Dimensional ◽  
Single Qubit ◽  
Universal Quantum ◽  
Target Qubit

We introduce a scheme for realizing universal quantum computing in a linear nearest neighbor architecture with fixed couplings. We first show how to realize a controlled-NOT gate operation between two adjacent qubits without having to isolate the two qubits from qubits adjacent to them. The gate operation is implemented by applying two consecutive pulses of equal duration, but varying amplitudes, on the target qubit. Since only a single control parameter is required in implementing our scheme, it is very efficient. We next show how our scheme can be used to realize single qubit rotations and two-qubit controlled-unitary operations. As most proposals for solid state implementations of a quantum computer use a one-dimensional line of qubits, the schemes presented here will be extremely useful.

Sign in / Sign up

Export Citation Format

Share Document