Proposal for a destructive controlled phase gate using linear optics

Knill, Laflamme, and Milburn showed that linear optics techniques could be used to implement a nonlinear sign gate. They also showed that two of their nonlinear sign gates could be combined to implement a controlled-phase gate, which has a number of practical applications. Here we describe an alternative implementation of a controlled-phase gate for a single-rail target qubit that only requires the use of a single nonlinear sign gate. This gives a much higher average probability of success when the required ancilla photons are generated using heralding techniques. This implementation of a controlled-phase gate destroys the control qubit, which is acceptable in a number of applications where the control qubit would have been destroyed in any event, such as in a postselection process.

Destructive Controlled-Phase Gate using Linear Optics

Knill, Laflamme, and Milburn showed that linear optics techniques could be used to implement a nonlinear sign gate. They also showed that two of their nonlinear sign gates could be combined to implement a controlled-phase gate, which has a number of practical applications. Here we describe an alternative implementation of a controlled-phase gate that only requires the use of a single nonlinear sign gate. This gives a much higher average probability of success when the required ancilla photons are generated using heralding techniques. This implementation of a controlled-phase gate destroys the control qubit, which is acceptable in a number of applications where the control qubit would have been destroyed in any event, such as in a postselection process.

Optimal two-qubit circuits for universal fault-tolerant quantum computation

We study two-qubit circuits over the Clifford+CS gate set, which consists of the Clifford gates together with the controlled-phase gate CS = diag(1, 1, 1, i). The Clifford+CS gate set is universal for quantum computation and its elements can be implemented fault-tolerantly in most error-correcting schemes through magic state distillation. Since non-Clifford gates are typically more expensive to perform in a fault-tolerant manner, it is often desirable to construct circuits that use few CS gates. In the present paper, we introduce an efficient and optimal synthesis algorithm for two-qubit Clifford+CS operators. Our algorithm inputs a Clifford+CS operator U and outputs a Clifford+CS circuit for U, which uses the least possible number of CS gates. Because the algorithm is deterministic, the circuit it associates to a Clifford+CS operator can be viewed as a normal form for that operator. We give an explicit description of these normal forms and use this description to derive a worst-case lower bound of $$5{{\rm{log}}}_{2}(\frac{1}{\epsilon })+O(1)$$ 5 log 2 ( 1 ϵ ) + O ( 1 ) on the number of CS gates required to ϵ-approximate elements of SU(4). Our work leverages a wide variety of mathematical tools that may find further applications in the study of fault-tolerant quantum circuits.

Bidirectional quantum-controlled teleportation using six-qubit cluster state without remote joint operation

Utilizing a six-qubit cluster state as quantum channel, a bidirectional controlled quantum teleportation (BCQT) scheme was put forward by Yan in [Int. J. Theor. Phys. 52, 3870 (2013)]. However, in order to accomplish the task, two agents must cooperate to perform a quantum controlled phase gate operation on their two qubits. In view of the present technique, such kind of remote joint operation is difficult to be realized. In this paper, based on the same cluster state, we propose a different BCQT scheme to avoid the remote joint operation. Besides, an unnecessary waste of classical messages in Yan’s scheme is point out.