40 resultados para Gates
em University of Queensland eSpace - Australia
Resumo:
We define several quantitative measures of the robustness of a quantum gate against noise. Exact analytic expressions for the robustness against depolarizing noise are obtained for all bipartite unitary quantum gates, and it is found that the controlled-NOT gate is the most robust two-qubit quantum gate, in the sense that it is the quantum gate which can tolerate the most depolarizing noise and still generate entanglement. Our results enable us to place several analytic upper bounds on the value of the threshold for quantum computation, with the best bound in the most pessimistic error model being p(th)less than or equal to0.5.
Resumo:
We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries. We also note that a related lower bound holds for arbitrary n-qubit gates.
Resumo:
We compare three proposals for nondeterministic control-sign gates implemented using linear optics and conditional measurements with nonideal ancilla mode production and detection. The simplified Knill-Laflamme-Milburn gate [Ralph , Phys. Rev. A 65, 012314 (2001)] appears to be the most resilient under these conditions. We also find that the operation of this gate can be improved by adjusting the beam splitter ratios to compensate to some extent for the effects of the imperfect ancilla.
Resumo:
In this paper, we apply the canonical decomposition of two-qubit unitaries to find pulse schemes to control the proposed Kane quantum computer. We explicitly find pulse sequences for the controlled-NOT, swap, square root of swap, and controlled Z rotations. We analyze the speed and fidelity of these gates, both of which compare favorably to existing schemes. The pulse sequences presented in this paper are theoretically faster, with higher fidelity, and simpler. Any two-qubit gate may be easily found and implemented using similar pulse sequences. Numerical simulation is used to verify the accuracy of each pulse scheme.
Resumo:
In this paper we investigate the effect of dephasing on proposed quantum gates for the solid-state Kane quantum computing architecture. Using a simple model of the decoherence, we find that the typical error in a controlled-NOT gate is 8.3x10(-5). We also compute the fidelities of Z, X, swap, and controlled Z operations under a variety of dephasing rates. We show that these numerical results are comparable with the error threshold required for fault tolerant quantum computation.
Resumo:
We show that interesting multigate circuits can be constructed using a postselected controlled-sign gate that works with a probability (1/3)(n), where n-1 is the number of controlled-sign gates in the circuit, rather than (1/9)(n-1), as would be expected from a sequence of such gates. We suggest some quantum information tasks which could be demonstrated using these circuits, such as parity checking and cluster-state computation.
Resumo:
In this paper we explore the possibility of fundamental tests for coherent-state optical quantum computing gates [ T. C. Ralph et al. Phys. Rev. A 68 042319 (2003)] using sophisticated but not unrealistic quantum states. The major resource required in these gates is a state diagonal to the basis states. We use the recent observation that a squeezed single-photon state [S(r)∣1⟩] approximates well an odd superposition of coherent states (∣α⟩−∣−α⟩) to address the diagonal resource problem. The approximation only holds for relatively small α, and hence these gates cannot be used in a scalable scheme. We explore the effects on fidelities and probabilities in teleportation and a rotated Hadamard gate.
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.
Resumo:
We generated draft genome sequences for two cold-adapted Archaea, Methanogenium frigidum and Methanococcoides burtonii, to identify genotypic characteristics that distinguish them from Archaea with a higher optimal growth temperature (OGT). Comparative genomics revealed trends in amino acid and tRNA composition, and structural features of proteins. Proteins from the cold-adapted Archaea are characterized by a higher content of noncharged polar amino acids, particularly Gin and Thr and a lower content of hydrophobic amino acids, particularly Leu. Sequence data from nine methanogen genomes (OGT 15degrees-98degreesC) were used to generate IIII modeled protein structures. Analysis of the models from the cold-adapted Archaea showed a strong tendency in the solvent-accessible area for more Gin, Thr, and hydrophobic residues and fewer charged residues. A cold shock domain (CSD) protein (CspA homolog) was identified in M. frigidum, two hypothetical proteins with CSD-folds in M. burtonii, and a unique winged helix DNA-binding domain protein in M. burtonii. This suggests that these types of nucleic acid binding proteins have a critical role in cold-adapted Archaea. Structural analysis of tRNA sequences from the Archaea indicated that GC content is the major factor influencing tRNA stability in hyperthermophiles, but not in the psychrophiles, mesophiles or moderate thermophiles. Below an OGT of 60degreesC, the GC content in tRNA was largely unchanged, indicating that any requirement for flexibility of tRNA in psychrophiles is mediated by other means. This is the first time that comparisons have been performed with genome data from Archaea spanning the growth temperature extremes. from psychrophiles to hyperthermophiles
Resumo:
How useful is a quantum dynamical operation for quantum information processing? Motivated by this question, we investigate several strength measures quantifying the resources intrinsic to a quantum operation. We develop a general theory of such strength measures, based on axiomatic considerations independent of state-based resources. The power of this theory is demonstrated with applications to quantum communication complexity, quantum computational complexity, and entanglement generation by unitary operations.