Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2015 Aug 7:6:7913.
doi: 10.1038/ncomms8913.

Experimental superposition of orders of quantum gates

Affiliations

Experimental superposition of orders of quantum gates

Lorenzo M Procopio et al. Nat Commun. .

Abstract

Quantum computers achieve a speed-up by placing quantum bits (qubits) in superpositions of different states. However, it has recently been appreciated that quantum mechanics also allows one to 'superimpose different operations'. Furthermore, it has been shown that using a qubit to coherently control the gate order allows one to accomplish a task--determining if two gates commute or anti-commute--with fewer gate uses than any known quantum algorithm. Here we experimentally demonstrate this advantage, in a photonic context, using a second qubit to control the order in which two gates are applied to a first qubit. We create the required superposition of gate orders by using additional degrees of freedom of the photons encoding our qubits. The new resource we exploit can be interpreted as a superposition of causal orders, and could allow quantum algorithms to be implemented with an efficiency unlikely to be achieved on a fixed-gate-order quantum computer.

PubMed Disclaimer

Figures

Figure 1
Figure 1. Theoretical Concept.
(a) Given two unitary gates, U1 and U2, the circuit model allows us to wire them in one of two possible ways: either U1 before U2, or (b) U2 before U1. (c) Quantum mechanics allows us to coherently control both options, such that the qubit sees both U1 before U2, and U2 before U1. (d) The 2-SWITCH operation applies U1 and U2 to qubit 2 in both orders, as shown in panel c, dependent on the state of qubit 1. Unless at least one of U1 and U2 is used more than once, the 2-SWITCH operation cannot be implemented with standard circuit-model elements. To be explicit, the 2-SWITCH applies U1U2 to formula image (the lower qubit) if the upper qubit is in formula image, and U2U1 to formula image if the upper qubit is in formula image. Measuring the state of qubit 1 in the formula image basis allows one to unambiguously decide if U1 and U2 commute or anti-commute with only a single use of each gate. In this circuit, H is the Hadamard gate, and formula image.
Figure 2
Figure 2. Experimental Implementation.
Our optical implementation to distinguish whether a pair of unitary gates commute or anti-commute with only a single copy of each gate. The photons for our experiment are generated in a separable polarization state using a Sagnac source (a). One photon is used as a herald, and the second is fed into the interferometer (b). The unitary gates in question are each implemented with three waveplates, and act on the polarization of single photons.
Figure 3
Figure 3. Results for Pauli Gates.
Experimental data showing the probability with which the photon exits from a port when determining if a pair of random gates commute or anti-commute. The blue bars are the experimentally observed probabilities for the photon to exit port 1, and the green bars to exit port 0. If the gates commute, then, ideally, the photon should always exit port 0, while if they anti-commute the photon should exit port 1. The x axis is labelled with the choice of U1 and U2, where formula image, is the identity, X=σx, Y=σy, and Z=σz. The average success rate (probability to exit the ‘correct port') of these data is 0.973±0.016.
Figure 4
Figure 4. Results for Random Gates.
Experimental data showing the probability with which the photon exits from a port when determining if a pair of random gates commute or anti-commute. 50 commuting and 50 anti-commuting pairs of gates were tested, of which 10 for each case are shown here. The full data set is presented in the Supplementary Fig. 2. The data representation in this figure follows the same convention as in Fig. 3. However, here the x axis is labelled Ai for anti-commuting case number i, and Ci for commuting case number i.

References

    1. Deutsch D. Quantum computational networks. Proc. R. Soc. Lond A Math. Phys. Sci. 425, 73–90 (1989).
    1. Nielsen M. A. & Chuang I. L. Quantum Computation and Quantum Information 1st ed. Cambridge University Press (2000).
    1. Aharonov Y. et al. Superpositions of time evolutions of a quantum system and a quantum time-translation machine. Phys. Rev. Lett. 64, 2965–2968 (1990). - PubMed
    1. Chiribella G. et al. Quantum computations without definite causal structure. Phys. Rev. A. 88, 022318 (2013).
    1. Oreshkov O. et al. ‘Quantum correlations with no causal order,'. Nat. Commun. 3, 1092 (2012). - PMC - PubMed

Publication types