Space searches with a quantum robot by P. Benioff Perturbation theory and numerical modeling of quantum logic operations with a large number of qubits by G. P. Berman, G. D. Doolen, D. I. Kamenev, G. V. Lopez, and V. I. Tsifrinovich Inconclusive rate with a positive operator valued measure by H. E. Brandt Quantum amplitude amplification and estimation by G. Brassard, P. Hoyer, M. Mosca, and A. Tapp Manipulating the entanglement of one copy of a two-particle pure entangled state by L. Hardy Geometric algebra in quantum information processing by T. F. Havel and C. J. L. Doran Quantum computing and the Jones polynomial by L. H. Kauffman Quantum hidden subgroup algorithms: A mathematical perspective by S. J. Lomonaco, Jr. and L. H. Kauffman Improved two-party and multi-party purification protocols by E. N. Maneva and J. A. Smolin Quantum games and quantum algorithms by D. A. Meyer A proof that measured data and equations of quantum mechanics can be linked only by guesswork by J. M. Myers and F. H. Madjid Quantum computation by geometrical means by J. Pachos Pauli exchange and quantum error correction by M. B. Ruskai Relative entropy in quantum information theory by B. Schumacher and M. D. Westmoreland An unentangled Gleason's theorem by N. R. Wallach Entangled chains by W. K. Wootters.
Space searches with a quantum robot by P. Benioff Perturbation theory and numerical modeling of quantum logic operations with a large number of qubits by G. P. Berman, G. D. Doolen, D. I. Kamenev, G. V. Lopez, and V. I. Tsifrinovich Inconclusive rate with a positive operator valued measure by H. E. Brandt Quantum amplitude amplification and estimation by G. Brassard, P. Hoyer, M. Mosca, and A. Tapp Manipulating the entanglement of one copy of a two-particle pure entangled state by L. Hardy Geometric algebra in quantum information processing by T. F. Havel and C. J. L. Doran Quantum computing and the Jones polynomial by L. H. Kauffman Quantum hidden subgroup algorithms: A mathematical perspective by S. J. Lomonaco, Jr. and L. H. Kauffman Improved two-party and multi-party purification protocols by E. N. Maneva and J. A. Smolin Quantum games and quantum algorithms by D. A. Meyer A proof that measured data and equations of quantum mechanics can be linked only by guesswork by J. M. Myers and F. H. Madjid Quantum computation by geometrical means by J. Pachos Pauli exchange and quantum error correction by M. B. Ruskai Relative entropy in quantum information theory by B. Schumacher and M. D. Westmoreland An unentangled Gleason's theorem by N. R. Wallach Entangled chains by W. K. Wootters.
An invitation to quantum computation: A Rosetta stone for quantum mechanics with an introduction to quantum computation by S. J. Lomonaco, Jr. Qubit devices by H. E. Brandt Quantum algorithms and quantum complexity theory: Introduction to quantum algorithms by P. W. Shor Shor's quantum factoring algorithm by S. J. Lomonaco, Jr. Grover's quantum search algorithm by S. J. Lomonaco, Jr. A survey of quantum complexity theory by U. V. Vazirani Quantum error correcting codes and quantum cryptography: An introduction to quantum error correction by D. Gottesman A talk on quantum cryptography or how Alice outwits Eve by S. J. Lomonaco, Jr. More mathematical connections: Topological quantum codes and anyons by A. Kitaev Quantum topology and quantum computing by L. H. Kauffman An entangled tale of quantum entanglement by S. J. Lomonaco, Jr. Index.
Coding theory: Grobner bases, Pade approximation, and decoding of linear codes by J. B. Farr and S. Gao Some computational tools for estimating the parameters of algebraic geometry codes by G. L. Matthews An introduction to algebraic coding theory by H. N. Ward Recent results on p-ranks and Smith normal forms of some 2−(v,k,λ) designs by Q. Xiang Quantum computing: Quantum walks on graphs and quantum scattering theory by E. Feldman and M. Hillery A continuous variable Shor algorithm by S. J. Lomonaco, Jr. and L. H. Kauffman Entangled states of light by S. J. van Enk Entanglement beyond subsystems by L. Viola, H. Barnum, E. Knill, G. Ortiz, and R. Somma Generalized GHZ states and distributed quantum computing by A. Yimsiriwattana and S. J. Lomonaco, Jr.
Quantum Computation (S. Braunstein). The Los Alamos Trapped Ion Quantum Computer Experiment (R. Hughes, et al.). Experimental Primer on the Trapped Ion Quantum Computer (D. Weineland, et al.). Measurement and State Preparation via Ion Trap Quantum Computing (S. Schneider, et al.). Photon--Wavepackets as Flying Quantum Bits (K. Gheri, et al.). Quantum Logic Gate Operating on Atomic Scattering by Standing Wave Field in Bragg Regime (A. Khan & M. Zubairy). Models of Quantum Turing Machines (P. Benioff). Space, Time, Parallelism and Noise Requirements for Reliable Quantum Computing (A. Steane). The Quantum Hamming and Hexacodes (Th. Beth & M. Grassl). Tight Bounds on Quantum Searching (M. Boyer, et al.). Making an Empty Promise with a Quantum Computer (H. Chau & H.--K. Lo). Flocks of Quantum Clones: Multiple Copying of Qubits (V. Buzck, et al.). Information Gain vs. State Disturbance in Quantum Theory (Ch. Fuchs). On Multi--Particle Entanglement (N. Linden & S. Popescu). Generalized Coherent States and Phase--Space--Interference in Multi--Mode Systems (M. Gagen). Index.
The quantum search algorithm (QSA) is one of the most recent developments in the era of quantum signal processing (QSP) and quantum information theory (QIT). It shows a faster performance in finding the solutions of system such as multiple-input multiple-output (MIMO) communication system, quantum error correction and others with a polynomial order over the classical one. Grover's algorithm is one of the first proposed QSA in identifying the index number of the solution of a system, whose solutions are known to the oracle. A further improved QSA called Boyer-Brassard-Høyer-Tapp (BBHT) is followed by the Durr-Hoyer algorithm (DHA), which proposes to find the solutions, while the exact number of the solutions is not known. In this treatise, we propose two modifications to the existing DHA and BBHT algorithms. In DHA, we propose a semi-quantum framework, where after each iteration in DHA, the non-solution points are removed in classical framework. This makes the data set iteratively shorter. In the case of BBHT algorithm, we propose to choose the Grover search number based on the Gamma distribution instead of the uniform one, which gives more chances to the new larger values to improve probability of success. The performance of the proposed QSAs demonstrates plausible improvement in search success performance as compared to their existing BBHT and DHA counterparts. Numerical simulations are conducted with the proposed QSA algorithms on a MIMO orthogonal frequency division multiplexing (OFDM) system to demonstrate the performance improvement.
The topic of these lectures lies in the new and rapidly growing field of quantum computing,which explores connections between physics and computing in general. Quantum informa-tion processing is a cross-disciplinary field and is of great importance from both a funda-mental, as well as technological perspective [27]. From the fundamental perspective we havedeepened our understanding of the relationship between physics, information and computa-tion in general, and have also gained a deeper understanding of the fundamental aspects ofquantum theory - non-locality and entanglement in particular [31]. From the technologicalperspective we have manipulated larger and larger quantum systems and obtained power-ful practical applications in the domain of communication and cryptography such as theunconditionally secure quantum cryptography (key exchange) and quantum teleportation[7, 14, 5].Historically, the greater potential of the quantum computer was first realised by Feyn-man, who noted that quantum systems appear to be exponentially hard to simulate withclassical computers [15]. He speculated that, therefore, quantum computers could poten-tially be much more powerful than their classical counterparts. This intuition has beenproven to be correct for some tasks, such as factoring large numbers and searching unstruc-tured databases. Every computer is fundamentally a physical system, and any computationis just a physical process undergone by this system. Quantum physics is the most accurateway of describing physical systems and their behaviour in general. Encoding informationinto quantum systems and processing it according to the laws of quantum physics results innew features which do not exist in the classical computation.Large scale quantum computation is still hypothetical. However, Moore’s law
Acting within the framework of geometric quantum mechanics, an interpretation of quantum uncertainty is discussed in terms of Jacobi fields, and a connection with the theory of elliptic curves is outlined, via classical integrability of Schrödinger's dynamics and the cross-ratio interpretation of quantum transition probabilities. Furthermore, a thoroughly geometrical construction of all special unitary representations of the 3-strand braid group on the quantum 1-qubit space is given, and the connection of one of them with elliptic curves admitting complex multiplication automorphisms — the physically relevant one corresponding to the anharmonic ratio — is shown. Also, contact is made with the Temperley–Lieb algebra theoretic constructions of Kauffman and Lomonaco, and it is shown that the standard trace relative to one of the above representations computes the Jones polynomial for particular values of the parameter, for knots arising as closures of 3-strand braids. Subsequently, a geometric entanglement criterion (in terms of Segre embeddings) is discussed, together with a projective geometrical portrait for quantum 2-gates. Finally, Aravind's idea of describing quantum states via knot theory is critically analyzed, and a geometrical picture — involving a blend of SU(2)-representation theory, classical projective geometry, binary trees and Brunnian and Hopf links — is set up in order to describe successive measurements made upon generalized GHZ states, close in spirit to the quantum knot picture again devised by Kauffman and Lomonaco.