Relevant bibliographies by topics / Universal gate / Journal articles
To see the other types of publications on this topic, follow the link: Universal gate.

Journal articles on the topic 'Universal gate'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Universal gate.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Bu[zcirc]ek, V., M. Hillery, and F. Werner. "Universal-NOT gate." Journal of Modern Optics 47, no. 2-3 (February 2000): 211–32. http://dx.doi.org/10.1080/09500340008244037.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Buzek, V., M. Hillery, and F. Werner. "Universal-NOT gate." Journal of Modern Optics 47, no. 2-3 (February 15, 2000): 211–32. http://dx.doi.org/10.1080/095003400148150.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bandyopadhyay, S. "A nanospintronic universal quantum gate." Physica E: Low-dimensional Systems and Nanostructures 11, no. 2-3 (October 2001): 126–30. http://dx.doi.org/10.1016/s1386-9477(01)00188-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Siomau, M., and S. Fritzsche. "Universal quantum Controlled-NOT gate." European Physical Journal D 60, no. 2 (September 14, 2010): 417–21. http://dx.doi.org/10.1140/epjd/e2010-00226-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pampuch, C., A. Ney, and R. Koch. "A universal gate for magnetologic computers." Europhysics Letters (EPL) 66, no. 6 (June 2004): 895–901. http://dx.doi.org/10.1209/epl/i2003-10270-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sarkar, Angik, and T. K. Bhattacharyya. "Universal Toffoli gate in ballistic nanowires." Applied Physics Letters 90, no. 17 (April 23, 2007): 173101. http://dx.doi.org/10.1063/1.2731521.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Golić, J. Dj, and R. Menicocci. "Universal masking on logic gate level." Electronics Letters 40, no. 9 (2004): 526. http://dx.doi.org/10.1049/el:20040385.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Agarwal, H., S. Pramanik, and S. Bandyopadhyay. "Single spin universal Boolean logic gate." New Journal of Physics 10, no. 1 (January 23, 2008): 015001. http://dx.doi.org/10.1088/1367-2630/10/1/015001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Ran, and Frank Gaitan. "High-fidelity universal quantum gates." Quantum Information and Computation 10, no. 11&12 (November 2010): 936–46. http://dx.doi.org/10.26421/qic10.11-12-4.

Full text
Abstract:
Twisted rapid passage is a type of non-adiabatic rapid passage that generates controllable quantum interference effects that were first observed experimentally in $2003$. It is shown that twisted rapid passage sweeps can be used to implement a universal set of quantum gates $\calGU$ that operate with high-fidelity. The gate set $\calGU$ consists of the Hadamard and NOT gates, together with variants of the phase, $\pi /8$, and controlled-phase gates. For each gate $g$ in $\calGU$, sweep parameter values are provided which simulations indicate will produce a unitary operation that approximates $g$ with error probability$P_{e} < 10^{-4}$. Note that \textit{all\/} gates in $\calGU$ are implemented using a \textit{single family\/} of control-field, and the error probability for each gate falls below the rough-and-ready estimate for the accuracy threshold $P_{a}\sim 10^{-4}$.
APA, Harvard, Vancouver, ISO, and other styles
10

Sharma, Manoj, and Arti Noor. "Reconfigurable CPL Adiabatic Gated Logic RCPLAG based Universal NAND/NOR Gate." International Journal of Computer Applications 95, no. 26 (June 18, 2014): 27–32. http://dx.doi.org/10.5120/16961-7078.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

ZHANG, YONG, LOUIS H. KAUFFMAN, and MO-LIN GE. "UNIVERSAL QUANTUM GATE, YANG–BAXTERIZATION AND HAMILTONIAN." International Journal of Quantum Information 03, no. 04 (December 2005): 669–78. http://dx.doi.org/10.1142/s0219749905001547.

Full text
Abstract:
It is fundamental to view unitary braiding operators describing topological entanglements as universal quantum gates for quantum computation. This paper derives a unitary solution of the quantum Yang–Baxter equation via Yang–Baxterization and constructs the Hamiltonian responsible for the time-evolution of the unitary braiding operator.
APA, Harvard, Vancouver, ISO, and other styles
12

Bužek, V., M. Hillery, and R. F. Werner. "Optimal manipulations with qubits: Universal-NOT gate." Physical Review A 60, no. 4 (October 1, 1999): R2626—R2629. http://dx.doi.org/10.1103/physreva.60.r2626.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Lloyd, Seth. "Almost Any Quantum Logic Gate is Universal." Physical Review Letters 75, no. 2 (July 10, 1995): 346–49. http://dx.doi.org/10.1103/physrevlett.75.346.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Montaser, Rasha, Ahmed Younes, and Mahmoud Abdel-Aty. "New Design of Universal Reversible Gate Library." Quantum Matter 6, no. 1 (February 1, 2017): 89–96. http://dx.doi.org/10.1166/qm.2017.1403.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Lee, Jin-Seong, and Jun-Cheol Jeon. "Design of XOR Gate Based on QCA Universal Gate Using Rotated Cell ·." Asia-pacific Journal of Multimedia services convergent with Art, Humanities, and Sociology 7, no. 3 (March 31, 2017): 301–10. http://dx.doi.org/10.14257/ajmahs.2017.03.29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Sousa, P. B. M., and R. V. Ramos. "Universal quantum circuit for n-qubit quantum gate: a programmable quantum gate." Quantum Information and Computation 7, no. 3 (March 2007): 228–42. http://dx.doi.org/10.26421/qic7.3-4.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
17

Sias, C., F. Sciarrino, and F. De Martini. "Realization of the universal-NOT gate and of the universal quantum cloning." Fortschritte der Physik 51, no. 45 (May 7, 2003): 349–58. http://dx.doi.org/10.1002/prop.200310048.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

De Martini, F., V. Bužek, F. Sciarrino, and C. Sias. "Experimental realization of the quantum universal NOT gate." Nature 419, no. 6909 (October 2002): 815–18. http://dx.doi.org/10.1038/nature01093.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

TANAKA, YUJI, TSUBASA ICHIKAWA, MASAHITO TADA-UMEZAKI, YUKIHIRO OTA, and MIKIO NAKAHARA. "QUANTUM ORACLES IN TERMS OF UNIVERSAL GATE SET." International Journal of Quantum Information 09, no. 06 (September 2011): 1363–81. http://dx.doi.org/10.1142/s0219749911008106.

Full text
Abstract:
We present a systematic construction of quantum circuits implementing Grover's database search algorithm for arbitrary number of targets. We introduce a new operator which flips the sign of the targets and evaluate its circuit complexity. We find the condition under which the circuit complexity of the database search algorithm based on this operator is less than that of the conventional one.
APA, Harvard, Vancouver, ISO, and other styles
20

Sciarrino, F., C. Sias, M. Ricci, and F. De Martini. "Quantum cloning and universal NOT gate by teleportation." Physics Letters A 323, no. 1-2 (March 2004): 34–39. http://dx.doi.org/10.1016/j.physleta.2004.01.063.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Baldiotti, M. C., and D. M. Gitman. "Four-level systems and a universal quantum gate." Annalen der Physik 17, no. 7 (July 1, 2008): 450–59. http://dx.doi.org/10.1002/andp.200810303.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Sullivan, Dennis M., and D. S. Citrin. "Time-domain simulation of a universal quantum gate." Journal of Applied Physics 96, no. 3 (August 2004): 1540–46. http://dx.doi.org/10.1063/1.1766409.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Wang, Gangcheng, Kang Xue, Chunfang Sun, Chengcheng Zhou, Taotao Hu, and Qingyong Wang. "Temperley–Lieb algebra, Yang-Baxterization and universal gate." Quantum Information Processing 9, no. 6 (December 18, 2009): 699–710. http://dx.doi.org/10.1007/s11128-009-0159-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Gogoi, Nilima, and Partha Pratim Sahu. "All-Optical Surface Plasmonic Universal Logic Gate Devices." Plasmonics 11, no. 6 (April 25, 2016): 1537–42. http://dx.doi.org/10.1007/s11468-016-0207-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

KumarChandra, Saroj, and Prince Kumar Sahu. "Basic Logic Gate Realization using Quantum Dot Cellular Automata based Reversible Universal Gate." International Journal of Computer Applications 58, no. 18 (November 15, 2012): 17–21. http://dx.doi.org/10.5120/9382-3840.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

PARASHAR, PREETI. "ON THE NON-EXISTENCE OF A UNIVERSAL HADAMARD GATE." International Journal of Quantum Information 05, no. 06 (December 2007): 845–55. http://dx.doi.org/10.1142/s0219749907003304.

Full text
Abstract:
We establish the non-existence of a universal Hadamard gate for an arbitrary qubit, by considering two different principles; namely, no-superluminal signalling and non-increase of entanglement under LOCC. It is also shown that these principles are not violated if and only if the qubit states belong to the special ensemble obtained recently. We then extend the non-existence of the Hadamard operation to a multi-qubit system. In higher dimensions, the analog of the Hadamard gate is the quantum Fourier transform. We show that it is not possible to design this gate for an arbitrary qudit.
APA, Harvard, Vancouver, ISO, and other styles
27

Shi, Y.-Y. "Both Toffoli and Controlled-NOT need little help to universal quantum computing." Quantum Information and Computation 3, no. 1 (January 2003): 84–92. http://dx.doi.org/10.26421/qic3.1-7.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
28

Stephens, A. M., A. G. Fowler, and L. C. L. Hollenberg. "Universal fault tolerant quantum computation on bilinear nearest neighbor arrays." Quantum Information and Computation 8, no. 3&4 (March 2008): 330–44. http://dx.doi.org/10.26421/qic8.3-4-7.

Full text
Abstract:
Assuming an array that consists of two parallel lines of qubits and that permits only nearest neighbor interactions, we construct physical and logical circuitry to enable universal fault tolerant quantum computation under the $[[7,1,3]]$ quantum code. A rigorous lower bound to the fault tolerant threshold for this array is determined in a number of physical settings. Adversarial memory errors, two-qubit gate errors and readout errors are included in our analysis. In the setting where the physical memory failure rate is equal to one-tenth of the physical gate error rate, the physical readout error rate is equal to the physical gate error rate, and the duration of physical readout is ten times the duration of a physical gate, we obtain a lower bound to the asymptotic threshold of $1.96\times10^{-6}$.
APA, Harvard, Vancouver, ISO, and other styles
29

Yao, Maoqun, Kai Yang, Congyuan Xu, and Jizhong Shen. "Function Synthesis Algorithm of RTD-Based Universal Threshold Logic Gate." Journal of Applied Mathematics 2015 (2015): 1–7. http://dx.doi.org/10.1155/2015/827572.

Full text
Abstract:
The resonant tunneling device (RTD) has attracted much attention because of its unique negative differential resistance characteristic and its functional versatility and is more suitable for implementing the threshold logic gate. The universal logic gate has become an important unit circuit of digital circuit design because of its powerful logic function, while the threshold logic gate is a suitable unit to design the universal logic gate, but the function synthesis algorithm for then-variable logical function implemented by the RTD-based universal logic gate (UTLG) is relatively deficient. In this paper, three-variable threshold functions are divided into four categories; based on the Reed-Muller expansion, two categories of these are analyzed, and a new decomposition algorithm of the three-variable nonthreshold functions is proposed. The proposed algorithm is simple and the decomposition results can be obtained by looking up the decomposition table. Then, based on the Reed-Muller algebraic system, the arbitraryn-variable function can be decomposed into three-variable functions, and a function synthesis algorithm for then-variable logical function implemented by UTLG and XOR2 is proposed, which is a simple programmable implementation.
APA, Harvard, Vancouver, ISO, and other styles
30

Srivastav, Saurabh Kumar, Manas Ranjan Sahu, K. Watanabe, T. Taniguchi, Sumilan Banerjee, and Anindya Das. "Universal quantized thermal conductance in graphene." Science Advances 5, no. 7 (July 2019): eaaw5798. http://dx.doi.org/10.1126/sciadv.aaw5798.

Full text
Abstract:
The universal quantization of thermal conductance provides information on a state's topological order. Recent measurements revealed that the observed value of thermal conductance of the 52 state is inconsistent with either Pfaffian or anti-Pfaffian model, motivating several theoretical articles. Analysis has been made complicated by the presence of counter-propagating edge channels arising from edge reconstruction, an inevitable consequence of separating the dopant layer from the GaAs quantum well and the resulting soft confining potential. Here, we measured thermal conductance in graphene with atomically sharp confining potential by using sensitive noise thermometry on hexagonal boron-nitride encapsulated graphene devices, gated by either SiO2/Si or graphite back gate. We find the quantization of thermal conductance within 5% accuracy for ν = 1;43;2 and 6 plateaus, emphasizing the universality of flow of information. These graphene quantum Hall thermal transport measurements will allow new insight into exotic systems like even-denominator quantum Hall fractions in graphene.
APA, Harvard, Vancouver, ISO, and other styles
31

Ghosal, S., and D. Biswas. "Study and Defect Characterization of a Universal QCA Gate." International Journal of Computer Applications 74, no. 15 (July 26, 2013): 38–44. http://dx.doi.org/10.5120/12964-0229.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Safoev, N., and J. C. Jeon. "Reliable Design of Reversible Universal Gate Based on QCA." Advanced Science Letters 23, no. 10 (October 1, 2017): 9818–23. http://dx.doi.org/10.1166/asl.2017.9804.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

GEETHA PRIYA, M., and K. BASKARAN. "A new universal gate for low power SoC applications." Sadhana 38, no. 4 (August 2013): 645–51. http://dx.doi.org/10.1007/s12046-013-0168-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

D'Arrigo, A., G. Falci, and E. Paladino. "Dynamical decoupling of random telegraph noise in a two-qubit gate." International Journal of Quantum Information 12, no. 02 (March 2014): 1461008. http://dx.doi.org/10.1142/s0219749914610085.

Full text
Abstract:
Controlling the dynamics of entanglement and preventing its disappearance are central requisites for any implementation of quantum information processing. Solid state qubits are frequently affected by random telegraph noise due to bistable impurities of different nature coupled to the device. In this paper, we investigate the possibility to achieve an efficient universal two-qubit gate in the presence of random telegraph noise by periodic dynamical decoupling. We find an analytic form of the gate error as a function of the number of applied pulses valid when the gate time is much shorter then the telegraphic process correlation time. The analysis is further supplemented by exact numerical results demonstrating the feasibility of a highly-efficient universal two-qubit gate.
APA, Harvard, Vancouver, ISO, and other styles
35

Garcia-Escartin, J. C., and P. Chamorro-Posada. "Universal quantum computation with shutter logic." Quantum Information and Computation 6, no. 6 (September 2006): 495–515. http://dx.doi.org/10.26421/qic6.6-3.

Full text
Abstract:
We show that universal quantum logic can be achieved using only linear optics and a quantum shutter device. With these elements, we design a quantum memory for any number of qubits and a CNOT gate which are the basis of a universal quantum computer. An interaction-free model for a quantum shutter is given.
APA, Harvard, Vancouver, ISO, and other styles
36

Kumar, Preethika, and Steven R. Skinner. "Universal quantum computing in linear nearest neighbor architectures." Quantum Information and Computation 11, no. 3&4 (March 2011): 300–312. http://dx.doi.org/10.26421/qic11.3-4-8.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
37

Brennen, G. K., S. S. Bullock, and D. P. O'Leary. "Efficient circuits for exact-universal computation with qudits." Quantum Information and Computation 6, no. 4&5 (July 2006): 436–54. http://dx.doi.org/10.26421/qic6.4-5-9.

Full text
Abstract:
This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one two-qudit gate, $\CINC$, is exact-universal. A recent paper [S.Bullock, D.O'Leary, and G.K. Brennen, Phys. Rev. Lett. 94, 230502 (2005)] describes quantum circuits for qudits which require O(d^n) two-qudit gates for state synthesis and O(d^{2n}) two-qudit gates for unitary synthesis, matching the respective lower bound complexities. In this work, we present the state-synthesis circuit in much greater detail and prove that it is correct. Also, the (n-2)/(d-2) ancillas required in the original algorithm may be removed without changing the asymptotics. Further, we present a new algorithm for unitary synthesis, inspired by the QR matrix decomposition, which is also asymptotically optimal.
APA, Harvard, Vancouver, ISO, and other styles
38

Bora, N., P. P. Das, and R. Subadar. "An Analytical Universal Model for Symmetric Double Gate Junctionless Transistors." Journal of Nano- and Electronic Physics 8, no. 2 (2016): 02003–1. http://dx.doi.org/10.21272/jnep.8(2).02003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Peng, Changnan, Jiayu Li, Huimin Liao, Zhi Li, Chengwei Sun, Jianjun Chen, and Qihuang Gong. "Universal Linear-Optical Logic Gate with Maximal Intensity Contrast Ratios." ACS Photonics 5, no. 3 (January 15, 2018): 1137–43. http://dx.doi.org/10.1021/acsphotonics.7b01566.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Schmidt-Kaler, F., H. Häffner, S. Gulde, M. Riebe, G. P. T. Lancaster, T. Deuschle, C. Becher, et al. "How to realize a universal quantum gate with trapped ions." Applied Physics B 77, no. 8 (December 2003): 789–96. http://dx.doi.org/10.1007/s00340-003-1346-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Yang, Chui-Ping, Zhen-Fei Zheng, and Yu Zhang. "Universal quantum gate with hybrid qubits in circuit quantum electrodynamics." Optics Letters 43, no. 23 (November 21, 2018): 5765. http://dx.doi.org/10.1364/ol.43.005765.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Bandi, Sri Priya R., Clyde Washburn, P. R. Mukund, Jan Kolnik, Ken Paradis, Steve Howard, and Jeff Burleson. "Universal MOSFET gate impedance model for 200MHz–20GHz frequency range." Solid-State Electronics 50, no. 7-8 (July 2006): 1450–60. http://dx.doi.org/10.1016/j.sse.2006.06.020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Shifatul, Md, Md Abdullah-Al-Shafi, and Ali Newaz. "A New Approach of Presenting Universal Reversible Gate in Nanoscale." International Journal of Computer Applications 134, no. 7 (January 15, 2016): 1–4. http://dx.doi.org/10.5120/ijca2016907711.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Chappanda, K. N., S. Ilyas, S. N. R. Kazmi, J. Holguin-Lerma, N. M. Batra, P. M. F. J. Costa, and M. I. Younis. "A single nano cantilever as a reprogrammable universal logic gate." Journal of Micromechanics and Microengineering 27, no. 4 (February 24, 2017): 045007. http://dx.doi.org/10.1088/1361-6439/aa5dfa.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Hsieh, M., J. Kempe, S. Myrgren, and K. B. Whaley. "An Explicit Universal Gate-Set for Exchange-Only Quantum Computation." Quantum Information Processing 2, no. 4 (August 2003): 289–307. http://dx.doi.org/10.1023/b:qinp.0000020084.53422.8e.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Osman, Mohamed, Ahmed Younes, Galal Ismail, and Roushdy Farouk. "An Improved Design of n-Bit Universal Reversible Gate Library." International Journal of Theoretical Physics 58, no. 8 (June 1, 2019): 2531–49. http://dx.doi.org/10.1007/s10773-019-04143-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Chen, Z. Q., J. Q. Wang, X. L. Li, Y. H. Ji, B. R. Zhang, Y. Y. Jiang, and Z. S. Wang. "Avoiding Loss of Fidelity for Universal Entangling Geometric Quantum Gate." International Journal of Theoretical Physics 48, no. 10 (July 9, 2009): 2904–15. http://dx.doi.org/10.1007/s10773-009-0082-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Heydari, Hoshang. "Selective Phase Rotation Quantum Gate Entangler." Open Systems & Information Dynamics 16, no. 04 (December 2009): 407–12. http://dx.doi.org/10.1142/s1230161209000293.

Full text
Abstract:
We construct a quantum gate entangler for multi-qubit states based on a selective phase rotation transform. In particular, we establish a relation between the quantum integral transform and the quantum gate entangler in terms of universal controlled gates for multi-qubit states. Our result gives an effective way of constructing topological and geometrical quantum gate entanglers for multipartite quantum systems, which could also lead to a construction of geometrical quantum algorithms.
APA, Harvard, Vancouver, ISO, and other styles
49

IONICIOIU, RADU. "THE PARITY GATE: FROM QUANTUM NETWORKS TO ENTANGLEMENT GENERATION." International Journal of Quantum Information 05, no. 01n02 (February 2007): 3–7. http://dx.doi.org/10.1142/s0219749907002451.

Full text
Abstract:
It has been shown recently that parity measurement is an efficient entangler for fermions and hence is a universal resource for fermionic quantum computing with linear elements. In this article, we investigate several properties of the parity P-gate. We construct a simple quantum network model for the P-gate and derive gate identities for it. Finally, we examine entanglement generation using parity measurements.
APA, Harvard, Vancouver, ISO, and other styles
50

Harrow, A. W. "Exact universality from any entangling gate without inverses." Quantum Information and Computation 9, no. 9&10 (September 2009): 773–77. http://dx.doi.org/10.26421/qic9.9-10-4.

Full text
Abstract:
This note proves that arbitrary local gates together with any entangling bipartite gate V are universal. Previously this was known only when access to both V and V^\dag was given, or when approximate universality was demanded.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Universal gate' for other source types:
Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography