Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

数理解析研究所講究録

On quantum logical gate based on ESR (Analytical Study of Quantum Information and Related Fields)

Masanori Ohya, Igor Vasil'evich Volovich, Noboru Watanabe

Published Apr 1, 2001• 0 citations
OpenAlex

Abstract

In classical computer, there exist inevitable demerits for discussing log- ical gates.One of the demerits is an irreversibility of logical gates, that is the AND and the OR gates.This property causes to the restriction of computtional speed for the classical computer.$\mathrm{T}\mathrm{h}\dot{\mathrm{e}}$ re are several kind of ap- proaches for avoiding these demetits.One of these approaches is proposed by Feynman [1].He proved that every logical gates can be contructed by combining with only two reversible gates, i.e., the NOT and the Controlled NOT (CNOT) gates.By the way, there are several approaches for realizing quantum logical gates.One of those approaches is the study by means of a nuclear magnetic 1

Related papers

On construction of quantum logical gate based on ESR

Kenichiro Mayuzumi, Kenichiro Mayuzumi, Нобoрy Ватанабе +3 more

A quantum computer is a computation device operated by means of quantum mechanical phenomena. There are many candidates that are being pursued for physically implementing the quantum computer.The quantum logical gate based on the electron spin resonance (ESR) was studied in ref. [3]. In this paper, we discuss a construction of Controlled-Controlled-NOT (CCNOT) gate by using the nonrelativistic formulation of ESR.

Вестник Самарского государственного технического университета Серия Физико-математические науки•Jan 1, 2013•1 citation

Computing with the Square Root of NOT

Alexis De Vos, Jan De Beule, Leo Storme

To the two classical reversible 1-bit logic gates, i.e. the identity gate (a.k.a. the follower) and the NOT gate (a.k.a. the inverter), we add an extra gate, the square root of NOT. Similarly, we add to the 24 classical reversible 2-bit circuits, both the square root of NOT and the controlled square root of NOT. This leads to a new kind of calculus, situated between classical reversible computing and quantum computing.

Serdica Journal of Computing•Jan 11, 2010•10 citations

Quantum Logical Gate Based on Fock Space (函数解析学の応用としての情報数理の研究)

Wolfgang Freudenberg, 雅則 大矢, 昇 渡邉

In usual computer, there exists a restriction of computational speed because of irreversibility of logical gate.In order to avoid this demerit, Fredkin and Toffoli [3] proposed a conservative logical gate.Based on their work, Milburn [4] introduced a physical model of reversible quantum logical gate using beam splittings and a Kerr medium.This model is called FTM (Fredkin -Toffoli -Milburn gate).FTM gate was described by the quantum channel and the efficiency of information transmission of the FTM gate was discussed in [10].FTM gate is using a photon number state as an input state for control gate.The photon number state might be difficult to realize physically.In this paper, we introduced a new unitary operator related to the Kerr device on symmetric Fock space in order to avoid this difficulty.

数理解析研究所講究録•Jan 1, 2001•0 citations

On comparison of calculation time of quantum logic gate using ESR

Yoichi Maebayashi, Noboru Watanabe

IEICE Technical Report; IEICE Tech. Rep.•Jul 18, 2019•0 citations

ON MATHEMATICAL TREATMENT OF QUANTUM COMMUNICATION GATE ON FOCK SPACE

Wolfgang Freudenberg, Masanori Ohya, Noboru Watanabe

In usual computer, there exists an upper bound of computational speed because of irreversibility of logical gate. In order to avoid this demerit, Fredkin and Toffoli 4 proposed a conservative logical gate. Based on their work, Milburn 5 constructed a physical model of reversible quantum logical gate with beam splittings and a Kerr medium. This model is called FTM (Fredkin - Toffoli - Milburn gate) in this paper.This FTM gate was described by the quantum channel and the efficiency of information transmission of the FTM gate was discussed in 11 . FTM gate is using a photon number state as an input state for control gate. The photon number state might be difficult to realize physically. In this paper, we introduced a new device on symmetric Fock space in order to avoid this difficulty. In Section 1, we briefly review quantum channels and beam splittings. In Section 2, we explain the quantum channel for FTM gate In Section 3, we intruduced a new device on symmetric Fock space and discuss the truth table for our gate.

•Jan 1, 2006•0 citations

On Beam Splittings and Quantum Logical Gate on Fock Space (New Development of Infinite-Dimensional Analysis and Quantum Probability)

Wolfgang Freudenberg, Masanori Ohya, Noboru Watanabe

In usual computer, there is an upper bound of computational speed because of irreversibility of logical gate.In order to avoid this demerit, Fredkin and Tof- foli [3] proposed a conservative logical gate.After that, Milburn [4] constructed a physical model of reversible quantum gate with beam splittings and a Kerr medium.This model is called FTM (Fredkin $-$ Toffoli $-$ Milburn gate) in this paper.This FTM gate was described by the quantum channel and the efficiency of information transmission of the FTM gate was discussed in [10].FTM gate is using a photon number state as an input state for control gate.The photon number state might be difficult to realize physically.In this paper, we introduced a new device on symmetric Fock space in order to avoid this difficulty.In Section 1, we briefly review noisy quantum channels and generalized beam splittings.In Section 2, we explain the quantum channel for FTM gate based on the notation of Section 1.In Section 3, we intruduced a new operator on symmetric Fock space and discuss the truth table for our new gate.

数理解析研究所講究録•Apr 1, 2000•0 citations
In classical computer, there exist inevitable demerits for discussing log- ical gates.One of the demerits is an irreversibility of logical gates, that is the AND and the OR gates.This property causes to the restriction of computtional speed for the classical computer.The˙\mathrm{T}\mathrm{h}\dot{\mathrm{e}}The˙ re are several kind of ap- proaches for avoiding these demetits.One of these approaches is proposed by Feynman [1].He proved that every logical gates can be contructed by combining with only two reversible gates, i.e., the NOT and the Controlled NOT (CNOT) gates.By the way, there are several approaches for realizing quantum logical gates.One of those approaches is the study by means of a nuclear magnetic 1
In usual computer, there exists a restriction of computational speed because of irreversibility of logical gate.In order to avoid this demerit, Fredkin and Toffoli [3] proposed a conservative logical gate.Based on their work, Milburn [4] introduced a physical model of reversible quantum logical gate using beam splittings and a Kerr medium.This model is called FTM (Fredkin -Toffoli -Milburn gate).FTM gate was described by the quantum channel and the efficiency of information transmission of the FTM gate was discussed in [10].FTM gate is using a photon number state as an input state for control gate.The photon number state might be difficult to realize physically.In this paper, we introduced a new unitary operator related to the Kerr device on symmetric Fock space in order to avoid this difficulty.
In usual computer, there exists an upper bound of computational speed because of irreversibility of logical gate. In order to avoid this demerit, Fredkin and Toffoli 4 proposed a conservative logical gate. Based on their work, Milburn 5 constructed a physical model of reversible quantum logical gate with beam splittings and a Kerr medium. This model is called FTM (Fredkin - Toffoli - Milburn gate) in this paper.This FTM gate was described by the quantum channel and the efficiency of information transmission of the FTM gate was discussed in 11 . FTM gate is using a photon number state as an input state for control gate. The photon number state might be difficult to realize physically. In this paper, we introduced a new device on symmetric Fock space in order to avoid this difficulty. In Section 1, we briefly review quantum channels and beam splittings. In Section 2, we explain the quantum channel for FTM gate In Section 3, we intruduced a new device on symmetric Fock space and discuss the truth table for our gate.
In usual computer, there is an upper bound of computational speed because of irreversibility of logical gate.In order to avoid this demerit, Fredkin and Tof- foli [3] proposed a conservative logical gate.After that, Milburn [4] constructed a physical model of reversible quantum gate with beam splittings and a Kerr medium.This model is called FTM (Fredkin −-− Toffoli −-− Milburn gate) in this paper.This FTM gate was described by the quantum channel and the efficiency of information transmission of the FTM gate was discussed in [10].FTM gate is using a photon number state as an input state for control gate.The photon number state might be difficult to realize physically.In this paper, we introduced a new device on symmetric Fock space in order to avoid this difficulty.In Section 1, we briefly review noisy quantum channels and generalized beam splittings.In Section 2, we explain the quantum channel for FTM gate based on the notation of Section 1.In Section 3, we intruduced a new operator on symmetric Fock space and discuss the truth table for our new gate.