6 resultados para Quantum computers
em University of Queensland eSpace - Australia
Resumo:
The scaling of decoherence rates with qubit number N is studied for a simple model of a quantum computer in the situation where N is large. The two state qubits are localized around well-separated positions via trapping potentials and vibrational centre of mass motion of the qubits occurs. Coherent one and two qubit gating processes are controlled by external classical fields and facilitated by a cavity mode ancilla. Decoherence due to qubit coupling to a bath of spontaneous modes, cavity decay modes and to the vibrational modes is treated. A non-Markovian treatment of the short time behaviour of the fidelity is presented, and expressions for the characteristic decoherence time scales obtained for the case where the qubit/cavity mode ancilla is in a pure state and the baths are in thermal states. Specific results are given for the case where the cavity mode is in the vacuum state and gating processes are absent and the qubits are in (a) the Hadamard state (b) the GHZ state.
Resumo:
In this Letter we numerically investigate the fault-tolerant threshold for optical cluster-state quantum computing. We allow both photon loss noise and depolarizing noise (as a general proxy for all local noise), and obtain a threshold region of allowed pairs of values for the two types of noise. Roughly speaking, our results show that scalable optical quantum computing is possible for photon loss probabilities < 3x10(-3), and for depolarization probabilities < 10(-4).
Resumo:
Quantum computers hold great promise for solving interesting computational problems, but it remains a challenge to find efficient quantum circuits that can perform these complicated tasks. Here we show that finding optimal quantum circuits is essentially equivalent to finding the shortest path between two points in a certain curved geometry. By recasting the problem of finding quantum circuits as a geometric problem, we open up the possibility of using the mathematical techniques of Riemannian geometry to suggest new quantum algorithms or to prove limitations on the power of quantum computers.
Resumo:
We consider a universal set of quantum gates encoded within a perturbed decoherence-free subspace of four physical qubits. Using second-order perturbation theory and a measuring device modelled by an infinite set of harmonic oscillators, simply coupled to the system, we show that continuous observation of the coupling agent induces inhibition of the decoherence due to spurious perturbations. We thus advance the idea of protecting or even creating a decoherence-free subspace for processing quantum information.