Percolation, renormalization, and quantum computing with non-deterministic gates

Abstract

We apply a notion of static renormalization to the preparation of entangled states for quantum computing, exploiting ideas from percolation theory. Such a strategy yields a novel way to cope with the randomness of non-deterministic quantum gates. This is most relevant in the context of optical architectures, where probabilistic gates are common, and cold atoms in optical lattices, where hole defects occur. We demonstrate how to efficiently construct cluster states without the need for rerouting, thereby avoiding a massive amount of conditional dynamics; we furthermore show that except for a single layer of gates during the preparation, all subsequent operations can be shifted to the final adapted single qubit measurements. Remarkably, cluster state preparation is achieved using essentially the same scaling in resources as if deterministic gates were available.

5 pages, 4 figures, discussion of strategies to deal with further imperfections extended, references updated

References in corpus (20)

• Measurement-based quantum computation with cluster states
• Experimental One-Way Quantum Computing
• Multi-party entanglement in graph states
• Fault-tolerant quantum computation with high threshold in two dimensions
• Resource-efficient linear optical quantum computation
• Controlled Collisions for Multiparticle Entanglement of Optically Trapped Atoms
• Optical quantum computation using cluster states
• Novel schemes for measurement-based quantum computation
• Universal resources for measurement-based quantum computation
• Loss tolerance in one-way quantum computation via counterfactual error correction
• Generation of Atomic Cluster States through the Cavity Input-Output Process
• On the Number of Incipient Spanning Clusters
• Repeat-Until-Success quantum computing using stationary and flying qubits
• Noise thresholds for optical quantum computers
• The efficiencies of generating cluster states with weak non-linearities
• Demonstration of Feed-Forward Control for Linear Optics Quantum Computation
• Potential and limits to cluster state quantum computing using probabilistic gates
• Optimizing linear optics quantum gates
• Upper bounds on success probabilities in linear optics
• Minimal resources for linear optical one-way computing

Cited by in corpus (70)

• Measurement-based quantum computation
• Photonic quantum information processing: a concise review
• Manipulating multi-photon entanglement in waveguide quantum circuits
• Measurement-based quantum computation beyond the one-way model
• Almost-linear time decoding algorithm for topological codes
• From three-photon GHZ states to ballistic universal quantum computation
• Quantum Photonic Interconnect
• A quantum network stack and protocols for reliable entanglement-based networks
• Prospects for measurement-based quantum computing with solid state spins
• Quantum computational capability of a 2D valence bond solid phase
• Limitations of quantum computing with Gaussian cluster states
• Entanglement percolation in quantum complex networks
• Enhancing the W State Quantum Network Fusion Process with A Single Fredkin Gate
• Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
• Fusing multiple W states simultaneously with a Fredkin gate
• Distribution of entanglement in large-scale quantum networks
• Optical Quantum Computation
• The efficiencies of generating cluster states with weak non-linearities
• Quantum Fisher Information of W States in Decoherence Channels
• Perceval: A Software Platform for Discrete Variable Photonic Quantum Computing
• Continuous-Variable Quantum Computing in Optical Time-Frequency Modes using Quantum Memories
• Measurement-based Quantum Communication
• A scheme for universal high-dimensional quantum computation with linear optics
• The Optical Frequency Comb as a One-Way Quantum Computer
• Deterministic optical quantum computer using photonic modules
• Photonic source of heralded GHZ states
• The 2D AKLT state on the honeycomb lattice is a universal resource for quantum computation
• Phase transition of computational power in the resource states for one-way quantum computation
• Relative multiplexing for minimizing switching in linear-optical quantum computing
• Generation of arbitrary all-photonic graph states from quantum emitters
• Improved Heralded Schemes to Generate Entangled States From Single Photons
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
• Measurement-Based Quantum Computation
• One-way quantum computation with four-dimensional photonic qudits
• Hybrid valence-bond states for universal quantum computation
• Near-deterministic creation of universal cluster states with probabilistic Bell measurements and 3-qubit resource states
• Universal resources for approximate and stochastic measurement-based quantum computation
• Strong entanglement causes low gate fidelity in inaccurate one-way quantum computation
• Physical-depth architectural requirements for generating universal photonic cluster states
• Transitions in the computational power of thermal states for measurement-based quantum computation
• Fiber-compatible photonic feed-forward with 99% fidelity
• A local and scalable lattice renormalization method for ballistic quantum computation
• Universal scaling laws for dispersion interactions
• Loss-tolerant teleportation on large stabilizer states
• Lattice Surgery on the Raussendorf Lattice
• Timing constraints imposed by classical digital control systems on photonic implementations of measurement-based quantum computing
• An introduction to one-way quantum computing in distributed architectures
• Boosted Bell-state measurements for photonic quantum computation
• Heralded generation of entanglement with photons
• Unitary Entanglement Construction in Hierarchical Networks
• Loss-tolerant architecture for quantum computing with quantum emitters
• Parity-encoding-based quantum computing with Bayesian error tracking
• Transitions in the quantum computational power
• Analysis of optical loss thresholds in the fusion-based quantum computing architecture
• Boosting photonic quantum computation with moderate nonlinearity
• Efficient percolation simulations for lossy photonic fusion networks
• Quantum complexity phase transitions in monitored random circuits
• Integration of highly probabilistic sources into optical quantum architectures: perpetual quantum computation
• Percolation in quantum computation and communication
• Maximally entangled gapped ground state of lattice fermions
• Linear-optical fusion boosted by high-dimensional entanglement
• Transforming graph states via Bell state measurements
• Strategies for measurement-based quantum computation with cluster states transformed by stochastic local operations and classical communication
• Fusing Imperfect Photonic Cluster States
• Resource-efficient loss-aware photonic graph state preparation using atomic emitters
• Timing constraints due to real-time graph traversal algorithms on incomplete cluster states in photonic measurement-based quantum computing
• Automated discovery of heralded ballistic graph state generators for fusion-based photonic quantum computation
• Testing equivalence of pure quantum states and graph states under SLOCC
• Rigorous no-go theorems for heralded linear-optical state generation tasks
• Building a fusion-based quantum computer using teleported gates