Research in Quantum Computing and Information

• Argentina
  • University of Buenos Aires, Department of Physics
    • Fernando C. Lombardo
      • Decoherence induced by a composite environment
    • Juan Pablo Paz
      • Tomography and spectroscopy as quantum computations
      • A quantum gate array can be programmed to evaluate the expectation value of any operator
  • Universidad Nacional de Córdoba - Facultad de Matemática, Astronomía y Física
    • Ana Paula Majtey
      • Jensen-Shannon divergence as a measure of distinguishability between mixed quantum states
• Australia
  • Australian National University
    • Department of Physics - Quantum Optics Group
      • Ping Koy Lam
        • Experimental demonstration of continuous variable polarization entanglement
        • Experimental investigation of continuous variable quantum teleportation
    • Research School of Physical Sciences & Engineering - Department of Theoretical Physics
      • Sergey Kun
        • Meltdown in quantum computers needs not occur: Nuclear experiments show a way out
  • Centre for Quantum Computer Technology
    • University of Melbourne
      • Lloyd C. L. Hollenberg
        • Implementation of Shor's Algorithm on a Linear Nearest Neighbour Qubit Array
        • Robustness of Shor's algorithm
    • University of New South Wales - School of Physics
      • Robert G. Clark
        • Towards the fabrication of phosphorus qubits for a silicon quantum computer
        • Encapsulation of phosphorus dopants in silicon for the fabrication of a quantum computer
        • Self-aligned fabrication process for silicon quantum computer devices
        • Maximizing the Hilbert space for a finite number of distinguishable quantum states
    • University of Queensland
      • Quantum Information Theory at The University of Queensland
      • Physics - Quantum Computation
      • Physics - Quantum Information Science
        • Stephen Bartlett
          • Quantum Computation with Harmonic Oscillators
          • Efficient Classical Simulation of Continuous Variable Quantum Information Processes
          • Quantum Computation with Qudits in Spin Systems and Harmonic Oscillators
          • Semigroup techniques for the efficient classical simulation of optical quantum information
          • Classical and quantum communication without a shared reference frame
          • Optimal measurements for relative quantum information
          • Relativistically invariant quantum information
          • Decoherence-full subsystems and the cryptographic power of a private shared reference frame
        • Dominic Berry
          • Efficient quantum algorithms for simulating sparse Hamiltonians
        • Jennifer L. Dodd
          • Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries
          • A simple operational interpretation of the fidelity
        • Mark Dowling
          • Entanglement of indistinguishable particles in condensed matter physics
        • Zbigniew Ficek
          • Multi-quantum eigenstates of a linear chain of coupled qubits
        • Gerard Milburn
          • Simple Scheme for Efficient Linear Optics Quantum Gates
        • Michael Nielsen
          • Book: Nielsen & Chuang, Quantum Computation and Quantum Information
            • Cambridge University Press Web page
          • Papers
            • Quantum information theory
            • On the units of bipartite entanglement: Is sixteen ounces of entanglement always equal to one pound?
            • Introduction to quantum information theory
            • Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state
            • Universal simulation of Hamiltonian dynamics for qudits
            • Quantum dynamics as a physical resource
            • Quantum information science as an approach to complex quantum systems
            • How robust is a quantum gate in the presence of noise?
            • Optical quantum computation using cluster states
            • A geometric approach to quantum circuit lower bounds
          • Quantum Information and Quantum Computation Resources
          • Researchers in quantum computing and information
        • Tobias J. Osborne
          • Entanglement, quantum phase transitions, and density matrix renormalization
          • A practical scheme for quantum computation with any two-qubit entangling gate
        • David Poulin
          • Stabilizer Formalism for Operator Quantum Error Correction
        • Mohan Sarovar
          • Continuous quantum error correction by cooling
      • quantum technology lab
        • Jeremy O'Brien
          • Demonstration of an all-optical quantum controlled-NOT gate (preprint)
          • Quantum process tomography of a controlled-NOT gate
          • Quantum Non-demolition Measurements on Qubits
        • Alexei Gilchrist
          • Efficient Parity Encoded Optical Quantum Computing
  • Macquarie University - Department of Statistics
    • David Bulger
      • Quantum computational gradient estimation
  • Queensland University of Technology - Distributed Systems Technology Centre
    • David McAnally
      • A Refinement of Shor's Algorithm
  • Swinburne University of Technology, Hawthorn - Centre for Atom Optics and Ultrafast Spectroscopy
    • Tien Kieu
      • Quantum algorithm for the Hilbert's tenth problem
      • A reformulation of Hilbert's tenth problem through Quantum Mechanics
      • Computing the Noncomputable
      • Quantum adiabatic algorithm for Hilbert's tenth problem: I. The algorithm
      • An anatomy of a quantum adiabatic algorithm that transcends the Turing computability
  • University of New Brunswick - Department of Mathematics and Statistics
    • Saurya Das
      • Rapid Data Search using Adiabatic Quantum Computation
• Austria
  • AIT Austrian Institute of Technology - Optical Quantum Technology
    • Tech Gate Vienna
      • Stefano Bettelli
        • Toward an architecture for quantum programming
        • Entanglement versus relaxation and decoherence in a quantum algorithm for quantum chaos
        • A quantitative model for the effective decoherence of a quantum computer with imperfect unitary operations
      • Bernhard Ömer
        • Papers
          • Quanten-Faktorisierung
          • Simulation of Quantum Computers
          • A Procedural Formalism for for Quantum Computing
          • Quantum Programming in QCL
            • Institute of Information Systems
          • Classical Concepts in Quantum Programming
        • QCL - A Programming Language for Quantum Computers
      • Momtchil Peev
        • A Novel Protocol-Authentication Algorithm Ruling Out a Man-in-the-Middle Attack in Quantum Cryptography
      • Martin Suda
        • ARCS Working Group on Quantum Information: Quantum Cryptography, Quantum Computing, and Teleportation
        • Book: Quantum Interferometry in Phase Space - Theory and Applications
          • Google Books
  • Graz University of Technology - Institute for Computer Graphics (ICG)
    • Horst Bischof
      • Quantum-wave pattern recognition: From simulations towards implementation
  • University of Innsbruck
    • Institute for Experimental Physics - Quantum Optics and Spectroscopy
      • Rainer Blatt
        • Coherence of qubits based on single Ca$^+$ ions
        • Deterministic quantum teleportation with atoms
      • Hartmut Häffner
        • Precision measurement and compensation of optical Stark shifts for an ion-trap quantum processor
        • Robust entanglement
        • Scalable multiparticle entanglement of trapped ions
      • Mark Riebe
        • Deterministic quantum teleportation with atoms
      • Christian Roos
        • Control and Measurement of Three-Qubit Entangled States
      • Ferdinand Schmidt-Kaler
        • Implementation of the Deutsch-Jozsa algorithm on an ion-trap quantum computer
        • Realization of the Cirac-Zoller controlled-NOT quantum gate
    • Institute for Theoretical Physics
      • Quantum Information
        • Hans J. Briegel
          • Quantum repeaters for communication
          • Persistent entanglement in arrays of interacting particles
        • Marc Hein
          • Multi-party entanglement in graph states
      • Quantum Optics
        • Lin Tian
          • Interfacing quantum optical and solid state qubits
        • Peter Zoller
          • Entangling strings of neutral atoms in 1D atomic pipeline structures
  • Universität Wien - Quantum Optics, Quantum Nanophysics and Quantum Information
    • Markus Aspelmeyer
      • Long-Distance Quantum Communication with Entangled Photons using Satellites
    • Stefanie Barz
      • Experimental Demonstration of Blind Quantum Computing
    • Hannes Böhm
      • Practical Quantum Key Distribution with Polarization-Entangled Photons
    • Caslav Brukner
      • Bell's theorem for general N-qubit states
      • The essence of entanglement
      • Probabilistic Instantaneous Quantum Computation
      • Quantum communication complexity protocol with two entangled qutrits
    • Isabelle Herbauts
      • On the optimality of individual entangling-probe attacks against BB84 quantum key distribution
    • Rainer Kaltenbaek
      • Proof-of-Concept Experiments for Quantum Physics in Space
    • Frank Verstraete
      • Papers
        • Four qubits can be entangled in nine different ways
        • Diverging Entanglement Length in Gapped Quantum Spin Systems
        • DMRG and periodic boundary conditions: a quantum information perspective
    • Philip Walther
      • Experimental Realization of a Photonic Bell-State Analyzer
      • Experimental one-way quantum computing (preprint)
      • Experimental violation of a cluster state Bell inequality
    • Gregor Weihs
      • Quantum Cryptography with Entangled Photon Pairs (Preprint)
      • Photonic Entanglement for Fundamental Tests and Quantum Communication
    • Anton Zeilinger
      • Feasible Entanglement Purification for Quantum Communication
      • Mutually complementary and compatible binary measurements on N qubits
      • Comparison of Entropies in the Light of Separability
  • Vienna University of Technology
    • Institute for Theoretical Physics
      • Karl Svozil
        • Speedup in quantum computation is associated with attenuation of processing probability
        • Quantum computation and complexity theory
        • The diagonalization method in quantum recursion theory
        • Quantum algorithmic information theory
          • The same paper at Svozil's Web site
        • First International Conference on Unconventional Models of Computation UMC'98. An Unconventional Review
        • Quantum logic. A brief outline
        • Reflections on Quantum Computing
        • Finding a state in a haystack
        • Irreducibility of n-ary quantum information
        • Quantum information in base n defined by state partitions
        • Quantum information via state partitions and the context translation principle
        • Feasibility of the interlock protocol against man-in-the-middle attacks on quantum cryptography
        • Four-partite quantum correlations of singlet states
        • Characterization of quantum computable propositions by state discrimination
    • Vienna Center for Quantum Science and Technology (VCQ), Atominstitut
      • Jörg Schmiedmayer
        • Cavity QED with magnetically coupled collective spin states
• Belgium
  • Katholieke Universiteit Leuven, Department of Electrical Engineering, SISTA Research Group
    • Jeroen Dehaene
      • Local permutations of products of Bell states and entanglement distillation
  • Université Libre de Bruxelles
    • Centre for Quantum Information & Communication
      • Nicolas J. Cerf
        • Caltech Homepage
        • Papers
          • Nested quantum search and NP-complete problems
          • Quantum Search by Local Adiabatic Evolution
          • Linear optics and projective measurements alone suffice to create large-photon-number path entanglement
          • Quantum circuit implementation of the Hamiltonian versions of Grover's algorithm
          • Quantum entanglement can be simulated without communication
      • Serge Massar
        • Error Filtration and Entanglement Purification for Quantum Communication
        • Quantum Gloves
      • Jérémie Roland
        • Noise resistance of adiabatic quantum computation using random matrix theory
    • Other
      • Thomas Durt
        • A new expression for mutually unbiased bases in prime power dimensions
• Brazil
  • Universidade Estadual de Campinas, Sao Paulo - Departamento de Raios Cosmicos e Cronologia, Instituto de Fisica
    • Gustavo Garcia Rigolin
      • Superdense coding using multipartite states
      • Quantum teleportation of an arbitrary two qubit state and its relation to multipartite entanglement
  • Universidade Federal de Minas Gerais - Departamento de Fisica
    • Fernando Brandao
      • Are all maximally entangled states pure?
    • Reinaldo O. Vianna
      • A Robust Semidefinite Programming Approach to the Separability Problem
      • Separable Multipartite Mixed States - Operational Asymptotically Necessary and Sufficient Conditions
      • Witnessed Entanglement
  • Universidade Federal do Rio de Janeiro - Instituto de Fisica
    • Enrique Solano
      • Mesoscopic superpositions of vibronic collective states of N trapped ions
  • Universidade Federal do Rio Grande do Sul - Institute of Informatics
    • Juliana Kaizer Vizzotto
      • Structuring quantum effects: superoperators as arrows
• Bulgaria
  • Sofia University - Faculty of Physics, Quantum Optics and Quantum Information Group
• Canada
  • McGill University - School of Computer Science, Crypto & Quantum Info Lab
    • Patrick Hayden
      • Aspects of generic entanglement
      • Optimal superdense coding of entangled states
  • Perimeter Institute for Theoretical Physics
    • Joseph Emerson
      • MIT Web Page of Joseph Emerson
      • Papers
        • Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
    • Daniel Gottesman
      • A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
      • Encoding a qubit in an oscillator
      • Quantum Digital Signatures
      • Proof of security of quantum key distribution with two-way classical communications
      • Uncloneable Encryption
      • Quantum Error Correction and Fault-Tolerance
  • University of Calgary - Quantum Computing Research Group
    • QIS - Physics
    • People
      • Richard E. Cleve
        • Quantum Fourier transforms for extracting hidden linear structures in finite fields
        • Consequences and Limits of Nonlocal Strategies
      • Shohini Ghose
        • Entanglement vs. the quantum-to-classical transition
      • John Watrous
        • Quantum algorithms for solvable groups
  • University of British Columbia, Vancouver - Department of Physics and Astronomy
    • Ralf Schützhold
      • Pattern recognition on a quantum computer
  • Université de Montreal - Laboratoire d'Informatique Théorique et Quantique
    • Stéphane Beauregard
      • Circuit for Shor's algorithm using 2n+3 qubits
    • Gilles Brassard
      • Quantum Arithmetic on Galois Fields
    • André Allan Méthot
      • Interaction-Free Measurement applied to Quantum Computation: a New CNOT Gate
  • University of Ottawa - Research Group on the Foundations of Computing, Communication, and Cryptography
    • Tomoyuki Yamakami
      • Analysis of Quantum Functions
  • University of Toronto
    • Center for Quantum Information and Quantum Control
      • Daniel Lidar
        • Analysis of Generalized Grover's Quantum Search Algorithms Using Recursion Equations
        • Encoded Universality in Physical Implementations of a Quantum Computer
        • Parafermionic Quantum Computation
        • Qubits as Parafermions
        • An Implementation of the Deutsch-Jozsa Algorithm on Molecular Vibronic Coherences Through Four-Wave Mixing: a Theoretical Study
        • Universal Quantum Computation using Exchange Interactions and Teleportation of Single-Qubit Operations
        • Decoherence-Free Subspaces and Subsystems
        • A Magnetic Resonance Realization of Decoherence-Free Quantum Computation
        • Quantum Computers and Decoherence: Exorcising the Demon from the Machine
        • Exponentially Localized Magnetic Fields for Single-Spin Quantum Logic Gates
        • Long-range entanglement generation via frequent measurements
        • Consistency of the Adiabatic Theorem
        • Robustness of many-qubit entanglement under general decoherence
        • Holonomic quantum computation in decoherence-free subspaces
        • Quantum Malware
      • Lian-Ao Wu
        • Dressed Qubits
    • Department of Computer Science
      • Anya Tafliovich
        • Quantum Predicative Programming
    • Department of Electrical and Computer Engineering
      • Hoi-Kwong Lo
        • Some Attacks On Quantum-based Cryptographic Protocols
        • Why Quantum Information Processing
  • University of Waterloo - Centre for Applied Cryptographic Research
  • University of Waterloo - Institute for Quantum Computing
    • Jonathan Baugh
      • A solid-state NMR three-qubit homonuclear system for quantum information processing: control and characterization
      • Experimental implementation of heat-bath algorithmic cooling using solid-state nuclear magnetic resonance (preprint)
    • Phillip Kaye
      • Quantum Networks for Generating Arbitrary Quantum States
    • David W. Kribs
      • Noiseless subsystems and the structure of the commutant in quantum error correction
      • Noiseless subsystems for collective rotation channels in quantum information theory
      • Operator Quantum Error Correction
    • Raymond Laflamme
      • Physics Homepage
      • Papers
        • Perfect Quantum Error Correcting Code (preprint)
        • NMR Quantum Information Processing and Entanglement
    • Michele Mosca
      • Quantum algorithms revisited
      • Decomposing Finite Abelian Groups
      • Exact quantum Fourier transforms and discrete logarithm algorithms
    • Ashwin Nayak
      • Quantum Walk on the Line
      • Quantum Complexity of Testing Group Commutativity
    • Pranab Sen
      • Lower bounds for predecessor searching in the cell probe model
    • Christof Zalka
      • Other Homepages
        • Bern
        • LANL
      • Papers
        • Comment on "Stable Quantum Computation of Unstable Classical Chaos"
        • Shor's discrete logarithm quantum algorithm for elliptic curves
        • Implementing high dimensional unitary representations of SU(2) on a Quantum Computer
  • University of Winnipeg - Physics Department
    • Gabor Kunstatter
      • Adiabatic Quantum Computation and Deutsch's Algorithm
      • Energy and Efficiency of Adiabatic Quantum Search Algorithms
• China
  • Dalian University of Technology - Department of Physics
    • Chong Li
      • A random quantum key distribution by using Bell states
  • Huazhong University of Science and Technology - Physics Department
    • Ying Wu
      • N-qubit Entanglement Index and Classification
  • Chinese Academy of Sciences, Beijing
    • National Laboratory for Superlattices and Microstructures, Institute of Semiconductors
      • Xin-Qi Li
        • Non-adiabatic geometric quantum computation with trapped ions
    • Institute of Theoretical Physics
      • Chang-Pu Sun
        • On the relative quantum entanglement with respect to tensor product structure
  • Hunan Normal University, Changsha - Department of Physics
    • Hao-Sheng Zeng
      • Implementation of non-local operations for arbitrary high-dimensional systems with qubit quantum channel
  • Lanzhou University - Department of Modern Physics
    • Jun-Hong An
      • Entanglement dynamics of qubits in a common environment
  • Liaoning Normal University, Dalian - Department of Physics
    • Feng Pan
      • Extremal Entanglement For Triqubit Pure States
  • Tsinghua University, Beijing
    • Department of Automation
      • Jian-wu Wu
        • Quantum Fourier Transform in a Decoherence-Free Subspace
    • Department of Computer Science and Technology
      • Zhang Chi
        • Unambiguous discrimination of mixed quantum states
    • Department of Physics
      • Gui Lu Long
        • Grover Algorithm with zero theoretical failure rate
        • Chen and Diao's quantum search algorithm is not exponentially fast
        • Experimental Realization of Brüschweiler's exponentially fast search algorithm in a homo-nuclear system
        • Experimental realization of a fetching algorithm in a 7 qubit NMR quantum computer
    • State Key Laboratory of Intelligent Technology and Systems
      • Ying Mingsheng
        • Semantics of a purely quantum programming language
  • University of Science and Technology of China, Hefei, Anhui
    • Department of Automation
      • Zong-Hai Chen
        • Control of non-controllable quantum systems: A quantum control algorithm based on Grover iteration
    • Department of Modern Physics
      • Jiangfeng Du
        • Experimental Implementation of the Quantum Random-Walk Algorithm
      • Hui Li
        • Experimental Test of the Kochen-Specker Theorem for Single Qubits using Positive Operator-Valued Measures
      • Fei Xue
        • An Architecture of Deterministic Quantum Central Processing Unit
    • The Key Laboratory of Quantum Information, CAS
      • Zheng-Wei Zhou
        • Scalable fault-tolerant quantum computation in DFS blocks
  • Wuhan Institute of Physics and Mathematics
    • Qing-yu Cai
      • Deterministic secure communication protocol without using entanglement
• Colombia
  • Universidad de los Andes, Bogotá - Departamento de Física
    • Jagdish Luthra
      • Negativity and Concurrence as complete entanglement measures for two arbitrary qudits
• Czech Republic
  • Masaryk University, Brno - Faculty of Informatics
    • Jozef Gruska
      • Biographical Summary
      • Book - Quantum Computing
  • Palacky University - Department of Optics
    • Jaroslav Rehacek
      • Invariant information and quantum state estimation
• Denmark
  • University of Aarhus - QUANTOP, Danish Research Foundation Center for Quantum Optics
    • Klaus Moelmer
      • Robust quantum gates and a bus architecture for quantum computing with rare-earth-ion doped crystals
• Europe
  • European Research groups in Quantum Information Science
• Finland
  • Helsinki University of Technology, Materials Physics Laboratory
    • Ville Bergholm
      • Quantum circuit for a direct sum of two-dimensional unitary operators
    • Martti M. Salomaa
      • Realization of Arbitrary Gates in Holonomic Quantum Computation
    • Juha Vartiainen
      • Implementing Shor's algorithm on Josephson Charge Qubits
      • Acceleration of quantum algorithms using three-qubit gates
      • Efficient decomposition of quantum gates
  • University of Turku - Department of Physics, Quantum Optics Group
    • Jyrki Piilo
      • Driven harmonic oscillator as a quantum simulator for open systems
• France
  • CNRS
    • IMAG - Institute d'Informatique et Mathématiques Appliquées de Grenoble
      • Leibniz Laboratory - Equipe QUI: Informatique Quantique
        • Simon Perdrix
          • Measurement-Based Quantum Turing Machines and Questions of Universalities
          • State Transfer instead of Teleportation in Measurement-based Quantum Computation
          • Measurement-Based Quantum Turing Machines and their Universality
          • Classically-Controlled Quantum Computation
        • Philippe Jorrand
          • Separability of pure n-qubit states: two characterizations
        • Marie Lalire
          • Toward a Quantum Process Algebra
          • A Process Algebraic Approach to Concurrent and Distributed Quantum Computation: Operational Semantics
          • A probabilistic branching bisimulation for quantum processes
      • TIMA Laboratory - Techniques of Informatics and Microelectronics for computer Architecture
        • Florin Ciontu
          • Application-Specific Regular Architecture for Quantum Cellular Automata
        • Bernard Courtois
    • Laboratoire Charles Fabry de l'Institut d'Optique, UMR 8501 du CNRS, Orsay - Quantum Optics
      • Philippe Grangier
        • Single photon quantum cryptography
    • LPMO - Laboratoire de Physique et Métrologie des Oscillateurs
      • Michel R. P. Planat
        • Finite Algebraic Geometrical Structures Underlying Mutually Unbiased Quantum Measurements
        • Quantum phase uncertainty in mutually unbiased measurements and Gauss sums
    • Université de Marne-La-Vallée
      • Pablo Arrighi
        • Quantum Computation explained to my Mother
        • Linear-algebraic lambda-calculus
      • Jean-Yves Thibon
        • Algebraic invariants of five qubits
    • Université Paris-Sud, UMR 8623 du CNRS, Laboratoire de Recherce en Informatique
      • Christoph Dürr
        • Quantum query complexity of graph connectivity
      • Julia Kempe
        • A Quantum Random Walk Search Algorithm
        • Quantum random walks - an introductory overview
        • Coins Make Quantum Walks Faster
        • Quantum Color-Coding Is Better
        • Fault-tolerant quantum computation -- a dynamical systems approach
      • Frédéric Magniez
        • Quantum testers for hidden group properties
        • An $O(n^{1.3})$ Quantum Algorithm for the Triangle Problem
    • Université Paul Sabatier, Toulouse, UMR 5626 du CNRS, Quantware MIPS Center - Laboratoire de Physique Quantique
      • Dima Shepelyansky
        • Quantum Computing of Classical Chaos: Smile of the Arnold-Schrodinger Cat
        • Quantum computer inverting time arrow for macroscopic systems
        • Strange attractor simulated on a quantum computer
        • Phase diagram for the Grover algorithm with static imperfections
• Germany
  • A2 Quantum Information Consortium
  • Fraunhofer Quantum Computing Services
    • Helge Rosé
      • The Fraunhofer Quantum Computing Portal - www.qc.fraunhofer.de - A web-based Simulator of Quantum Computing Processes
  • Humboldt Universität zu Berlin - Institut für Physik - Nanooptik
    • Ulrike Herzog
      • Optimum unambiguous discrimination of two mixed quantum states
      • Distinguishing mixed quantum states: Minimum-error discrimination versus optimum unambiguous discrimination
  • Ludwig-Maximilians-Universität München
    • Experimental Quantum Physics
      • Nikolai Kiesel
        • Linear Optics C-Phase gate made simple
        • Experimental Analysis of a 4-Qubit Cluster State
      • Harald Weinfurter
        • Quantum cryptography: A step towards global key distribution
    • Theoretical Physics - Theoretical Quantum Optics and Information
      • Wolfgang Dür
        • Entanglement capabilities of non-local Hamiltonians
        • Entanglement purification for Quantum Computation
        • Separable states can be used to distribute entanglement
  • Max-Planck-Institut für Physik (Werner-Heisenberg-Institut), München
    • Pedro Ruiz Femenia
      • Simulation of many-qubit quantum computation with matrix product states
  • Max-Planck-Institut für Quantenoptik, Garching
    • Theory Division
      • Ignacio Cirac
        • Quantum Computations with Cold Trapped Ions
        • Complete Characterization of a Quantum Process: The Two-Bit Quantum Gate (preprint)
      • Toby Cubitt
        • Entanglement flow in multipartite systems
        • Entanglement in the stabilizer formalism
      • Christine Muschik
        • Entanglement generated by dissipation
      • Markus Popp
        • Localizable Entanglement
      • Juan José García-Ripoll
        • Quantum computation with unknown parameters
      • Klemens Hammerer
        • Characterization of non-local gates
      • Enrique Solano
        • Sequential generation of entangled multi-qubit states
    • Laser Spectroscopy Division
      • T.W. Hänsch
        • Transporting, splitting and merging of atomic ensembles in a chip trap
  • Technical University of Braunschweig - Institute for Mathematical Physics
    • Reinhard F. Werner
      • Why Two Qubits Are Special
  • Technische Universität Darmstadt - Theoretical Quantum Physics Group
    • Gernot Alber
    • Oliver Kern
      • Quantum error correction of coherent errors by randomization
  • Universität Bielefeld, Fakultät für Mathematik - Arbeitsgruppe Information und Komplexität
  • Universität Bonn
    • Dominik Schrader
      • A neutral atom quantum register
  • Universität Erlangen-Nürnberg - Quantum Information Theory (QIT)
    • Philippe Raynal
      • Optimal Unambiguous State Discrimination of two density matrices and its link with the Fidelity
  • Universität Hannover
    • Institut für Quantenoptik
      • Gerhard Birkl
        • Microoptical Realization of Arrays of Selectively Addressable Dipole Traps: A Scalable Configuration for Quantum Computation with Atomic Qubits
    • Institut für Theoretische Elecktrotechnik und Hochfrequenztechnik
      • Kai Pahlke
        • The feasible generation of entangled photon states by using linear optical elements
    • Physics Department - Quantum Information Theory
      • Florian Hulpke
        • A two-way algorithm for the entanglement problem
      • Aditi Sen(De)
        • Common origin of no-cloning and no-deleting principles - Conservation of information
  • Universität Heidelberg
    • Jian-Wai Pan
      • Experimental realization of freely propagating teleported qubits
      • Experimental Demonstration of Five-photon Entanglement and Open-destination Teleportation (preprint)
      • Experimental demonstration of a non-destructive controlled-NOT quantum gate for two independent photon-qubits
      • Experimental Fault-Tolerant Quantum Cryptography in a Decoherence-Free Subspace
  • Universität Kaiserslautern
    • Stefan Heinrich
      • Quantum Summation with an Application to Integration
  • Universität Karlsruhe - Institut für Algorithmen und Kognitive Systeme
    • Thomas Beth
    • Markus Grassl
      • Dagstuhl Seminar: Quantum Algorithms
      • Cyclic Quantum Error-Correcting Codes and Quantum Shift Registers
      • On SIC-POVMs and MUBs in Dimension 6
    • Dominik Janzing
      • Ergodic quantum computing
      • On the Computational Power of Molecular Heat Engines
    • Jörn Müller-Quade
      • Quantum cryptographic three party protocols
    • Rainer Steinwandt
      • Cryptanalysis of a Practical Quantum Key Distribution With Polarization-Entangled Photons
  • Universität Konstanz - Quantum Information Technology
    • Alexander Lvovsky
      • Quantum scissors: teleportation of single-mode optical states by means of a nonlocal single photon
  • Universität Potsdam - Institut für Physik
    • Kim Boström
      • Secure direct communication using entanglement
      • Ping-pong coding
    • Jens Eisert
      • Complete hierarchies of efficient approximations to problems in entanglement theory
  • Universität Rostock - Quantum Optics Group
    • Evgeny Shchukin
      • Inseparability criteria for bipartite quantum states
  • Universität Stuttgart - Physikalisches Institut
    • Fedor Jelezko
      • A two-qubit conditional quantum gate with single spins
  • Universität Ulm - Abteilung für Quantenphysik
    • Holger Mack
      • Wave Packets can Factorize Numbers
• Hungary
  • Budapest University of Technology and Economics
    • Mobile Communications and Computing Laboratory
      • Sándor Imre
        • Papers
          • Maximum Likelihood Based Quantum Set Separation
          • Quantum Computation Based Probability Density Function Estimation
        • Software
          • QDNS - Quantum Designer and Network Simulator
    • Institute of Physics - Department of Theoretical Physics
      • Péter Lévay
        • The twistor geometry of three-qubit entanglement
        • On the geometry of a class of N-qubit entanglement monotones
• India
  • Bhabha Atomic Research Centre
    • Arun Kumar Pati
      • Quantum no-deleting principle and some of its implications
      • General impossible operations in quantum information (preprint)
      • Relative phase change during quantum operation
      • No partial erasure of quantum information
      • Quantum History cannot be Copied
  • Indian Institute of Astrophysics, Bangalore
    • R. Srikanth
      • Securing quantum bit commitment through reverse quantum communication
      • Computable Functions, the Church-Turing Thesis and the Quantum Measurement Problem
  • Indian Institute of Science, Bangalore (IISc)
    • Centre for Theoretical Studies
      • Apoorva Patel
        • Quantum Algorithms and the Genetic Code
        • Quantum Database Search can do without Sorting
        • Testing Quantum Dynamics in Genetic Information Processing
        • Carbon---The First Frontier of Information Processing
        • Information Processing beyond Quantum Computation
        • Quantum Random Walks do not need Coin Toss
    • Department of Computer Science and Automation
      • H. Ramesh
      • V. Sriram
        • String Matching in O(sqrt(n)+sqrt(m)) Quantum Time
    • Department of Physics
      • Anil Kumar
        • Spectral implementation of some quantum algorithms by one- and two-dimensional nuclear magnetic resonance
        • Experimental implementation of local adiabatic evolution algorithms by an NMR quantum information processor
  • Indian Institute of Technology, Bombay
    • P. Ramadevi
      • Quantum Computation of Jones' Polynomials
  • Indian Institute of Technology, Kanpur - Department of Computer Science and Engineering
    • Debabrata Goswami
      • Towards Efficiently Solving Quantum Traveling Salesman Problem
  • Indian Statistical Institute, Calcutta - Applied Statistics Unit
    • Subhamoy Maitra
      • Deutsch-Jozsa Algorithm Revisited in the Domain of Cryptographically Significant Boolean Functions
      • Quantum algorithm to distinguish Boolean functions of different weights
  • Institute for Mathematical Sciences, Chennai
    • Hari Dass
      • Perfect cloning of harmonic oscillator coherent states is possible
  • Jaypee Institute of Information Technology
    • Anirban Pathak
      • Quantum Floyd-Warshall Alorithm
  • Physical Research Laboratory, Navrangpura, Ahmedabad - Quantum Optics and Quantum Information Division
    • Prasanta K. Panigrahi
      • Non-destructive Orthonormal State Discrimination
  • Tata Institute of Fundamental Research - School of Technology and Computer Science
    • Jaikumar Radhakrishnan
      • Is partial quantum search of a database any easier?
• Iran
  • Institute for Research in Fundamental Sciences - School of Physics
    • Mohammad Ali Jafarizadeh
      • The minimum-error discrimination via Helstrom family of ensembles and Convex Optimization
• Israel
  • Hebrew University of Jerusalem
    • Philosophy
      • Itamar Pitowsky
        • The Number of Elements in a Subset: A Grover-Kronecker Quantum Algorithm
    • School of Computer Science and Engineering
      • Dorit Aharonov
        • Quantum Circuits with Mixed States
        • Review of Quantum Computation
        • Quantum NP - A Survey
        • Adiabatic Quantum State Generation and Statistical Zero Knowledge
        • A Simple Proof that Toffoli and Hadamard are Quantum Universal
  • Technion - Computer Science Department
    • Dan Kenigsberg
      • Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State
      • Quantum Advantage without Entanglement
  • Tel Aviv University
    • Department of High Energy Physics
      • Yakir Aharonov
        • The mean king's problem: Prime degrees of freedom
        • Quantum Error Correction in the Zeno Regime
    • The School of Computer Science
      • Oded Regev
        • Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
        • A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space
• Italy
  • Centro Interdipartimentale Vito Volterra, Universita di Roma Tor Vergata
    • Luigi Accardi
      • A Generalization of Grover's Algorithm
  • Free University of Bozen, Bolzano - Faculty of Computer Science
    • Paolo Zuliani
      • Oxford Homepage
      • Papers
        • Quantum Programming
        • Logical reversibility
        • Formal reasoning for quantum mechanical nonlocality
  • ICTP - The Abdus Salam International Centre for Theoretical Physics, Trieste
    • Giancarlo Ghirardi
      • Criteria for the entanglement of composite systems of identical particles
  • International School for Advanced Studies (SISSA), Trieste - Condensed Matter Sector
    • Giuseppe Santoro
      • Quantum annealing of the Traveling Salesman Problem
    • Lorenzo Stella
      • Optimization by Quantum Annealing: Lessons from Simple Cases
  • IRST - Discussion Group on Quantum Computing
    • Luciano Serafini
  • ISI, Torino
    • Paolo Zanardi
      • Semiconductor-based Geometrical Quantum Gates
      • Non-adiabatic geometrical quantum gates in semiconductor quantum dots
      • Universal control of quantum subspaces and subsystems
      • Universal quantum control in irreducible state-space sectors: application to bosonic and spin-boson systems
      • Geometric quantum computation and multi-qubit entanglement with superconducting charge qubits inside a cavity
  • Politecnico Di Milano - Dipartimento Di Matematica
    • Alberto Barchielli
      • Instruments and channels in quantum information theory
  • Università di Pavia, Dipartimento di Fisica "A.Volta" - Quantum Information Theory Group
    • Giacomo Mauro D'Ariano
      • The quantum bit commitment: a finite open system approach for a complete classification of protocols
      • The quantum bit commitment: a complete classification of protocols
      • Optimal phase estimation for qubit mixed states
      • Clean Positive Operator Valued Measures
  • Università di Pisa - Dipartimento di Informatica
    • Alessandra Di Pierro
      • Quantum Constraint Programming
  • Università di Salerno - Dipartimento di Fisica, Quantum Information and Quantum Optics
    • Fabrizio Illuminati
      • Engineering massive quantum memories by topologically time-modulated spin rings
  • University of Padova - Department of Information Engineering
    • Antonio Assalini
      • Efficient Optimal Minimum Error Discrimination of Symmetric Quantum States
  • University of Rome "La Sapienza", Physics Department - Quantum Optics Group
    • Gianluca Giorgi
      • Teleportation on a quantum dot array
    • Francesco De Martini
      • Pauli Tomography: complete characterization of a single qubit device
      • Teleportation scheme implementing contextually the Universal Optimal Quantum Cloning Machine and the Universal Not Gate. Complete experimental realization
• Japan
  • Communications Research Laboratory, Koganei, Tokyo
    • Masahide Sasaki
      • Quantum learning and universal quantum matching machine
  • ERATO Project - Quantum Computation & Information
    • Keiji Matsumoto
      • General-Purpose Parallel Simulator for Quantum Computing
  • Fakui University - Department of Applied Physics
    • Akihisa Hayashi
      • Extended Quantum Color Coding
  • Hiroshima University
    • Graduate School of Advanced Sciences of Matter
      • Holger F. Hofmann
        • Homepage at Hokkaido University
        • Quantum parallelism of the controlled-NOT operation: an experimental criterion for the evaluation of device performance
        • Efficient tests for experimental quantum gates
    • Department of Quantum Matter
      • Takahiro Murakami
        • Pulse Control of Decoherence with Population Decay
  • Keio University - Internet Research Lab
    • Rod Van Meter
      • A Layered Architecture for Quantum Computing Using Quantum Dots
      • Surface code quantum communication
      • Updating Quantum Cryptography Report ver. 1
      • Fast Quantum Modular Exponentiation
  • Kyoto University, Graduate School of Informatics - Logic Circuits, Algorithms and Complexity Theory (IWAMA Lab.)
    • Rudy Raymond Harry Putra
      • Robust Quantum Algorithms for Oracle Identification
    • Akinori Kawachi
      • Quantum Identification of Boolean Oracles
  • Nagoya University - CREST, Japan Science and Technology, Graduate School of Human Informatics
    • Harumichi Nishimura
      • Quantum subroutine problem and the robustness of quantum complexity classes
  • NTT Basic Research Laboratories
    • Go Kato
      • Grover like Operator Using Only Single-Qubit Gates
  • Research Organization for Information Science and Technology (RIST), Tokyo
    • Atsushi Miyauchi
      • Linear Order Matrix Inversion Method with Help from Quantum Searching Algorithm
  • Tamagawa University - Research Center for Quantum Information Science
    • Hiroo Azuma
      • Higher order perturbation theory for decoherence in Grover's algorithm
  • The Institute of Physical and Chemical Research (RIKEN), Wako, Saitama - Frontier Research System
    • Yu. A. Pashkin
      • Quantum oscillations in two coupled charge qubits
    • Lianfu F. Wei
      • Effects of dynamical phases in Shor's factoring algorithm with operational delays
      • Coupling Josephson qubits via a current-biased information bus
  • Tokyo Univeristy of Science - Department of Information Sciences
    • Masanori Ohya
      • Quantum Algorithm for SAT Problem and Quantum Mutual Entropy
      • New Scheme of Quantum Teleportation
  • Univeristy of Tokyo
    • Department of Basic Physics - Shimizu Lab.
      • Akira Shimizu
        • Appearance and Stability of Anomalously Fluctuating States in Shor's Factoring Algorithm
    • Graduate School of Science, Department of Physics - Wadati Group
      • Miki Wadati
        • Geometric Strategy for the Optimal Quantum Search
      • Akimasa Miyake
        • Classification of multipartite entangled states by multidimensional determinants
    • Department of Information Science - Imai Laboratory
      • Jumpei Niwa
        • General-purpose parallel simulator for quantum computing (preprint)
        • Simulating the Effects of Quantum Error-correction Schemes
    • Institute of Industrial Science - Imai Laboratory, Communication & Security
      • Hideki Imai
        • Non stabilizer Clifford codes with qupits
  • Yokohama National University - Department of Applied Mathematics
    • Kazuyuki Fujii
      • Introduction to Grassmann manifolds and quantum computation
      • Jarlskog's Parametrization of Unitary Matrices and Qudit Theory
    • Norio Konno
      • From Quantum to Classical Random Walks
      • Continuous-Time Quantum Walk on the Line
• Korea
  • KAIST - Korea Advanced Institute of Science and Technology
    • Jaehyun Kim
      • Storing unitary operators in quantum states
  • Kyung Hee University, Seoul - Department of Mathematics and Research Institute for Basic Sciences
    • Soojoon Lee
      • Quantum algorithms without initializing the auxiliary qubits
• Latvia
  • University of Latvia
    • Andris Ambainis
      • New Developments in Quantum Algorithms
      • Small Pseudo-Random Families of Matrices: Derandomizing Approximate Quantum Encryption
      • Quantum walk algorithm for element distinctness
      • Cryptographic Randomized Response Techniques
      • Quantum lower bounds by quantum arguments
    • Rusins Freivalds
      • Quantum finite multitape automata
    • Abuzer Yakaryilmaz
      • Quantum computation with devices whose contents are never read
• Netherlands
  • CWI
    • Robert Spalek
      • Old homepage
      • Papers
        • Quantum Verification of Matrix Products
    • Ronald de Wolf
      • Quantum Lower Bounds by Polynomials
      • Quantum Search on Bounded-Error Inputs
  • Delft University of Technology - Kavli Institute of NanoScience
    • Quantum Transport
      • Lieven Vandersypen
        • Stanford Web page
        • Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
        • Experimental Quantum Computation with Nuclear Spins in Liquid Solution
        • Quantum Computing with Electron Spins in Quantum Dots
    • Theoretical Physics
      • Miriam Blaauboer
        • Detecting entanglement using a double quantum dot turnstile
  • Radboud University of Nijmegen - Institute for Molecules and Materials
    • Salah Hamieh
      • Quantum entanglement dynamics and decoherence wave in spin chains at finite temperatures
  • University of Groningen - Computational Physics
    • Papers
      • H. De Raedt
        • Quantum Computer Emulator
        • On the Problem of Programming Quantum Computers
        • Decoherence in quantum spin systems
        • Computational Methods for Simulating Quantum Computers
        • Simulation of Quantum Computation: A deterministic event-based approach
      • Kristel Michielsen
        • Programming physical realizations of quantum computers
        • Number Partitioning on a Quantum Computer
    • QCE - Quantum Computer Emulator
    • Quick Tour of Computational Physics
  • University of Leiden
    • Mathematical Institute
      • Hermen Jan Hupkes
        • Unconditional Security of Practical Quantum Key Distributionj
    • Instituut-Lorenz
      • C.W.J. Beenakker
        • Charge Detection Enables Free-Electron Quantum Computation (preprint)
  • Universiteit van Amsterdam - Atomic and Laser Physics Group
    • Robert Spreeuw
      • Implementation of quantum search algorithm using classical Fourier optics
  • Vrije Universiteit Amsterdam - Theoretical Computer Science
    • Tereza Tusarova
      • Quantum Complexity Classes
• New Zealand
  • University of Auckland - Centre for Discrete Mathematics and Theoretical Computer Science
    • Cristian S. Calude
      • Coins, Quantum Measurements, and Turing's Barrier
      • From Heisenberg to Goedel via Chaitin
    • Michael A. Stay
      • Inexpensive Linear-Optical Implementations of Deutsch's Algorithm
      • Stuff I've put online that I later realized was wrong
        • Artificial Orbitals and a Solution to Grover's Problem
        • A New Formulation of Grover's Algorithm
• Poland
  • Adam Mickiewicz University - Faculty of Physics
    • Antoni Wojcik
      • How to encode the states of two non-entangled qubits in one qutrit?
  • Polish Academy of Sciences, Gliwice - Institute of Theoretical and Applied Informatics
    • Publications
      • E.G.Beltrametti
        • Correlations and entanglement in probability theory
      • Jaroslaw Miszczak
        • On entanglement at tripartite states
        • Numerical simulations of mixed states quantum computation
        • Quantum Implementation of Parrondo Paradox
    • Software
      • quantum-octave: a set of GNU Octave functions for doing quick-and-dirty simulations of quantum computers
  • Technical University of Gdansk - Department of Theoretical and Mathematical Physics
    • Pawel Horodecki
      • Direct detection of quantum entanglement
      • How to measure amount of entanglement contained in unknown state
  • University of Gdansk - Institute of Theoretical Physics and Astrophysics
    • Robert Alicki
      • Quantum error correction fails for Hamiltonian models
  • Uniwersytet Slaski (University of Silesia) - Econophysics
    • Jan Sladkowski
      • Quantum computer: an appliance for playing market games
• Romania
  • Institute of Physics and Nuclear Engineering, Bucharest
    • Petre Dita
      • New results on the parametrisation of complex Hadamard matrices
• Russia
  • Joint Institute for Nuclear Research, Dubna
    • Mikhail Altaisky
      • Genetic information and quantum gas
  • Federal Radiological Center (IRH), St. Petersburg
    • Alexander Yu. Vlasov
      • Quantum Computations and Images Recognition
      • Clifford algebras and universal sets of quantum gates
      • Clifford algebras noncommutative tori and universal quantum computers
      • Algebras and universal quantum computations with higher dimensional systems
      • Quantum Processors and Controllers
      • Stairway Quantum Computer
      • Programmable Quantum Networks with Pure States
  • Moscow State Institute of Electronics and Mathematics
    • Guennadi A. Kouzaev
      • Qubit logic modeling by electronic circuits and electromagnetic signals
  • Moscow State University - Skobeltzyn Institute of Nuclear Physics
    • Vasily E. Tarasov
      • Quantum Computation by Quantum Operations on Mixed States
  • Steklov Mathematical Institute, Russian Academy of Sciences, Moscow
    • Igor V. Volovich
      • Quantum Information and Spacetime Structure
  • Wave Research Center at General Physics Institute of RAS, Moscow
    • Ranjit Singh
      • Kronecker product/Direct product/Tensor product in Quantum Information theory
• Singapore
  • National University of Singapore - Centre for Quantum Technologies
    • Valerio Scarani
      • Towards practical and fast Quantum Cryptography
      • Entanglement and non-locality are different resources
      • The Security of Practical Quantum Key Distribution
• Slovakia
  • Comenius University, Bratislava - Department of Theoretical Physics
    • Vlado Cerny
      • Quantum computers and intractable (NP-complete) computing problems
• South Africa
  • University of KwaZulu-Natal, Durban - School of Pure and Applied Physics
    • Sabrina Maniscalco
      • Papers
        • Limits in the quantum characteristic function description of open quantum systems
        • Revealing virtual processes in the phase space
        • Non-Markovian dynamics of a qubit
      • Talks
        • Quantum Computing Popular Lecture Series
  • University of Stellenbosch - Physics Department
    • Robert H. Schumann
      • Quantum Information Theory -Masters Thesis
• Spain
  • Universidad Complutense de Madrid (UCM) - Grupo de Informacióny Computación Cuánticas
    • Alberto Galindo Tixaire
      • A Family of Grover's Quantum Searching Algorithms
    • Miguel Angel Martín-Delgado
      • Topological Computation without Braiding
  • University of Barcelona - High Energy Physics Department, QI-BCN group
    • José Ignacio Latorre
      • Systematic Analysis of Majorization in Quantum Algorithms
  • Universidad Complutense, Madrid - Departamento de Física Teórica I
    • Miguel Angel Martin-Delgado
      • Entanglement Distillation Protocols and Number Theory
  • Universidad de Sevilla - Departamento de Fisica Aplicada II
    • Adan Cabello
      • Solving the liar detection problem using the four-qubit singlet state
  • Universidad Politécnica de Madrid
    • Departamento Física Aplicada a las Tecnologías de la Información
      • Angel Luis Sanz Saenz
        • Numerical Simulation of Decoherence-control Processes in Quantum Computers
        • Numerical simulation of information recovery in quantum computers
        • Error threshold estimation by means of the [[7,1,3]] CSS quantum code
    • Departamento de Tecnologías Especiales Aplicadas a la Telecomunicación
      • Pedro Jesus Salas
        • Effect of ancilla's structure on quantum error correction using the 7-qubit Calderbank-Shor-Steane code
• Sweden
  • KTH - Royal Institute of Technology, Stockholm - Quantum Electronics and Quantum Optics
    • Hoshang Heydari
      • Schwarz inequality and concurrence
      • Entanglement monotone for multi-qubit states based on geometric invariant theory
    • José-Luis Romero
      • On the structure of the sets of mutually unbiased bases for N qubits
  • Linköpings universitet - Matematiska Institutionen
    • Jan-Ake Larsson
      • A Practical Trojan Horse for Bell-inequality-based Quantum Cryptography
  • Stockholm University - Physics Department
    • Asa Ericsson
      • Geodesics and the best measurement for distinguishing quantum states
• Switzerland
  • InfoCodex S.A.
    • Carlo A. Trugenberger
      • Phase Transitions in Quantum Pattern Recognition
      • Quantum Pattern Recognition
  • University of Basel, Department of Physics and Astronomy - Condensed Matter Theory
    • Guido Burkard
      • Spintronics and Quantum Dots for Quantum Computing and Quantum Communication
    • Daniel Loss
    • Florian Meier
      • Homepage at Technische Universität München
      • Quantum computing with antiferromagnetic spin clusters
    • John Schliemann
      • Entanglement in SU(2)-invariant quantum systems: The PPT criterion and others
  • University of Geneva - GAP Optique
    • Antonio Acin
      • Equivalence between two-qubit entanglement and secure key distribution
    • Nicolas Gisin
      • Spin flips and quantum information for anti-parallel spins
      • A Quantum solution to the Byzantine agreement problem
      • Long-distance teleportation of qubits at telecommunication wavelengths
      • Quantum key distribution over 30km of standard fiber using energy-time entangled photon pairs: a comparison of two chromatic dispersion reduction methods
    • Gregoire Ribordy
      • Quantum Key Distribution over 67 km with a plug & play system
    • Hugues de Riedmatten
      • Long distance quantum teleportation in a quantum relay configuration
    • Wolfgang Tittel
      • Quantum Cryptography
• Taiwan
  • National Chiao Tung University, Hsinchu - Institute and Department of Electrophysics
    • Che-Ming Li
      • A General SU(2) Formulation for Quantum Searching with Certainty
      • Hamiltonian and measuring time for the quantum search with certainty
      • Formulation of a Family of Sure-Success Quantum Search Algorithms
  • National Cheng Kung University, Tainan
    • Chi-Chuan Hwang
      • A General Phase Matching Condition for Quantum Searching Algorithm
  • National Sun Yat-Sen University - Department of Chemistry
    • Shangwu Ding
      • Quantum Computation Based on Magic-Angle-Spinning Solid State Nuclear Magnetic Resonance Spectroscopy
  • National Taiwan University - Department of Physics
    • Yih-Yuh Chen
      • Faster Database search in Quantum Compputing
  • National Tsing Hua University - Department of Physics
    • Pochung Chen
      • Continuous Dynamical Decoupling with Bounded Controls
• Turkey
  • Bilkent University, Ankara - Electrical-Electronics Engineering Department
    • Erdal Arikan
      • An information-theoretic analysis of Grover's algorithm
• United Kingdom
  • Hewlett Packard Laboratories Bristol - Quantum Information Processing Group
    • Pieter Kok
      • Suitability versus fidelity for rating single-photon guns
      • Efficient high-fidelity quantum computation using matter qubits and linear optics (preprint)
    • Bill Munro
      • Inferring superposition and entanglement from measurements in a single basis
  • Imperial College
    • Department of Computing
      • A Brief History of Quantum Computing
      • Herbert Wiklicky
      • Iain Stewart's Quantum Computing Page
      • Quantum Information Theory and Applications to Quantum Cryptography
    • Department of Mathematics - Geometry Group
      • Henrique Nogueira de Sa Earp
        • Papers
          • A constructive algorithm for the Cartan decomposition of SU(2^N)
        • Software
          • Matlab code that performs the Kaneja-Glaser decomposition
    • Quantum Optics and Quantum Information Theory Group
      • Almut Beige
        • Secure communication with single-photon two-qubit states
        • Secure communication with a publicly known key
        • Repeat-Until-Success Quantum Computing
      • Dan Browne
        • Resource-efficient linear optical quantum computation
      • Koji Maruyama
        • Thermodynamical Cost of Accessing Quantum Information
      • Gary McConnel
        • Notes on the Bloch sphere
      • Stephen Parker
        • Steve's 'no cliches' quantum page
        • Entanglement Simulations of Shor's Algorithm
      • Martin Plenio
        • Broken Promises and Quantum Algorithms
      • Terry Rudolph
        • Homepage
        • Papers
          • Quantum searching a classical database (or how we learned to stop worrying and love the bomb)
          • Constructing physically intuitive graph invariants
          • Creating superpositions that correspond to efficiently integrable probability distributions
          • A 2 rebit gate universal for quantum computing
  • NUI Maynooth - Department of Mathematical Physics
    • Anthony Chefles
      • Entangling capacity and distinguishability of two-qubit unitary operators
  • Open University - Quantum Processes Group
    • Allan Solomon
      • Robust quantum memory via quantum control
  • Queen's University, Belfast - Theoretical and Computational Physics Research Division
    • Myungshik Kim
      • Entanglement induced by a single-mode heat environment
      • Operationally Invariant Measure of the Distance between Quantum States by Complementary Measurements
      • Quantum information processing with noisy cluster states
  • Royal Holloway, University of London - Department of Mathematics, Quantum Dynamics Group
    • Andrei Soklakov
      • State preparation based on Grover's algorithm in the presence of global information about the state
  • Univeristy of Birmingham - School of Computer Science
    • Ahmed Younes
      • A Hybrid Quantum Search Engine: A Fast Quantum Algorithm for Multiple Matches
      • Quantum Searching via Entanglement and Partial Diffusion
  • University College London - Quantum information theory group
    • Christopher Hadley
      • Entanglement creation and distribution on a graph of exchange-coupled qutrits
  • University of Bristol
    • Center for Quantum Photonics
    • Quantum Computation and Information Group
      • Department of Computer Science
        • Richard Jozsa
          • Counterfactual Computation
          • On the role of entanglement in quantum computational speed-up
          • Notes on Hallgren's efficient quantum algorithm for solving Pell's equation
          • Entanglement cost of generalised measurements
          • Illustrating the concept of quantum information
          • An introduction to measurement based quantum computation
        • Dan Shepherd
          • On the Role of Hadamard Gates in Quantum Circuits
      • Department of Mathematics
        • Nick Jones
          • The Extent of Multi-particle Quantum Non-locality
        • Noah Linden
          • The power of reduced quantum states
          • Parts of Quantum States
        • Lluis Masanes
          • All entangled states are useful for information processing
        • Andreas Winter
          • On the quantum, classical and total amount of correlations in a quantum state
      • Department of Physics
        • Berry Groisman
          • On the entanglement concentration of three-partite states
        • Sandu Popescu
          • BRIMS
            • Homepage at BRIMS
          • Teleportation of Entangled States of a Vacuum-One Photon Qubit
  • University of Cambridge
    • Cavendish Laboratory, Theory of Condensed Matter
      • Yu Shi
        • Remarks on Universal Quantum Computer
    • Centre for Quantum Computation
      • Department of Applied Mathematics & Theoretical Physics (DAMTP)
        • Angelo Carollo
          • Holonomic Quantum Computation
        • Matthias Christandl
          • A Generic Security Proof for Quantum Key Distribution
        • Artur Ekert
          • Basic concepts in quantum computation
          • Direct estimations of linear and non-linear functionals of a quantum state
        • Alastair Kay
          • Graph State Preparation and Cluster Computation with Global Addressing of Optical Lattices
        • Jonathan Oppenheim
          • A new type of complementarity between quantum and classical information
          • Local versus non-local information in quantum information theory: formalism and phenomena
          • Partial quantum information (preprint)
        • Jiannis K. Pachos
          • Quantum computation in optical lattices via global laser addressing
    • Computer Laboratory
      • Ben Travaglione
        • Phase estimation as a quantum nondemolition measurement
        • ROM-based computation: quantum versus classical
  • University of Glasgow - Department of Computing Science
    • Simon Gay
      • Communicating Quantum Processes
  • University of Kent - Computer Science
    • Julia Wallace
      • Quantum Computer Software
      • A Quantum Algorithm for Route Finding
  • University of Leeds - Quantum Information Group
    • Viv Kendon
      • Typical entanglement in multi-qubit systems
      • Bounds on entanglement in qudit subsystems (preprint)
      • Quantum walks on general graphs
      • Complementarity and quantum walks
      • Entanglement and its Role in Shor's Algorithm
      • Entanglement in coined quantum walks on regular graphs
    • Vlatko Vedral
      • Lectures
        • Lectures on Foundations of Quantum Information Theory
        • Thermodynamical Quantum Information Sharing
      • Papers
        • On the Power of Quantum Oracles
  • University of Newcastle - Mathematics and Statistics
    • Andrew Duncan
      • Quantum algorithms in group theory
      • Extending the Promise of the Deutsch--Jozsa--Hoyer Algorithm for Finite Groups
  • University of Nottingham - School of Computer Science & IT
    • Jonathan Grattage
      • A functional quantum programming language
  • University of Oxford
    • Centre for Quantum Computation
      • Simon Benjamin
        • Simple Pulses for Universal Quantum Computation with a Heisenberg ABAB Chain
        • A Processor Core Model for Quantum Computing
      • Dik Bouwmeester
        • Experimental quantum teleportation
      • Garry Bowen
        • Quantum feedback channels
      • David Deutsch
        • Quantum theory, the Church-Turing principle and the universal quantum computer
      • Ivette Fuentes-Schuller
        • Alice falls into a black hole: Entanglement in non-inertial frames
      • Lucien Hardy
        • Nonlinear Qubit Transformations
      • Jonathan Jones
        • Homepage at Physical & Theoretical Chemistry Laboratory
        • NMR Quantum Computers
          • Implementation of a Quantum Algorithm to Solve Deutsch's Problem on a Nuclear Magnetic Resonance Quantum Computer
      • Michele Mosca
        • The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
      • Andrew Steane
        • Quantum Computing - fairly lengthy review paper
          • The abstract and introduction
        • A fast fault-tolerant filter for quantum codewords
        • Quantum computer architecture for fast entropy extraction
        • Quantum Computing and Error Correction
        • How to build a 300 bit, 1 Gop quantum computer
      • Salvador Elias Venegas-Andraca
        • Storing Images in Entangled Quantum Systems
    • Clarendon Laboratory
      • Uwe Dorner
        • Quantum logic via optimal control in holographic dipole traps
    • Oxford University Computing Laboratory
      • Samson Abramsky
        • A categorical semantics of quantum protocols
      • Elham Kashefi
        • On the Complexity of Quantum Languages
  • University of Southampton - Quantum Technology Centre
    • Michael Butler
      • Reasoning about Grover's Quantum Search Algorithm using Probabilistic wp
    • Tony Hey
      • Quantum Computing Research
      • Quantum Computing: An Introduction
      • Notes on Quantum Computing
    • Douglas Ross
      • A Modification of Grover's Algorithm as a Fast Database Search
  • University of Wales, Bangor
    • Samuel L. Braunstein
      • Quantum Computation: A Tutorial
      • Speed-up and entanglement in quantum searching
      • Deutsch-Jozsa algorithm for continuous variables
  • University of Warwick - Department of Computer Science
    • Rajagopal Nagarajan
      • Formal Verification of Quantum Protocols
      • On Feedback and the Classical Capacity of a Noisy Quantum Channel
      • Probabilistic Model--Checking of Quantum Protocols
    • Nikolaos K. Papanikolaou
      • An Automated Analysis of the Security of Quantum Key Distribution
    • Caroline Rogers
      • The Second Quantized Quantum Turing Machine and Kolmogorov Complexity
  • University of York
    • Department of Mathematics
      • Simone Severini
        • Entangling Power of Permutations
      • Stefan Weigert
        • Old homepage at Hull
        • Papers
          • Simple Minimal Informationally Complete Measurements for Qudits
• Uraguay
  • Universisdad de la Republica, Montevideo - Instituto de Fisica
    • Adriana Auyuanet
      • Quantum search with resonances
• USA
  • Air Force Research Laboratory, Massachusetts
    • Jeffrey Yepez
      • An efficient and accurate quantum algorithm for the Dirac equation
  • Argonne - Theoretical Physics
    • Paul A. Benioff
      • The Representation of Numbers in Quantum Mechanics
      • Efficient Implementation and the Product State Representation of Numbers
      • Space Searches with a Quantum Robot
  • BBN Technologies
    • Chip Elliott
      • Building the quantum network
      • Quantum Cryptography in Practice
      • On the Optimal Mean Photon Number for Quantum Cryptography
  • Bell Labs
    • Steven J. van Enk
      • Unambiguous State Discrimination of Coherent States with Linear Optics: Application to Quantum Cryptography
      • Quantum communication protocols using the vacuum
      • Reference frames and refbits
      • |0>|1>+|1>|0>
    • Lov K. Grover
      • A fast quantum mechanical algorithm for database search
      • Article in ``The Sciences'' Jul/Aug 1999
      • What's a Quantum Phone Book? - Bell Labs innovations article
      • From Schrödinger's Equation to the Quantum Search Algorithm
      • From Coupled Pendulums to Quantum Search
      • An Improved Quantum Scheduling Algorithm
      • A different kind of quantum search
      • Quantum searching amidst uncertainty
  • Boston Univeristy
    • Department of Electrical and Computer Engineering
      • Tommaso Toffoli
        • Operation Time of Quantum Gates
    • Quantum Imaging Laboratory
      • Ayman Abouraddy
        • Degree of entanglement for two qubits
      • Gregg Jaeger
        • Bell Gems: the Bell basis generalized
      • Alexander Sergienko
        • One-Way Entangled-Photon Autocompensating Quantum Cryptography
  • Caltech
    • Digital Life Laboratory
      • Chris Adami
        • A Random Matrix Model of Adiabatic Quantum Computing
    • Institute for Quantum Information
      • Panos Aliferis
        • Fault-tolerant quantum computation in the graph-state model
      • Andrew Childs
        • An example of the difference between quantum and classical random walks
        • Exponential algorithmic speedup by quantum walk
        • Quantum algorithm for a generalized hidden shift problem
      • Andrew C. Doherty
        • A complete family of separability criteria
      • Alexei Kitaev
        • Universal Quantum Computation Based on a Magic States Distillation
      • Debbie W. Leung
        • Optimal simulation of two-qubit Hamiltonians using general local operations
        • Simulation and reversal of n-qubit Hamiltonians using Hadamard matrices
        • Two-qubit Projective Measurements are Universal for Quantum Computation
        • Oblivious remote state preparation
        • On the capacities of bipartite Hamiltonians and unitary gates
        • Quantum computation by measurements
        • Unified derivations of measurement-based schemes for quantum computation
      • Hideo Mabuchi
        • MabuchiLab
        • Exact Performance of Concatenated Quantum Codes
        • Feedback control of quantum state reduction
      • John Preskill
        • QUIC Theory
        • Course on Quantum Information and Computation
        • Talk on the future of quantum information science
        • Topological quantum memory
        • Quantum accuracy threshold for concatenated distance-3 codes
      • Robert Raußendorf
        • Old homepage at Universität München
        • Papers
          • Quantum Computing via Measurements Only
          • A One-Way Quantum Computer
          • The one-way quantum computer - a non-network model of quantum computation
          • Measurement-based quantum computation with cluster states
          • Quantum computation via translation-invariant operations on a chain of qubits
      • Guifre Vidal
        • Old Homepage at Innsbruck
        • Papers
          • Optimal distillation of a GHZ state
          • Catalysis in non--local quantum operations
          • Simulation of quantum dynamics with quantum optical systems
          • A universal quantum circuit for two-qubit transformations with three CNOT gates
          • Efficient simulation of one-dimensional quantum many-body systems
      • Pawel Wocjan
        • The 2-local Hamiltonian problem encompasses NP
        • New Construction of Mutually Unbiased Bases in Square Dimensions
        • Characterization of combinatorically independent permutation separability criteria
    • Quantum Optics Group
      • Jeff Kimble
        • Quantum teleportation of light beams
        • Comment on "Deterministic Single-Photon Source for Distributed Quantum Networking" by Kuhn, Hennrich, and Rempe
  • Carnegie Mellon University - Department of Physics, Quantum Theory Group
    • David Collins
      • Modified Grover's algorithm for an expectation value quantum computer
      • Shortening Grover's search algorithm for an expectation value quantum computer
    • Robert B. Griffiths
      • The Nature and Location of Quantum Information
  • City University of New York (CUNY), Hunter College - Department of Physics and Astronomy
    • János A. Bergou
      • Discrimination of quantum states
    • Mark Hillery
      • Quantum filtering of Boolean functions
      • Quantum walks based on an interferometric analogy
  • Clarkson University - Center for Quantum Device Technology
    • Vladimir Privman
      • Semiconductor quantum computer design with 100 nm separation of nuclear-spin qubits
  • Clark University - Carlson School of Chemistry and Biochemistry
    • Rafael P. Brüschweiler
      • Novel Strategy for Database Searching in Spin Liouville Space by NMR Ensemble Computing
  • Columbia University, New York
    • Department of Computer Science
      • Krysta Svore
        • Local Fault-tolerant Quantum Computation
        • A Layered Software Architecture for Quantum Computing Design Tools
      • Joseph F. Traub
        • Path Integration on a Quantum Computer
    • Department of Mathematics
      • Alp Atici
        • Comparative Computational Strength of Quantum Oracles
  • Cornell - Laboratory of Atomic and Solid State Physics
    • N. David Mermin
      • Lecture Notes on Quantum Computation
      • Papers
        • From Classical State-Swapping to Quantum Teleportation
        • Deconstructing Dense Coding
        • From Cbits to Qbits: Teaching computer scientists quantum mechanics
        • Copenhagen Computation: How I Learned to Stop Worrying and Love Bohr
  • Dartmouth College, Hanover, New Hampshire - Department of Physics
    • Walter E. Lawrence (Jay Lawrence)
      • Mutually Unbiased Bases and Trinary Operator Sets for N Qutrits
    • Lorenza Viola
      • Randomized control of open quantum systems
      • Entanglement beyond subsystems
  • Davidson College - Physics Department
    • Susan L. Fischer
      • Ions in Electromagnetic Traps
  • D-Wave
    • Publications
      • Quantum annealing with manufactured spins
      • Investigating the Performance of an Adiabatic Quantum Optimization Processor
      • Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
      • A scalable control system for a superconducting adiabatic quantum optimization processor
  • Florida A&M University - Florida State University - Department of Electrical & Computer Engineering
    • Michael P. Frank
      • Interpreting Energy as the Rate of Quantum Computation
  • Florida State University, Tallahassee - Department of Physics
    • Nicholas E. Bonesteel
      • Universal Quantum Computation through Control of Spin-Orbit Coupling
      • Braid Topologies for Quantum Computation
  • Georgia Institute of Technology - School of Physics
    • David Finkelstein
      • Quantum-Statistical Annealing Computation
      • Quantum ground-mode computation with static gates
    • Quantum Optics
      • Alex Kuzmich
        • Storage and retrieval of single photons transmitted between remote quantum memories (preprint)
  • Harvard University - Department of Physics
    • Stephen Blaha
      • Quantum Computers and Quantum Computer Languages: Quantum Assembly Language and Quantum C Language
    • Hans-Andreas Engel
      • Fermionic Bell-State Analyzer for Spin Qubits
    • Mikhail Lukin
      • Electromagnetically induced transparency with tunable single-photon pulses
    • Jon E. Tyson
      • Schmidt decomposition of the quantum Fourier transform on C^N1 tensor C^N2
      • Operator-Schmidt decompositions and the Fourier transform, with applications to the operator-Schmidt numbers of unitaries
  • IBM Almaden Research Center
    • Press Releases
      • IBM-Led Team Unveils Most-Advanced Quantum Computer
      • IBM's 7-qubit molecule
  • IBM Watson Research Center, Yorktown
    • Charles H. Bennett
      • Quantum Cryptography: Public Key Distribution and Coin Tossing
      • Quantum Teleportation
      • Mixed State Entanglement and Quantum Error Correction
    • D. Coppersmith
      • An approximate Fourier transform useful in quantum factoring
    • David DiVincenzo
      • Two-Bit Gates are Universal for Quantum Computation
      • Quantum Computation with Quantum Dots
      • Quantum Information is Physical
      • Quantum Nonlocality without Entanglement
      • The Physical Implementation of Quantum Computation
    • John Smolin
      • Superactivation of Bound Entanglement
    • Barbara Terhal
      • Classical simulation of noninteracting-fermion quantum circuits
      • Hiding Quantum Data
      • Fault-Tolerant Quantum Computation For Local Non-Markovian Noise
  • Indiana University
    • Topological Quantum Computing
      • Michael Larsen
      • Zdzislaw Meglicki
        • Introduction to Quantum Computing, B679
      • Zhenghan Wang
  • Institute for Advanced Study, Princeton
    • Scott Aaronson
      • Papers
        • Quantum Search of Spatial Regions
        • Multilinear Formulas and Skepticism of Quantum Computing
        • Limitations of Quantum Advice and One-Way Communication
        • Improved Simulation of Stabilizer Circuits
        • NP-complete Problems and Physical Reality
      • Software
        • CHP: CNOT-Hadamard-Phase
  • Johns Hopkins University - Applied Physics Laboratory
    • James D. Franson
      • Quantum Logic Operations Using Single Photons and the Zeno Effect
      • Quantum Logic Using Linear Optics
    • Todd B. Pittman
      • Probabilistic Quantum Logic Operations Using Polarizing Beam Splitters
      • Demonstration of Non-Deterministic Quantum Logic Operations using Linear Optical Elements
      • Experimental Controlled-NOT Logic Gate for Single Photons in the Coincidence Basis
      • Experimental Demonstration of a Quantum Circuit using Linear Optics Gates
      • Demonstration of Quantum Error Correction using Linear Optics
  • JPL
    • Center for Integrated Space Microsystems
      • Revolutionary Computing Technologies
        • Quantum Computing
    • Quantum Computing Technologies Group
      • Daniel S. Abrams
        • A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
  • Kent State University - Department of Chemistry
    • Anatoly K. Khitrin
      • Resurrection of Schrodinger Cat
  • Los Alamos
    • CCS-3: Modeling, Algorithms and Informatics Group - Fundamentals of Computing Team
      • Howard Barnum
        • Further results on the multipartite separable ball
    • LANSCE-1: Accelerator Physics and Engineering
      • Filippo Neri
        • Quantum Bayesian methods and subsequent measurements
    • P-23: Quantum Information - Neutron Science and Technology Group
      • Richard J. Hughes
        • Cryptography, Quantum Computation and Trapped Ions
        • Practical free-space quantum key distribution over 10 km in daylight and at night
        • Comment on "Quantum key distribution with 1.25 Gbps clock synchronization" by J.C. Bienfang et al., quant-ph/0405097
    • T-11: Condensed Matter and Statistical Physics
      • Jim Gubernatis
        • Quantum Simulations of Physics Problems
      • Gerardo Ortiz
        • Entanglement as an Observer-Dependent Concept: An Application to Quantum Phase Transitions
    • T-13: Complex Systems Group
      • Gennady Berman
        • Formation and Dynamics of a Schrödinger-Cat State in Continuous Quantum Measurement
        • A Quantum Full Adder for a Scalable Nuclear Spin Quantum Computer
        • Perturbation Approach for a Solid-State Quantum Computation
        • Qubitless Quantum Physics
  • Louisiana State University
    • Department of Electrical & Computer Engineering
      • Subhash C Kak
        • The Initialization Problem in Quantum Computing
        • Statistical Constraints on State Preparation for a Quantum Computer
        • Are Quantum Computing Models Realistic?
        • General Qubit Errors Cannot Be Corrected
        • Teleportation Protocol Requiring Only One Classical Bit
    • Department of Physics & Astronomy, Quantum Science & Technologies Group
      • Jonathan P. Dowling
        • Quantum Interferometric Optical Lithography: Exploiting Entanglement to Beat The Diffraction Limit
          • Physics News story - Entangled Photons Can Defeat the Diffraction Limit
        • Quantum Technology: The Second Quantum Revolution
        • Towards Linear Optical Quantum Computers
        • High-fidelity linear optical quantum computing with polarization encoding
  • Miami University
    • James P. Clemens
      • A two reservoir model of quantum error correction
  • Michigan State University
    • Department of Physics and Astronomy
      • Mark Dykman
        • A quantum computer based on electrons floating on liquid helium
    • National Superconducting Cyclotron Laboratory
      • Scott Hitchcock
        • 'Photosynthetic' Quantum Computers?
  • Microsoft Research
    • Michael H. Freedman
      • Topological Quantum Computation
  • MIT - Quantum Information Science
    • Center for Bits and Atoms
    • Center for Theoretical Physics
      • Edward H. Farhi
        • An Analog Analogue of a Digital Quantum Computation
        • Quantum Computation by Adiabatic Evolution
        • Quantum Adiabatic Evolution Algorithms with Different Paths
      • Andrew J. Landahl
        • Universal quantum interfaces
    • Department of Mathematics
      • Peter Shor
        • Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
        • The Adaptive Classical Capacity of a Quantum Channel, or Information Capacities of Three Symmetric Pure States in Three Dimensions
        • Capacities of Quantum Channels and How to Find Them
        • The classical capacity achievable by a quantum channel assisted by limited entanglement
    • Department of Nuclear Engineering
      • Nicolas Boulant
        • Incoherent Noise and Quantum Information Processing
      • Tim Havel
        • Ensemble Quantum Computing by NMR Spectroscopy
        • Principles and Demonstrations of Quantum Information Processing by NMR Spectroscopy
        • Quantum Simulations on a Quantum Computer
        • Quantum Process Tomography of the Quantum Fourier Transform
      • Marco Pravia
        • Robust Control of Quantum Information
    • Department of Physics
      • Grum Teklemariam
        • A Method for Modeling Decoherence on a Quantum Information Processor
    • Media Lab
      • Physics and Media Group
        • Neil Gershenfeld
          • Bulk Spin-Resonance Quantum Computation
    • Research Laboratory of Electronics
      • Quanta Research Group
        • Kenneth R. Brown
          • Arbitrarily accurate composite pulses
        • Isaac Chuang
          • Experimental Implementation of Fast Quantum Searching
          • Experimental realization of a quantum algorithm
          • Experimental Realization of A Two Bit Phase Damping Quantum Code
          • Implementation of a three-quantum-bit search algorithm
          • Experimental realization of order-finding with a quantum computer
          • Liquid State NMR Quantum Computing Computation
          • Efficient Discrete Approximations of Quantum Gates
        • Andrew Cross
          • A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing
        • David Leibrandt
          • Demonstration of a scalable, multiplexed ion trap for quantum information processing
        • Benjamin Recht
          • Thesis: Spingineering: Quantum Control in the Presence of Relaxation
          • Using unitary operations to preserve quantum states in the presence of relaxation
        • Matthias Steffen
          • Experimental implementation of an adiabatic quantum optimization algorithm
        • Terri M. Yu
          • Bounds on the entanglability of thermal states in liquid-state nuclear magnetic resonance
      • Seth Lloyd
        • Quantum limits to dynamical evolution
        • The Computational Universe: Quantum gravity from quantum computation
      • Franco N. C. Wong
        • Deterministic Controlled-NOT gate for single-photon two-qubit quantum logic
  • Naval Research Laboratory, Washington, DC - Center for Computational Materials Science
    • C. Stephen Hellberg
      • Robust Quantum Computation with Quantum Dots
    • Yaakov S. Weinstein
      • The Effects of Symmetries on Quantum Fidelity Decay
  • NEC Laboratories America
    • Martin Rötteler
      • Old Web page at University of Waterloo
      • Papers
        • Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups
        • Universal Simulation of Hamiltonians Using a Finite Set of Control Operations
        • Simulating Hamiltonians in Quantum Networks: Efficient Schemes
        • New Tales of the Mean King
        • On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group
  • NIST
    • Computer Security Division
      • D. Richard Kuhn
        • Vulnerabilities in Quantum Key Distribution Protocols
    • Information Technology Division - Software Diagnostics & Conformance Testing Division
      • Quantum Compiling and Simulation
        • Paul E. Black
          • Papers
            • Quantum Computing and Communications
            • Modeling Quantum Information Systems
          • Software
            • QCSim
    • Mathematical & Computational Sciences Division
      • Stephen S. Bullock
        • Canonical Decompositions of n-qubit Quantum Computations and Concurrence
      • Emanuel Knill
        • Conventions for Quantum Pseudocode
        • Los Alamos scientists make seven bit quantum leap
        • Efficient Linear Optics Quantum Computation
        • Theory of quantum computation
        • Quantum information processing
        • A scheme for efficient quantum computation with linear optics
        • Implementation of the Five Qubit Error Correction Benchmark
        • Fermionic Linear Optics and Matchgates
        • Introduction to Quantum Error Correction
        • Introduction to Quantum Information Processing
        • Introduction to NMR Quantum Information Processing
        • Quantum Simulations of Physics Problems
        • Scalable Quantum Computation in the Presence of Large Detected-Error Rates
        • The quantum query complexity of the hidden subgroup problem is polynomial
        • Fault-Tolerant Postselected Quantum Computation: Schemes
        • Quantum computing with realistically noisy devices (preprint)
    • Quantum Processes Group, Gaithersburg
      • Carl J. Williams
        • Scalable quantum computation in systems with Bose-Hubbard dynamics
        • Quantum key distribution with 1.25 Gbps clock synchronization
        • Advantages of high-speed technique for quantum key distribution; reply to quant-ph/0407050
    • Time and Frequency Division, Boulder, Colorado - Ion Storage Group
      • John Chiaverini
        • Surface-Electrode Architecture for Ion-Trap Quantum Information Processing
        • Implementation of the Semiclassical Quantum Fourier Transform in a Scalable System
      • John D. Jost
        • Entangled mechanical oscillators (preprint)
      • Chris Langer
        • Long-Lived Qubit Memory Using Atomic Ions (preprint)
      • Dietrich Leibfried
        • Creation of a six-atom 'Schrödinger cat' state
      • David J. Wineland
        • Demonstration of a fundamental quantum logic gate
        • Experimental issues in coherent quantum-state manipulation of trapped atomic ions
        • Architecture for a large-scale ion-trap quantum computer
        • Experimental demonstration of a robust, high-fidelity geometric two ion-qubit phase gate
        • Deterministic quantum teleportation of atomic qubits
  • Northeastern University - Department of Mathematics
    • Michael Nathanson
      • Quantum Guessing via Deutsch-Jozsa
  • Northwestern University
    • Center for Photonic Communication and Computing
      • Geraldo A Barbosa
        • Fast and secure key distribution using mesoscopic coherent states of light
    • Electrical and Computer Engineering Department
      • Horace P. Yuen
        • A simple unconditionally secure quantum bit commitment protocol via quantum teleportation
        • Another simple unconditionally secure quantum bit commitment protocol -- beating entanglement attack with split entangled pair
        • How to Build Unconditionally Secure Quantum Bit Commitment Protocols
  • North Carolina State University - Department of Electrical and Computer Engineering
    • David Collins
      • Orchestrating an NMR quantum computation: the N=3 Deutsch-Jozsa algorithm
  • Oak Ridge National Laboratory - Center for Engineering Science Advanced Research
    • Cassius D'Helon
      • New summing algorithm using ensemble computing
  • Portland State University - Department of Electrical Engineering, Laboratory of Quantum Information
    • Jacob D. Biamonte
      • Testing a Quantum Computer
      • Fast Testing Quantum Circuits
  • Purdue University
    • Department of Mathematics
      • Chris Lomont
        • Robust String Matching in O(\sqrt{N}+M) Quantum Queries
        • A quantum Fourier transform algorithm
        • The Hidden Subgroup Problem - Review and Open Problems
    • Department of Physics
      • Yuli Lyanda-Geller
        • Scalable Quantum Computing with "Enhancement" Quantum Dots
  • Rutgers University
    • Mario Szegedy
      • On the Quantum Query Complexity of Detecting Triangles in Graphs
  • Southern Illinois University Carbondale - Physics Department
    • Mark S. Byrd
      • Overview of Quantum Error Prevention and Leakage Elimination
      • Universal Leakage Elimination
  • Stanford Univeristy
    • Department of Applied Physics
      • Bogdan A. Bernevig
        • Holonomic Quantum Computing Based on the Stark Effect
      • Han-Dong Chen
        • Geometry of the 3-Qubit State, Entanglement and Division Algebras
    • Department of Electrical Engineering - James S. Harris Group
    • Institute for Theoretical Physics
      • M. Stewart Siu
        • From quantum circuits to adiabatic algorithms
    • Mesoscopic Quantum Optics group
      • Entangled Electrons and Photons
        • William D. Oliver
          • Electron Entanglement via a Quantum Dot
      • Crystal Lattice Quantum Computation Group
        • Thaddeus Ladd
          • An all silicon quantum computer
  • Stony Brook University - Department of Physics and Astronomy
    • C.N. Yang Institute for Theoretical Physics
      • Vladimir Korepin
        • Thermodynamic interpretation of quantum error correcting criterion
        • Entanglement, Toeplitz Determinants and Fisher-Hartwig Conjecture
        • Correlation Functions in Spin Chains and Information Theory
        • Universality of Entropy Scaling in 1D Gap-less Models
        • Entanglement in a Valence-Bond-Solid State
    • Wenjin Mao
      • Quantum Algorithm to Solve Satisfiability Problems
  • Texas A&M University
    • Department of Computer Science
      • Andreas Klappenecker
        • Quantum Computing and a Unified Approach to Fast Unitary Transforms
        • Engineering Functional Quantum Algorithms
        • Nonbinary stabilizer codes over finite fields
    • Department of Electrical Engineering
      • Laszlo Kish
        • Comparison of Energy Requirements for Classical and Quantum Information Processing
    • Department of Mathematics
      • Goong Chen
        • Mathematical Models of Contemporary Elementary Quantum Computing Devices
      • Zijian Diao
        • An Exponentially Fast Quantum Search Algorithm
    • Department of Physics
      • Chia-Ren Hu
        • A family of sure-success quantum algorithms for solving a generalized Grover search problem
  • UCLA - Electrical Engineering Department
    • P. Oscar Boykin
      • A new proof for the existence of mutually unbiased bases
    • Sudhir Kumar Singh
      • Quantum seals
  • UMBC - Computer Science and Engineering
    • Samuel J. Lomonaco
      • Quantum Hidden Subgroup Problems: A Mathematical Perspective
      • A Continuous Variable Shor Algorithm
  • University of Alberta - Theoretical Physics Institute
    • Gilad Gour
      • Remote Preparation and Distribution of Bipartite Entangled States
  • University of California, Berkeley
    • Computer Science Theory
      • Ben Reichardt
        • Improved ancilla preparation scheme increases fault-tolerant threshold
        • Quantum error correction of systematic errors using a quantum search framework
      • Quantum Information Theory Group
    • Department of Chemistry
      • Head-Gordon Group
        • Alán Aspuru-Guzik
          • Simulated Quantum Computation of Molecular Energies
      • Whaley Group
        • Kenneth Brown
          • Scalable Ion Trap Quantum Computation with Pairwise Interactions Only
        • Mikko Mottonen
          • High fidelity one-qubit operations under random telegraph noise
        • Birgitta Whaley
          • A geometric theory of non-local two-qubit operations
  • University of California, Davis - Mathematics
    • Greg Kuperberg
      • A subexponential-time quantum algorithm for the dihedral hidden subgroup problem
  • University of California Riverside, Department of Electrical Engineering
    • Alexander N. Korotkov
      • Quantum feedback control of a solid-state two-level system
  • University of California, Santa Barbara
    • Department of Computer Science
      • Wim van Dam
        • Quantum Algorithms for Weighing Matrices and Quadratic Residues
        • Efficient Quantum Algorithms for Estimating Gauss Sums
        • Quantum Algorithms for some Hidden Shift Problems
  • University of Georgia, Athens - Department of Physics and Astronomy
    • Michael R. Geller
      • Superconducting Qubits Coupled to Nanoelectromechanical Resonators: An Architecture for Solid-State Quantum Information Processing
  • University of Illinois at Chicago
    • Department of Mathematics, Statistics, and Computer Science
      • Louis H. Kauffman
        • Quantum Computing and the Jones Polynomial
        • Yang--Baxterizations, Universal Quantum Gates and Hamiltonians
    • Department of Physics
      • Paul M. Goldbart
        • Geometric measure of entanglement for multipartite quantum states
      • Paul G. Kwiat
        • Mixed state sensitivity of several quantum information benchmarks
  • University of Kansas
    • Department of Chemistry
      • Shih-I Chu
        • Error prevention scheme with two pairs of qubits
    • Department of Physics & Astronomy
      • Siyuan Han
        • A unified approach to realize universal quantum gates in a coupled two-qubit system with fixed always-on coupling
  • University of Maryland - Laboratory for Physical Sciences
    • Bruce Kane
      • A silicon-based nuclear spin quantum computer
      • Hydrogenic spin quantum computing in silicon: a digital approach
  • University of Michigan
    • Department of Physics
      • Bucksbaum Group
        • FOCUS Center
          • Philip Howard Bucksbaum
            • Extracting quantum dynamics from genetic learning algorithms through principal control analysis
      • Franco Nori
        • Personal Web Page
        • Scalable Quantum Computing with Josephson Charge Qubits
      • Ion Trap Group
        • Winfried Karl Hensinger
          • T-junction ion trap array for two-dimensional ion shuttling, storage and manipulation
        • Martin John Madsen
          • Planar Ion Trap Geometry for Microfabrication
        • Christopher Monroe
          • Quantum Information Processing with Atoms and Photons
      • Quantum Optics & Quantum Information Group
        • Luming Duan
          • Efficient quantum computation with probabilistic quantum gates
    • Electrical Engineering and Computer Science - The Quantum Circuits Group
      • Igor Markov
        • Gate-Level Simulation of Quantum Circuits
        • An Arbitrary Two-qubit Computation In 23 Elementary Gates
        • Improving Gate-Level Simulation of Quantum Circuits
        • Synthesis of Quantum Logic Circuits
      • George Viamontes
        • Graph-based simulation of quantum computation in the density matrix representation
  • University of Minnesota - Center for Magnetic Resonance Research (CMRR)
    • Xijia Miao
      • A polynomial-time solution to the parity problem on an NMR quantum computer
      • Solving the quantum search problem in polynomial time on an NMR quantum computer
  • University of New Mexico - Information Physics Group
    • Carlton M. Caves
      • Separability of very noisy mixed states and implications for NMR quantum computing
      • Climbing Mount Scalable: Physical-Resource Requirements for a Scalable Quantum Computer
    • Cristopher Moore
      • Generic Quantum Fourier Transforms
      • The Symmetric Group Defies Strong Fourier Sampling: Part I
      • For Distinguishing Conjugate Hidden Subgroups, the Pretty Good Measurement is as Good as it Gets
    • Joseph M. Renes
      • Equiangular Spherical Codes in Quantum Cryptography
    • Tracey E. Tessier
      • Complementarity in two-qubit systems
  • University of Oklahoma - Department of Chemistry & Biochemistry
    • Bing M. Fung
      • Cluster of Dipolar Coupled Spins as a Quantum Memory Storage
      • Experimental realization of a continuous version of the Grover algorithm
  • Univeristy of Pittsburgh, Department of Physics and Astronomy
    • Jeremy Levy
      • Universal quantum computation with spin-1/2 pairs and Heisenberg exchange
    • Frank Tabakin
      • Papers
        • Qdensity - a Mathematica Quantum Computer Simulation
      • Software
        • QDENSITY - Simulation of a Quantum Computer
  • University of Rochester - Superconducting Digital Electronics
    • Marc J. Feldman
      • Quantum computation with un-tunable couplings
  • University of Southern California
    • Advanced Computer Architecture Laboratory
      • Kevin Obenland
        • Models to Reduce the Complexity of Simulating a Quantum Computer
        • Simulating the Effect of Decoherence and Inaccuracies on a Quantum Computer
        • A Parallel Quantum Computer Simulator
        • Using Simulation to Assess the Feasibility of Quantum Computing
          • Simulator Source Code
    • Electrical Engineering Department - Communication Sciences Institute
      • Todd A. Brun
        • A C++ library using quantum trajectories to solve quantum master equations
        • Effects of noise on quantum error correction algorithms
        • Computers with closed timelike curves can solve hard problems
        • Realistic simulations of single-spin nondemolition measurement by magnetic resonance force microscopy
        • Weak measurements are universal
  • University of South Carolina - Department of Computer Science & Engineering
    • Stephen A. Fenner
      • An intuitive Hamiltonian for quantum search
      • Universal quantum computation with two- and three-qubit projective measurements
      • Quantum algorithms for a set of group theoretic problems
  • University of Tennessee, Department of Physics and Astronomy
    • Yang Sun
      • Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State
      • General Phase Matching Condition for Quantum Searching
  • University of Texas at Austin - Center for Statistical Mechanics
    • Anil Shaji
      • Dynamics of initially entangled open quantum systems
      • The Schrodinger picture for open quantum dynamics
  • University of Virginia - Department of Physics
    • Olivier Pfister
      • On quantum teleportation with beam-splitter-generated entanglement
  • University of Washington, Seattle - Department of Computer Science and Engineering
    • Dave Bacon
      • Efficient Quantum Circuits for Schur and Clebsch-Gordon Transforms
      • Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
  • University of Wisconsin, Computer Sciences Department
    • Dieter van Melkebeek
      • Old homepage at IAS
      • On the Quantum Black-Box Complexity of Majority
  • Washington University, Saint Louis - Department of Physics
    • Aikaterini Mandilara
      • Elliptical orbits in the Bloch sphere
  • Wichita State University
    • Elizabeth Behrman
      • A Quantum Neural Network Computes Entanglement
  • Williams College, Williamstown, Massachusetts - Department of Physics
    • William Wootters
      • Entanglement of a Pair of Quantum Bits
      • Entanglement of Formation of an Arbitrary State of Two Qubits
      • Picturing Qubits in Phase Space
  • Without Academic Affiliation
    • Jose L. Cereceda
      • Generalization of the Deutsch algorithm using two qudits
    • Steve Huntsman
      • Quantum simulated annealing
    • Keith Kastella
      • Structured quantum search in NP-complete problems using the density of states
    • Ken Emil Loo
      • More On Grover's Algorithm
    • Robert R. Tucci
      • Papers
        • Quantum Bayesian Nets
        • How to Compile A Quantum Bayesian Net
        • A Rudimentary Quantum Compiler(2cnd Ed.)
        • Quantum Information Theory - A Quantum Bayesian Net Perspective
        • Quantum Computer as an Inference Engine
        • Binary Decision Diagrams are a Subset of Bayesian Nets
        • An Application of Renormalization Group Techniques to Classical Information Theory
        • Qubiter Algorithm Modification, Expressing Unstructured Unitary Matrices with Fewer CNOTs
        • Quantum Compiling with Approximation of Multiplexors
      • The Artiste company
        • Software, hardware, opinions, articles, surveys, newsgroups and mailing lists etc.
  • Worcester Polytechnic Institute
    • Padmanabhan K. Aravind
      • A pseudo-simulation of Shor's quantum factoring algorithm
      • Solution to the King's Problem in prime power dimensions
  • Yale University - Atomic Physics
    • Many Body Physics and Quantum Computation
      • Steven M. Girvin
        • Cavity quantum electrodynamics for superconducting electrical circuits: an architecture for quantum computation
    • Quantum Computation with Ultracold Polar Molecules
      • Dave DeMille
        • Quantum computation with trapped polar molecules

Last updated on Nov 08 2011 at 23:10
by Ian Glendinning