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

Quantum Probability and Infinite Dimensional Analysis

ON QUANTUM LOGICAL GATES ON A GENERAL FOCK SPACE

Wolfgang Freudenberg, Masanori Ohya, NOBURO WATANABE

Published Jan 1, 2005• 2 citations
Publisher

Abstract

In this paper we investigate quantum logical gates of Fredkin type. The information 0 and 1 will be encoded by coherent states on a general Fock space, the interaction between the inputs will be a general beam splitting procedure. The interaction in the control gate is given by a unitary operator. The aim of the paper is to give examples for quantum channels transmitting some information such that the gate will fulfill the truth table. For the output we get simple explicit expressions. Our aim is to construct a gate using the well-known splitting procedures and coherent states.

DOI
10.1142/9789812702104_0017

Related papers

QUANTUM LOGICAL GATES REALIZED BY BEAM SPLITTINGS

Wolfgang Freudenberg, Masanori Ohya, NATALIYA TURCHINA +1 more

In [15] Fredkin and Toffoli proposed a logical conservative gate on the base of which Milburn [24] constructed a quantum logical gate. Photon number states were used as the input state for the control gate. The control gate consisted of a Kerr medium. In the present paper we will realize the truth table that has to be satisified by the Fredkin–Toffoli gate solely by using beam splitting procedures. The Kerr medium is replaced by further beam splittings which are applied to both outputs of the first splitting procedure. The information 0 and 1 are encoded by coherent states on a general bosonic Fock space. The aim of the paper is to give examples for quantum channels transmitting some information such that the gate will fulfill the truth table. For the output we get simple explicit expressions.

•Mar 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

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

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

Two examples of implementation of the if/then/else conditional statement with quantum computers

Guang Ping He

While quantum algorithms are known to be very powerful, there are also people who think that “quantum computers will never be able to run the if/then/else type of logic”. On the other hand, though many experts know that such a claim is a misconception, in literature there is still lacking of a general description of the procedure for implementing the if/then/else conditional statements in the quantum way. In the current work, we present such a general method in details, explaining how the unitary transformation required for any if/then/else operation can be constructed from simpler unitary transformations and projective operators. Moreover, by using the well-known controlled-NOT gate, Fredkin gate and Toffoli gate as examples, it is elaborated that the structure of the existing conditional quantum operations agrees with our general method. An even more complicated example is also provided, showing that our method is convenient for solving real-world if/then/else problems with quantum computers. Thus the result not only refutes the above claim, but also helps to develop the skill on quantum programming.

Proceedings of the Romanian Academy Series A Mathematics Physics Technical Sciences Information Science•Sep 30, 2023•1 citation

A quantum Fredkin gate (Conference Presentation)

Raj B. Patel, Joseph Ho, Franck Ferreyrol +2 more

One of the greatest challenges in modern science is the realisation of quantum computers which, as their scale increases, will allow enhanced performance of tasks across many areas of quantum information processing. Quantum logic gates play a vital role in realising these applications by carrying out the elementary operations on the qubits; a key aim is minimising the resources needed to build these gates into useful circuits. While the salient features of a quantum computer have been shown in proof-of-principle experiments, e.g., single- and two-qubit gates, difficulties in scaling quantum systems to encode and manipulate multiple qubits has hindered demonstrations of more complex operations. This is exemplified by the classical Fredkin (or controlled-SWAP) gate [1] for which, despite many theoretical proposals [2,3] relying on concatenating multiple two-qubit gates, a quantum analogue has yet to be realised. Here, by directly adding control to a two-qubit SWAP unitary [4], we use photonic qubit logic to report the first experimental demonstration of a quantum Fredkin gate [5]. Our scheme uses linear optics and improves on the overall probability of success by an order of magnitude over previous proposals [2,3]. This optical approach allows us to add control an arbitrary black-box unitary which is otherwise forbidden in the standard circuit model [6]. Additionally, the action of our gate exhibits quantum coherence allowing the generation of the highest fidelity three-photon GHZ states to date. The quantum Fredkin gate has many applications in quantum computing, quantum measurements [7] and cryptography [8,9]. Using our scheme, we apply the Fredkin gate to the task of direct measurements of the purity and state overlap of a quantum system [7] without recourse to quantum state tomography.

•Dec 7, 2016•0 citations
In this paper we investigate quantum logical gates of Fredkin type. The information 0 and 1 will be encoded by coherent states on a general Fock space, the interaction between the inputs will be a general beam splitting procedure. The interaction in the control gate is given by a unitary operator. The aim of the paper is to give examples for quantum channels transmitting some information such that the gate will fulfill the truth table. For the output we get simple explicit expressions. Our aim is to construct a gate using the well-known splitting procedures and coherent states.
In [15] Fredkin and Toffoli proposed a logical conservative gate on the base of which Milburn [24] constructed a quantum logical gate. Photon number states were used as the input state for the control gate. The control gate consisted of a Kerr medium. In the present paper we will realize the truth table that has to be satisified by the Fredkin–Toffoli gate solely by using beam splitting procedures. The Kerr medium is replaced by further beam splittings which are applied to both outputs of the first splitting procedure. The information 0 and 1 are encoded by coherent states on a general bosonic Fock space. The aim of the paper is to give examples for quantum channels transmitting some information such that the gate will fulfill the truth table. For the output we get simple explicit expressions.
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.
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 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.
While quantum algorithms are known to be very powerful, there are also people who think that “quantum computers will never be able to run the if/then/else type of logic”. On the other hand, though many experts know that such a claim is a misconception, in literature there is still lacking of a general description of the procedure for implementing the if/then/else conditional statements in the quantum way. In the current work, we present such a general method in details, explaining how the unitary transformation required for any if/then/else operation can be constructed from simpler unitary transformations and projective operators. Moreover, by using the well-known controlled-NOT gate, Fredkin gate and Toffoli gate as examples, it is elaborated that the structure of the existing conditional quantum operations agrees with our general method. An even more complicated example is also provided, showing that our method is convenient for solving real-world if/then/else problems with quantum computers. Thus the result not only refutes the above claim, but also helps to develop the skill on quantum programming.
One of the greatest challenges in modern science is the realisation of quantum computers which, as their scale increases, will allow enhanced performance of tasks across many areas of quantum information processing. Quantum logic gates play a vital role in realising these applications by carrying out the elementary operations on the qubits; a key aim is minimising the resources needed to build these gates into useful circuits. While the salient features of a quantum computer have been shown in proof-of-principle experiments, e.g., single- and two-qubit gates, difficulties in scaling quantum systems to encode and manipulate multiple qubits has hindered demonstrations of more complex operations. This is exemplified by the classical Fredkin (or controlled-SWAP) gate [1] for which, despite many theoretical proposals [2,3] relying on concatenating multiple two-qubit gates, a quantum analogue has yet to be realised. Here, by directly adding control to a two-qubit SWAP unitary [4], we use photonic qubit logic to report the first experimental demonstration of a quantum Fredkin gate [5]. Our scheme uses linear optics and improves on the overall probability of success by an order of magnitude over previous proposals [2,3]. This optical approach allows us to add control an arbitrary black-box unitary which is otherwise forbidden in the standard circuit model [6]. Additionally, the action of our gate exhibits quantum coherence allowing the generation of the highest fidelity three-photon GHZ states to date. The quantum Fredkin gate has many applications in quantum computing, quantum measurements [7] and cryptography [8,9]. Using our scheme, we apply the Fredkin gate to the task of direct measurements of the purity and state overlap of a quantum system [7] without recourse to quantum state tomography.