Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userExperimental realization of linear-optical partial SWAP gates
107
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We present a linear-optical implementation of a class of two-qubit partial SWAP gates for polarization states of photons. Different gate operations, including the SWAP and entangling square root of SWAP, can be obtained by changing a classical control parameter -- namely the path difference in the interferometer. Reconstruction of output states, full process tomography and evaluation of entanglement of formation prove very good performance of the gates.
rate research
Read More
Numerical optimization is used to design linear-optical devices that implement a desired quantum gate with perfect fidelity, while maximizing the success rate. For the 2-qubit CS (or CNOT) gate, we provide numerical evidence that the maximum success rate is $S=2/27$ using two unentangled ancilla resources; interestingly, additional ancilla resources do not increase the success rate. For the 3-qubit Toffoli gate, we show that perfect fidelity is obtained with only three unentangled ancilla photons -- less than in any existing scheme -- with a maximum $S=0.00340$. This compares well with $S=(2/27)^2/2 approx 0.00274$, obtainable by combining two CNOT gates and a passive quantum filter [PRA 68, 064303 (2003)]. The general optimization approach can easily be applied to other areas of interest, such as quantum error correction, cryptography, and metrology [arXiv:0807.4906, PRL 99 070801 (2007)].
Quantum computers have the potential of solving certain problems exponentially faster than classical computers. Recently, Harrow, Hassidim and Lloyd proposed a quantum algorithm for solving linear systems of equations: given an $Ntimes{N}$ matrix $A$ and a vector $vec b$, find the vector $vec x$ that satisfies $Avec x = vec b$. It has been shown that using the algorithm one could obtain the solution encoded in a quantum state $|x$ using $O(log{N})$ quantum operations, while classical algorithms require at least O(N) steps. If one is not interested in the solution $vec{x}$ itself but certain statistical feature of the solution ${x}|M|x$ ($M$ is some quantum mechanical operator), the quantum algorithm will be able to achieve exponential speedup over the best classical algorithm as $N$ grows. Here we report a proof-of-concept experimental demonstration of the quantum algorithm using a 4-qubit nuclear magnetic resonance (NMR) quantum information processor. For all the three sets of experiments with different choices of $vec b$, we obtain the solutions with over 96% fidelity. This experiment is a first implementation of the algorithm. Because solving linear systems is a common problem in nearly all fields of science and engineering, we will also discuss the implication of our results on the potential of using quantum computers for solving practical linear systems.
We propose and experimentally demonstrate that a Mach-Zehnder interferometer composed of polarized beam splitters and a pentaprism in the place of one of the mirrors works as a linear optical quantum controlled-NOT (CNOT) gate. To perform the information processing, the polarization and orbital angular momentum (OAM) of the photons act as the control and target qubits, respectively. The readout process is simple, requiring only a linear polarizer and a triangular diffractive aperture before detection. The viability and stability of the experiment makes the present proposal a valuable candidate for future implementations in optical quantum computation protocols.
We use the numerical optimization techniques of Uskov et al. [PRA 81, 012303 (2010)] to investigate the behavior of the success rates for KLM style [Nature 409, 46 (2001)] two- and three-qubit entangling gates. The methods are first demonstrated at perfect fidelity, and then extended to imperfect gates. We find that as the perfect fidelity condition is relaxed, the maximum attainable success rates increase in a predictable fashion depending on the size of the system, and we compare that rate of increase for several gates.
Quantum computation with quantum gates induced by geometric phases is regarded as a promising strategy in fault tolerant quantum computation, due to its robustness against operational noises. However, because of the parametric restriction of previous schemes, the main robust advantage of holonomic quantum gates is smeared. Here, we experimentally demonstrate a solution scheme, demonstrating nonadiabatic holonomic single qubit quantum gates with optimal control in a trapped Yb ion based on three level systems with resonant drives, which also hold the advantages of fast evolution and convenient implementation. Compared with corresponding previous geometric gates and conventional dynamic gates, the superiority of our scheme is that it is more robust against control amplitude errors, which is confirmed by the measured gate infidelity through both quantum process tomography and random benchmarking methods. In addition, we also outline that nontrivial two qubit holonomic gates can also be realized within current experimental technologies. Therefore, our experiment validates the feasibility for this robust and fast holonomic quantum computation strategy.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
