240 resultados para NMR quantum computing
Resumo:
The effect of gamma-radiation on a perfluoroalkoxy (PFA) resin was examined using solid-state high-speed magic angle spinning (MAS) F-19 NMR spectroscopy. Samples were prepared for analysis by subjecting them to gamma-radiation in the dose range 0.5-3 MGy at either 303, 473, or 573 K. New structures identified include new saturated chain ends, short and long branches, and unsaturated groups. The formation of branched structures was found to increase with increasing irradiation temperature; however, at all temperatures the radiation chemical yield (G value) of new chain ends was greater than the G value of long branch points, suggesting that chain scission is the net process.
Resumo:
The structural changes which occur on the gamma -radiolysis of poly(dimethyl siloxane) (PDMS) under vacuum at 303 K have been investigated using Si-29 and C-13 NMR. New structural units consistent with main chain scission and crosslinking through both H-linking and Y-linking reactions have been identified. The results obtained at various absorbed doses have been used to calculate the G-values for scission and crosslinking. G-values for scission of G(S) = 1.3 +/- 0.2, for H-linking of G(D-CH2-R) = 0.34 +/- 0.02 and for Y-Linking of G(Y) = 1.70 +/- 0.09 were obtained for radiolysis under vacuum at 303 K. Thus crosslinking predominates over scission for radiolysis of PDMS under these conditions, and, by contrast with previous studies, Y-links have been shown to be the predominant form of crosslinks. (C) 2001 Elsevier Science Ltd. All rights reserved.
Resumo:
We present an efficient and robust method for calculating state-to-state reaction probabilities utilising the Lanczos algorithm for a real symmetric Hamiltonian. The method recasts the time-independent Artificial Boundary Inhomogeneity technique recently introduced by Jang and Light (J. Chem. Phys. 102 (1995) 3262) into a tridiagonal (Lanczos) representation. The calculation proceeds at the cost of a single Lanczos propagation for each boundary inhomogeneity function and yields all state-to-state probabilities (elastic, inelastic and reactive) over an arbitrary energy range. The method is applied to the collinear H + H-2 reaction and the results demonstrate it is accurate and efficient in comparison with previous calculations. (C) 2002 Elsevier Science B.V. All rights reserved.
Resumo:
Recently, several groups have investigated quantum analogues of random walk algorithms, both on a line and on a circle. It has been found that the quantum versions have markedly different features to the classical versions. Namely, the variance on the line, and the mixing time on the circle increase quadratically faster in the quantum versions as compared to the classical versions. Here, we propose a scheme to implement the quantum random walk on a line and on a circle in an ion trap quantum computer. With current ion trap technology, the number of steps that could be experimentally implemented will be relatively small. However, we show how the enhanced features of these walks could be observed experimentally. In the limit of strong decoherence, the quantum random walk tends to the classical random walk. By measuring the degree to which the walk remains quantum, '' this algorithm could serve as an important benchmarking protocol for ion trap quantum computers.
Resumo:
We explore the sensitivity of an interferometer based on a quantum circuit for coherent states. We show that its sensitivity is at the Heisenberg limit. Moreover, we show that this arrangement can measure very small length intervals.
Resumo:
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? We provide an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling n-qubit Hamiltonian and local unitary operations. It follows that universal quantum computation can be performed using any entangling interaction and local unitary operations.
Resumo:
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd [Phys. Rev. A 65, 040301(R) (2002)] provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling N-qubit Hamiltonian, and local unitaries. We extend this result to the case where the component systems are qudits, that is, have D dimensions. As a consequence we explain how universal quantum computation can be performed with any fixed two-body entangling N-qudit Hamiltonian, and local unitaries.
Resumo:
We discuss techniques for producing, manipulating, and measuring qubits encoded optically as vacuum- and single-photon states. We show that a universal set of nondeterministic gates can be constructed using linear optics and photon counting. We investigate the efficacy of a test gate given realistic detector efficiencies.
Resumo:
Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-NOT, are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. We present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this result for systems of arbitrary finite dimension has been provided by Brylinski and Brylinski; however, their proof relies on a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical.
Resumo:
We introduce a model of computation based on read only memory (ROM), which allows us to compare the space-efficiency of reversible, error-free classical computation with reversible, error-free quantum computation. We show that a ROM-based quantum computer with one writable qubit is universal, whilst two writable bits are required for a universal classical ROM-based computer. We also comment on the time-efficiency advantages of quantum computation within this model.
Resumo:
This Letter presents a simple formula for the average fidelity between a unitary quantum gate and a general quantum operation on a qudit, generalizing the formula for qubits found by Bowdrey et al. [Phys. Lett. A 294 (2002) 258]. This formula may be useful for experimental determination of average gate fidelity. We also give a simplified proof of a formula due to Horodecki et al. [Phys. Rev. A 60 (1999) 1888], connecting average gate fidelity to entanglement fidelity. (C) 2002 Elsevier Science B.V. All rights reserved.
Resumo:
Recently quantum tomography has been proposed as a fundamental tool for prototyping a few qubit quantum device. It allows the complete reconstruction of the state produced from a given input into the device. From this reconstructed density matrix, relevant quantum information quantities such as the degree of entanglement and entropy can be calculated. Generally, orthogonal measurements have been discussed for this tomographic reconstruction. In this paper, we extend the tomographic reconstruction technique to two new regimes. First, we show how nonorthogonal measurements allow the reconstruction of the state of the system provided the measurements span the Hilbert space. We then detail how quantum-state tomography can be performed for multiqudits with a specific example illustrating how to achieve this in one- and two-qutrit systems.
Resumo:
Parrondo's paradox arises when two losing games are combined to produce a winning one. A history-dependent quantum Parrondo game is studied where the rotation operators that represent the toss of a classical biased coin are replaced by general SU(2) operators to transform the game into the quantum domain. In the initial state, a superposition of qubits can be used to couple the games and produce interference leading to quite different payoffs to those in the classical case. (C) 2002 Elsevier Science B.V. All rights reserved.