We show that a set of optical memories can act as a configurable linear optical network operating on frequency-multiplexed optical states. Our protocol is applicable to any quantum memories that employ off-resonant Raman transitions to store optical information in atomic spins. In addition to the configurability, the protocol also offers favourable scaling with an increasing number of modes where N memories can be configured to implement an arbitrary N-mode unitary operations during storage and readout. We demonstrate the versatility of this protocol by showing an example where cascaded memories are used to implement a conditional CZ gate.
We present how basic logic gates including NAND, NOR and XOR gates can be implemented counterfactually. The two inputs (Bob and Charlie) and the output (Alice) of the proposed counterfactual logic gate are not within the same station but rather separated in three different locations. We show that there is no need to pre-arrange entanglement for the gate, and more importantly, there is no real physical particles traveling among Alice, Bob and Charlie during the information processing. Bob and Charlie only need to independently control the blocking and unblocking of the transmission channels that connect them to Alice. In this way, they can completely determine the state of a real photon at Alices end, thereby leading to implement a counterfactual logic gate. The functionality of a particular counterfactual logic gate is determined only by an appropriate design of Alices optical device. Furthermore, by utilizing the proposed counterfactual logic gates, we demonstrate how to counterfactually prepare the Greenberger-Horne-Zeilinger state and W state with three remote quantum objects, which are in superposition states of blocking and unblocking the transmission channel.
We introduce the method of using an annealing genetic algorithm to the numerically complex problem of looking for quantum logic gates which simultaneously have highest fidelity and highest success probability. We first use the linear optical quantum nonlinear sign (NS) gate as an example to illustrate the efficiency of this method. We show that by appropriately choosing the annealing parameters, we can reach the theoretical maximum success probability (1/4 for NS) for each attempt. We then examine the controlled-z (CZ) gate as the first new problem to be solved. We show results that agree with the highest known maximum success probability for a CZ gate (2/27) while maintaining a fidelity of 0.9997. Since the purpose of our algorithm is to optimize a unitary matrix for quantum transformations, it could easily be applied to other areas of interest such as quantum optics and quantum sensors.
Let $H_1, H_2$ be Hilbert spaces of the same finite dimension $ge2$, and $C$ an arbitrary quantum circuit with (principal) input state in $H_1$ and (principal) output state in $H_2$. $C$ may use ancillas and produce garbage which is traced out. $C$ may employ classical channels and measurement gates. If $C$ computes, for each computation path $mu$ through the circuit, a unitary transformation $U_mu: H_1 to H_2$ then, for each $mu$, the probability that a computation takes path $mu$ is independent of the input.
The concept of directionally unbiased optical multiports is introduced, in which photons may reflect back out the input direction. A linear-optical implementation is described, and the simplest three-port version studied. Symmetry arguments demonstrate potential for unusual quantum information processing applications. The devices impose group structures on two-photon entangled Bell states and act as universal Bell-state processors to implement probabilistic quantum gates acting on state symmetries. These multiports allow optical scattering experiments to be carried out on arbitrary undirected graphs via linear optics and raise the possibility of linear-optical information processing using group structures formed by optical qudit states.
We demonstrate laser-driven two-qubit and single-qubit logic gates with fidelities 99.9(1)% and 99.9934(3)% respectively, significantly above the approximately 99% minimum threshold level required for fault-tolerant quantum computation, using qubits stored in hyperfine ground states of calcium-43 ions held in a room-temperature trap. We study the speed/fidelity trade-off for the two-qubit gate, for gate times between 3.8$mu$s and 520$mu$s, and develop a theoretical error model which is consistent with the data and which allows us to identify the principal technical sources of infidelity.
G. T. Campbell
,O. Pinel
,M. Hosseini
.
(2013)
.
"Configurable unitary transformations and linear logic gates using quantum memories"
.
Geoff Campbell Mr.
هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا