scholarly journals Realization of a Universal Quantum Gate Set for Itinerant Microwave Photons

2022 ◽  
Vol 12 (1) ◽  
Author(s):  
Kevin Reuer ◽  
Jean-Claude Besse ◽  
Lucien Wernli ◽  
Paul Magnard ◽  
Philipp Kurpiers ◽  
...  
2016 ◽  
Vol 14 (05) ◽  
pp. 1650026
Author(s):  
Xiao-Ning Qi ◽  
Yong Zhang

Nitrogen-vacancy (NV) centers implanted beneath the diamond surface have been demonstrated to be effective in the processing of controlling and reading-out. In this paper, NV center entangled with the fluorine nuclei collective ensemble is simplified to Jaynes–Cummings (JC) model. Based on this system, we discussed the implementation of quantum state storage and single-qubit quantum gate.


2007 ◽  
Vol 05 (04) ◽  
pp. 469-507 ◽  
Author(s):  
YONG ZHANG ◽  
LOUIS H. KAUFFMAN ◽  
REINHARD F. WERNER

Permutation and its partial transpose play important roles in quantum information theory. The Werner state is recognized as a rational solution of the Yang–Baxter equation, and the isotropic state with an adjustable parameter is found to form a braid representation. The set of permutation's partial transposes is an algebra called the PPT algebra, which guides the construction of multipartite symmetric states. The virtual knot theory, having permutation as a virtual crossing, provides a topological language describing quantum computation as having permutation as a swap gate. In this paper, permutation's partial transpose is identified with an idempotent of the Temperley–Lieb algebra. The algebra generated by permutation and its partial transpose is found to be the Brauer algebra. The linear combinations of identity, permutation and its partial transpose can form various projectors describing tangles; braid representations; virtual braid representations underlying common solutions of the braid relation and Yang–Baxter equations; and virtual Temperley–Lieb algebra which is articulated from the graphical viewpoint. They lead to our drawing a picture called the ABPK diagram describing knot theory in terms of its corresponding algebra, braid group and polynomial invariant. The paper also identifies non-trivial unitary braid representations with universal quantum gates, derives a Hamiltonian to determine the evolution of a universal quantum gate, and further computes the Markov trace in terms of a universal quantum gate for a link invariant to detect linking numbers.


2008 ◽  
Vol 17 (7) ◽  
pp. 450-459 ◽  
Author(s):  
M.C. Baldiotti ◽  
D.M. Gitman

2009 ◽  
Vol 94 (6) ◽  
pp. 064103 ◽  
Author(s):  
Wenzhang Liu ◽  
Jingfu Zhang ◽  
Ye Cao ◽  
Wen Yi Huo ◽  
Liang Hao ◽  
...  

2018 ◽  
Vol 43 (23) ◽  
pp. 5765 ◽  
Author(s):  
Chui-Ping Yang ◽  
Zhen-Fei Zheng ◽  
Yu Zhang

Author(s):  
Olga Ivancova ◽  
Vladimir Korenkov ◽  
Olga Tyatyushkina ◽  
Sergey Ulyanov ◽  
Toshio Fukuda

Principles and methodologies of quantum algorithmic gates design for master course and PhD students in computer science, control engineering and intelligent robotics described. The possibilities of quantum algorithmic gates simulation on classical computers discussed. Applications of quantum gate of nanotechnology in intelligent quantum control introduced. Anew approach to a circuit implementation design of quantum algorithm gates for fast quantum massive parallel computing presented. The main attention focused on the development of design method of fast quantum algorithm operators as superposition, entanglement and interference, which are in general time-consuming operations due to the number of products that have performed. SW & HW support sophisticated smart toolkit of supercomputing accelerator of quantum algorithm simulation on small quantum programmable computer algorithm gate (that can program in SW to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates) described. As example, the method for performing Grover’s interference operator without product operations introduced. The background of developed information technology is the "Quantum / Soft Computing Optimizer" (QSCOptKBTM) SW based on soft and quantum computational intelligence toolkit.


2012 ◽  
Vol 85 (5) ◽  
Author(s):  
F. Ciccarello ◽  
D. E. Browne ◽  
L. C. Kwek ◽  
H. Schomerus ◽  
M. Zarcone ◽  
...  

2003 ◽  
Vol 77 (8) ◽  
pp. 789-796 ◽  
Author(s):  
F. Schmidt-Kaler ◽  
H. Häffner ◽  
S. Gulde ◽  
M. Riebe ◽  
G.P.T. Lancaster ◽  
...  

2007 ◽  
Vol 7 (3) ◽  
pp. 228-242
Author(s):  
P.B.M. Sousa ◽  
R.V. Ramos

Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the basic steps is to implement the quantum circuit able to realize a given unitary operation. This task has been solved using decomposition of unitary matrices in simpler ones till reach quantum circuits having only single-qubits and CNOTs gates. Usually the goal is to find the minimal quantum circuit able to solve a given problem. In this paper we go in a different direction. We propose a general quantum circuit able to implement any specific quantum circuit by just setting correctly the parameters. In other words, we propose a programmable quantum circuit. This opens the possibility to construct a real quantum computer where several different quantum operations can be realized in the same hardware. The configuration is proposed and its optical implementation is discussed.


Sign in / Sign up

Export Citation Format

Share Document