Knill et al., 2001 - Google Patents

A scheme for efficient quantum computation with linear optics

Knill et al., 2001

View PDF
Document ID
8320248292831555192
Author
Knill E
Laflamme R
Milburn G
Publication year
Publication venue
nature

External Links

Snippet

Quantum computers promise to increase greatly the efficiency of solving problems such as factoring large integers, combinatorial optimization and quantum physics simulation. One of the greatest challenges now is to implement the basic quantum-computational elements in a …
Continue reading at citeseerx.ist.psu.edu (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0852—Quantum cryptography
    • H04L9/0858—Details about key distillation or coding, e.g. reconciliation, error correction, privacy amplification, polarisation coding or phase coding
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/002—Quantum computers, i.e. information processing by using quantum superposition, coherence, decoherence, entanglement, nonlocality, teleportation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures

Similar Documents

Publication Publication Date Title
Knill et al. A scheme for efficient quantum computation with linear optics
Postler et al. Demonstration of fault-tolerant universal quantum gate operations
Bouland et al. On the complexity and verification of quantum random circuit sampling
Harrow et al. Quantum computational supremacy
Reinhold et al. Error-corrected gates on an encoded qubit
Hassija et al. Present landscape of quantum computing
Gottesman et al. Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations
Ma et al. Error-transparent operations on a logical qubit protected by quantum error correction
Boixo et al. Characterizing quantum supremacy in near-term devices
Reed et al. Realization of three-qubit quantum error correction with superconducting circuits
Bennett et al. Quantum information and computation
Pudenz et al. Error-corrected quantum annealing with hundreds of qubits
Li et al. Squashed entanglement, k-extendibility, quantum Markov chains, and recovery maps
Prevedel et al. High-speed linear optics quantum computing using active feed-forward
Martin-Lopez et al. Experimental realization of Shor's quantum factoring algorithm using qubit recycling
Nemoto et al. Photonic quantum networks formed from NV− centers
Cai et al. Mitigating coherent noise using Pauli conjugation
US11451231B2 (en) Robust quantum logical gates
Ayanzadeh et al. Multi-qubit correction for quantum annealers
Nagy et al. Quantum computation and quantum information
Fan et al. Deterministic CNOT gate and complete Bell-state analyzer on quantum-dot-confined electron spins based on faithful quantum nondemolition parity detection
Liu et al. Efficient entanglement concentration for partially entangled cluster states with weak cross-Kerr nonlinearity
Krovi Models of optical quantum computing
Jiao et al. Remote implementation of single-qubit operations via hyperentangled states with cross-Kerr nonlinearity
Luo et al. Quantum computation based on photonic systems with two degrees of freedom assisted by the weak cross-Kerr nonlinearity