Abstract
Encoding qubits in multiple degrees of freedom (DOFs) of a quantum system allows less-decoherence quantum information processing with much less quantum resources. We present a compact and scalable quantum circuit to determinately implement a hyper-parallel controlled-controlled-phase-flip (hyper-C2PF) gate in a three-photon system in both the polarization and spatial DOFs. In contrast with the one with many qubits encoding on one DOF only, our hyper-C2PF gate operating two independent C2PF gates on a three-photon system with less decoherence, and reduces the quantum resources required in quantum information processing by a half. Additional photons, necessary for many approaches, are not required in the present scheme. Our calculation shows that this hyper-C2PF gate is feasible in experiment.
Highlights
Quantum computers promise to solve certain computational tasks which are intractable for a classical one [1]
Multiqubit gates play a central role in quantum networks, quantum corrections, and quantum algorithms, and they serve as a stepping stone for implementing a scalable quantum computer
Optical quantum information processing has been received great attention and generally are focused on the traditionary ones, in which the information is encoded in the polarization degree of freedom (DOF) of photons only
Summary
Quantum computers promise to solve certain computational tasks which are intractable for a classical one [1]. The classical feed-forward single-qubit operations, as shown in Tab. 1, are performed on the three outing photons to raise the success probability of our hyper-C2PF gate to 100% in principle. These operations result in a three-photon output state. Classical feed-forward operation phase shift π is performed on the spatial mode a1 (no) phase shift π is performed on the spatial mode b2 (no) σz is performed on photon 1 (no) −σz is performed on photon 2 (no)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.