Teoria quântica da computação

This undergraduate thesis aims formally define aspects of Quantum Turing Machine using as a basis quantum finite automata. We introduce the basic concepts of quantum mechanics and quantum computing through principles such as superposition, entanglement of quantum states, quantum bits and algorithms. We demonstrate the Bell's teleportation theorem, enunciated in the form of Deutsch-Jozsa definition for quantum algorithms. The way as the overall text were written omits formal aspects of quantum mechanics, encouraging computer scientists to understand the framework of quantum computation. We conclude our thesis by listing the Quantum Turing Machine's main limitations regarding the well-known Classical Turing Machines

A planar Penning trap

In this thesis I present theoretical and experimental results concern- ing the operation and properties of a new kind of Penning trap, the planar trap. It consists of circular electrodes printed on an isolating surface, with an homogeneous magnetic field pointing perpendicular to that surface. The motivation of such geometry is to be found in the construction of an array of planar traps for quantum informa- tional purposes. The open access to radiation of this geometry, and the long coherence times expected for Penning traps, make the planar trap a good candidate for quantum computation. Several proposals for quantum 2-qubit interactions are studied and estimates for their rates are given. An expression for the electrostatic potential is presented, and its fea- tures exposed. A detailed study of the anharmonicity of the potential is given theoretically and is later demonstrated by experiment and numerical simulations, showing good agreement. Size scalability of this trap has been studied by replacing the original planar trap by a trap twice smaller in the experimental setup. This substitution shows no scale effect apart from those expected for the scaling of the parameters of the trap. A smaller lifetime for trapped electrons is seen for this smaller trap, but is clearly matched to a bigger misalignment of the trap’s surface and the magnetic field, due to its more difficult hand manipulation. I also give a hint that this trap may be of help in studying non-linear dynamics for a sextupolarly perturbed Penning trap.

Planck stars: theory and phenomenology

General Relativity (GR) is one of the greatest scientific achievements of the 20th century along with quantum theory. Despite the elegance and the accordance with experimental tests, these two theories appear to be utterly incompatible at fundamental level. Black holes provide a perfect stage to point out these difficulties. Indeed, classical GR fails to describe Nature at small radii, because nothing prevents quantum mechanics from affecting the high curvature zone, and because classical GR becomes ill-defined at r = 0 anyway. Rovelli and Haggard have recently proposed a scenario where a negative quantum pressure at the Planck scales stops and reverts the gravitational collapse, leading to an effective “bounce” and explosion, thus resolving the central singularity. This scenario, called Black Hole Fireworks, has been proposed in a semiclassical framework. The purpose of this thesis is twofold: - Compute the bouncing time by means of a pure quantum computation based on Loop Quantum Gravity; - Extend the known theory to a more realistic scenario, in which the rotation is taken into account by means of the Newman-Janis Algorithm.

Creation of maximally entangled photon-number states using optical fiber multiports

We theoretically demonstrate a method for producing the maximally path-entangled state (1/root2)(\N,0>+exp[iNphi]\0,N>) using intensity-symmetric multiport beam splitters, single photon inputs, and either photon-counting postselection or conditional measurement. The use of postselection enables successful implementation with non-unit efficiency detectors. We also demonstrate how to make the same state more conveniently by replacing one of the single photon inputs by a coherent state.

Measuring a photonic qubit without destroying it

Measuring the polarization of a single photon typically results in its destruction. We propose, demonstrate, and completely characterize a quantum nondemolition (QND) scheme for realizing such a measurement nondestructively. This scheme uses only linear optics and photodetection of ancillary modes to induce a strong nonlinearity at the single-photon level, nondeterministically. We vary this QND measurement continuously into the weak regime and use it to perform a nondestructive test of complementarity in quantum mechanics. Our scheme realizes the most advanced general measurement of a qubit to date: it is nondestructive, can be made in any basis, and with arbitrary strength.

Practical scheme for error control using feedback

We describe a scheme for quantum-error correction that employs feedback and weak measurement rather than the standard tools of projective measurement and fast controlled unitary gates. The advantage of this scheme over previous protocols [for example, Ahn Phys. Rev. A 65, 042301 (2001)], is that it requires little side processing while remaining robust to measurement inefficiency, and is therefore considerably more practical. We evaluate the performance of our scheme by simulating the correction of bit flips. We also consider implementation in a solid-state quantum-computation architecture and estimate the maximal error rate that could be corrected with current technology.

Measuring geometric phases of scattering states in nanoscale electronic devices

We show how a quantum property, a geometric phase, associated with scattering states can be exhibited in nanoscale electronic devices. We propose an experiment to use interference to directly measure the effect of this geometric phase. The setup involves a double-path interferometer, adapted from that used to measure the phase evolution of electrons as they traverse a quantum dot (QD). Gate voltages on the QD could be varied cyclically and adiabatically, in a manner similar to that used to observe quantum adiabatic charge pumping. The interference due to the geometric phase results in oscillations in the current collected in the drain when a small bias across the device is applied. We illustrate the effect with examples of geometric phases resulting from both Abelian and non-Abelian gauge potentials.

Demonstration of a simple entangling optical gate and its use in bell-state analysis

We demonstrate a new architecture for an optical entangling gate that is significantly simpler than previous realizations, using partially polarizing beam splitters so that only a single optical mode-matching condition is required. We demonstrate operation of a controlled-z gate in both continuous-wave and pulsed regimes of operation, fully characterizing it in each case using quantum process tomography. We also demonstrate a fully resolving, nondeterministic optical Bell-state analyzer based on this controlled-z gate. This new architecture is ideally suited to guided optics implementations of optical gates.

The D(D-3)-anyon chain: integrable boundary conditions and excitation spectra

Chains of interacting non-Abelian anyons with local interactions invariant under the action of the Drinfeld double of the dihedral group D-3 are constructed. Formulated as a spin chain the Hamiltonians are generated from commuting transfer matrices of an integrable vertex model for periodic and braided as well as open boundaries. A different anyonic model with the same local Hamiltonian is obtained within the fusion path formulation. This model is shown to be related to an integrable fusion interaction round the face model. Bulk and surface properties of the anyon chain are computed from the Bethe equations for the spin chain. The low-energy effective theories and operator content of the models (in both the spin chain and fusion path formulation) are identified from analytical and numerical studies of the finite-size spectra. For all boundary conditions considered the continuum theory is found to be a product of two conformal field theories. Depending on the coupling constants the factors can be a Z(4) parafermion or a M-(5,M-6) minimal model.

Topological massive Dirac edge modes and long-range superconducting Hamiltonians

We discover novel topological effects in the one-dimensional Kitaev chain modified by long-range Hamiltonian deformations in the hopping and pairing terms. This class of models display symmetry-protected topological order measured by the Berry/Zak phase of the lower-band eigenvector and the winding number of the Hamiltonians. For exponentially decaying hopping amplitudes, the topological sector can be significantly augmented as the penetration length increases, something experimentally achievable. For power-law decaying superconducting pairings, the massless Majorana modes at the edges get paired together into a massive nonlocal Dirac fermion localized at both edges of the chain: a new topological quasiparticle that we call topological massive Dirac fermion. This topological phase has fractional topological numbers as a consequence of the long-range couplings. Possible applications to current experimental setups and topological quantum computation are also discussed.

Analog computation using quantum-dot cell network

A novel analog-computation system using a quantum-dot cell network is proposed to solve complex problems. Analog computation is a promising method for solving a mathematical problem by using a physical system analogous to the problem. We designed a novel quantum-dot cell consisting of three-stacked. quantum dots and constructed a cell network utilizing the nearest-neighbor interactions between the cells. We then mapped a graph 3-colorability problem onto the network so that the single-electron configuration of the network in the ground state corresponded to one of the solutions. We calculated the ground state of the cell network and found solutions to the problems. The results demonstrate that analog computation is a promising approach for solving complex problems.

Analog computation using quantum-dot cell network

A novel analog-computation system using a quantum-dot cell network is proposed to solve complex problems. Analog computation is a promising method for solving a mathematical problem by using a physical system analogous to the problem. We designed a novel quantum-dot cell consisting of three-stacked. quantum dots and constructed a cell network utilizing the nearest-neighbor interactions between the cells. We then mapped a graph 3-colorability problem onto the network so that the single-electron configuration of the network in the ground state corresponded to one of the solutions. We calculated the ground state of the cell network and found solutions to the problems. The results demonstrate that analog computation is a promising approach for solving complex problems.

Classical computation with quantum systems

As semiconductor electronic devices scale to the nanometer range and quantum structures (molecules, fullerenes, quantum dots, nanotubes) are investigated for use in information processing and storage, it, becomes useful to explore the limits imposed by quantum mechanics on classical computing. To formulate the problem of a quantum mechanical description of classical computing, electronic device and logic gates are described as quantum sub-systems with inputs treated as boundary conditions, outputs expressed.is operator expectation values, and transfer characteristics and logic operations expressed through the sub-system Hamiltonian. with constraints appropriate to the boundary conditions. This approach, naturally, leads to a description of the subsystem.,, in terms of density matrices. Application of the maximum entropy principle subject to the boundary conditions (inputs) allows for the determination of the density matrix (logic operation), and for calculation of expectation values of operators over a finite region (outputs). The method allows for in analysis of the static properties of quantum sub-systems.

Efficient computation of decoherent quantum walks through eigenvalue perturbation

A number of recent studies have investigated the introduction of decoherence in quantum walks and the resulting transition to classical random walks. Interestingly,it has been shown that algorithmic properties of quantum walks with decoherence such as the spreading rate are sometimes better than their purely quantum counterparts. Not only quantum walks with decoherence provide a generalization of quantum walks that naturally encompasses both the quantum and classical case, but they also give rise to new and different probability distribution. The application of quantum walks with decoherence to large graphs is limited by the necessity of evolving state vector whose sizes quadratic in the number of nodes of the graph, as opposed to the linear state vector of the purely quantum (or classical) case. In this technical report,we show how to use perturbation theory to reduce the computational complexity of evolving a continuous-time quantum walk subject to decoherence. More specifically, given a graph over n nodes, we show how to approximate the eigendecomposition of the n2×n2 Lindblad super-operator from the eigendecomposition of the n×n graph Hamiltonian.