Preface Monodromic Quantum Computing Quantum Games and Programmable Quantum Systems The Fraunhofer Quantum Computing Simulator NMR and the Problem of Quantum Computer Creation: New Outlook Trade-off in Quantum Amplitude Amplification Techniques A Formal Approach to Quantum Genetic Algorithms Decompositions of General Quantum Gates Cavity QED and Quantum Computation in the Weak Coupling Regime II : Complete Construction of the Controlled - Controlled NOT Gate Revisit Mixed State Geometric Phase On Implementation of Ferrite Magnetostatic/Magnetoelectric Particles for Quantum Computation Index.
Preface Monodromic Quantum Computing Quantum Games and Programmable Quantum Systems The Fraunhofer Quantum Computing Simulator NMR and the Problem of Quantum Computer Creation: New Outlook Trade-off in Quantum Amplitude Amplification Techniques A Formal Approach to Quantum Genetic Algorithms Decompositions of General Quantum Gates Cavity QED and Quantum Computation in the Weak Coupling Regime II : Complete Construction of the Controlled - Controlled NOT Gate Revisit Mixed State Geometric Phase On Implementation of Ferrite Magnetostatic/Magnetoelectric Particles for Quantum Computation Index.
Preface FOUNDATIONS OF QUANTUM INFORMATICS Spins: The Stern-Gerlach experiment and spin filter EPR, Bell's inequalities, and hidden variables The Landauer principle QUANTUM COMPUTATION AND QUANTUM SYSTEMS Turing machines and binary logic gates Quantum mechanical systems Hilbert spaces Complex finite dimensional Hilbert Spaces Quantum Turing machines Universality of elementary quantum gates Quantum algorithms Quantum adder and multiplier Quantum error correction codes Lasers: a heuristic introduction Quantum computing devices and requirements TWO-LEVEL ATOMS AND CAVITY QED Two-level atoms Quantization of the electromagnetic field Cavity QED Cavity QED for the quantum phase gate Quantum eraser Quantum disentanglement eraser IMPERFECT QUANTUM OPERATIONS Fidelity Density matrices Time evolution of density matrices Examples of master equations Fidelity calculations ION TRAPS Introduction Ion qubits Summary of ion preparation Coherence Quantum gates Large scale confined-ion quantum computer Trap architecture and performance Teleportation of coherent information Experimental DFS logic gates Quantum error correction by ion traps Summary of ion quantum computation QUANTUM LOGIC USING COLD, CONFINED ATOMS Introduction Atom trapping and detection Atom interactions with external fields Atom trapping Qubits and gates Controlled two-qubit gates Coherence properties of atom gates Assessment QUANTUM DOTS QUANTUM COMPUTING GATES Introduction Electrons in quantum dots microcavity Coupled electron spins Biexciton in a single quantum dot Conclusions LINEAR OPTICS COMPUTERS Classical electrodynamics - Classical computers Quantum electrodynamics - Quantum computers Teleportation Summary and outlook SUPERCONDUCTING QUANTUM COMPUTING DEVICES Introduction Superconductivity More on Cooper pairs and Josephson junctions Superconducting circuits: classical Superconducting circuits: quantum Quantum gates Measurement NMR QUANTUM COMPUTING Nuclear magnetic resonance Basic technology with NMR Solid state NMR Shor's algorithm and its experimental realization Quantum algorithm for lattice-gas systems Conclusion Appendix A: The Fock-Darwin States Appendix B: Evaluation of the exchange energy Appendix C: Transformation of quantum states: SU(2) and SO(3) Appendix D: The Homeomorphism from SU(2) to SO(3)
These notes begin in Chapter 1 with a review of linear algebra and the postulates of quantum mechanics, leading to an explanation of single- and multi-qubit gates. Chapter 2 explores the challenge of constructing arbitrary quantum states from given initial states, and introduces circuits for building oracles. Chapter 3 presents foundational algorithms such as entanglement creation, quantum teleportation, Deutsch-Jozsa, Bernstein-Vazirani, and Simon's algorithm. Chapters 4 and 5 cover algorithms based on the quantum Fourier transform, including phase estimation, period finding, factoring, and logarithm computation. These chapters also include complexity analysis and detailed quantum circuits suitable for implementation in code. Chapter 6 introduces Grover's algorithm for quantum search and amplitude amplification, including its realization via Hamiltonian simulation and a method for derandomization. Chapter 7 discusses basic techniques for Hamiltonian simulation, such as Lie-Trotter decomposition, sparse Hamiltonians, and the linear combination of unitaries. It also provides example circuits for simulating Hamiltonians expressed as linear combinations of Pauli operators. Chapter 8 introduces variational quantum algorithms, and Chapter 9 presents an algorithm for simulating fermionic many-particle systems, with an emphasis on molecular Hamiltonians. It also outlines the key transformations needed to map a molecular Hamiltonian to a form suitable for simulation on a quantum computer.
In this paper we treat a cavity QED quantum computation. Namely, we consider a model of quantum computation based on n atoms of laser-cooled and trapped linearly in a cavity and realize it as the n atoms Tavis-Cummings Hamiltonian interacting with n external (laser) fields. We solve the Schr{\" o}dinger equation of the model in the weak coupling regime to construct the controlled NOT gate in the case of n=2, and to construct the controlled-controlled NOT gate in the case of n=3 by making use of several resonance conditions and rotating wave approximation associated to them. We also present an idea to construct general quantum circuits. The approach is more sophisticated than that of the paper [K. Fujii, Higashida, Kato and Wada, Cavity QED and Quantum Computation in the Weak Coupling Regime, J. Opt. B : Quantum Semiclass. Opt. {\bf 6} (2004), 502]. Our method is not heuristic but completely mathematical, and the significant feature is based on a consistent use of Rabi oscillations.
Genetic algorithms (GA) are stochastic global search methods based on the
mechanics of natural biological evolution, proposed by John Holland in 1975. Here
in this thesis, we have exploited possible utilities of Genetic Algorithm optimization
in Nuclear Magnetic Resonance (NMR) experiments. We have performed
(i ) Pulse sequence generation and optimization for NMR Quantum Information
Processing, (ii ) efficient creation of NOON states, (iii ) Composite operator design
and (iv ) delay optimization for refocused quantitative INEPT. We have generated
time optimal as well as robust pulse sequences for popular quantum gates. A
Matlab package is developed for basic Target unitary operator to pulse sequence
optimization and is explained with an example.
Chapter 1 contains a brief introduction to NMR, Quantum computation and Genetic
algorithm optimization. Experimental unitary operator decomposition using
Genetic Algorithm is explained in Chapter 2. Starting from a two spin homonu-
clear system (5-Bromofuroic acid), we have generated hard pulse sequences for
performing (i ) single qubit rotation, (ii ) controlled NOT gates and (iii ) pseudo
pure state creation, which demonstrates universal quantum computation in such
systems. The total length of the pulse sequence for the single qubit rotation of an
angle π/2 is less than 500µs, whereas the conventional method (using a selective
soft pulse) would need a 2ms shaped pulse. This substantial shortening in time
can lead to a significant advantage in quantum circuits. We also demonstrate the
creation of Long Lived Singlet State and other Bell states, directly from thermal
equilibrium state, with the shortest known pulse sequence. All the pulse sequences
generated here are generic i.e., independent of the system and the spectrometer.
We further generalized this unitary operator decomposition technique for a variable
operators termed as Fidelity Profile Optimization (FPO) (Chapter 3) and
performed quantum simulations of Hamiltonian such as Heisenberg XY interaction
and Dzyaloshinskii-Moriya interaction. Exact phase (φ) dependent experimental
unitary decompositions of Controlled-φ and Controlled Controlled-φ are solved
using first order FPO. Unitary operator decomposition for experimental quantum
simulation of Dzyaloshinskii-Moriya interaction in the presence of Heisenberg XY
interaction is solved using second order FPO for any relative strengths of interactions
(γ) and evolution time (τ ). Experimental gate time for this decomposition
is invariant under γ or τ , which can be used for relaxation independent studies of
the system dynamics. Using these decompositions, we have experimentally verified
the entanglement preservation mechanism suggested by Hou et al. [Annals of
Physics, 327 292 (2012)].
NOON state or Schrodinger cat state is a maximally entangled N qubit state
with superposition of all individual qubits being at |0 and being at |1 . NOON
states have received much attention recently for their high precession phase
measurements, which enables the design of high sensitivity…
In this tutorial we review basic ideas of quantum computing, from quantum bits and state entanglement to quantum gates and quantum networks [1]. In addition, we give an overview over possible physical implementations of quantum gates[2-6], with emphasis on quantum optical systems: this includes ion traps [2,3], and cavity QED in the optical and microwave domain [4-6], Fundamental problems of building quantum computers, in particular the decoherence problem, and error correction schemes for quantum memory elements [7] and quantum gates [8] will be discussed. We conclude with a critical evaluation what should be expected from quantum computing ideas in terms of applications in physics (quantum optics) and mathematics within the nest few years.