Quantum computation with programmable connections between gates

Abstract

A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g. in achieving the programmability of permutations of N different unitary channels with 1 use instead of N uses per channel. For this task, a new elemental resource is needed, the "quantum switch", which can be programmed to switch the order of two channels with a single use of each one.

5 pages, PRL style

References in corpus (2)

• Quantum Circuits Architecture
• Ultrafast switching of photonic entanglement

Cited by in corpus (78)

• Experimental Superposition of Orders of Quantum Gates
• Computational advantage from quantum-controlled ordering of gates
• Quantum causal modelling
• Indefinite Causal Order in a Quantum Switch
• Quantum Metrology with Indefinite Causal Order
• Causal and causally separable processes
• Quantum superposition of the order of parties as a communication resource
• Bell's Theorem for Temporal Order
• Quantum Refrigeration with Indefinite Causal Order
• Quantum circuits cannot control unknown operations
• Indefinite causal order enables perfect quantum communication with zero capacity channels
• Quantum Switch for the Quantum Internet: Noiseless Communications through Noisy Channels
• Experimental Quantum Communication Enhancement by Superposing Trajectories
• Communication through coherent control of quantum channels
• Computational advantage from quantum superposition of multiple temporal orders of photonic gates
• Time-delocalized quantum subsystems and operations: on the existence of processes with indefinite causal structure in quantum mechanics
• Maximal incompatibility of locally classical behavior and global causal order in multi-party scenarios
• Resource theories of communication
• Quantum circuits with classical versus quantum control of causal order
• Optimal quantum networks and one-shot entropies
• The space of logically consistent classical processes without causal order
• Theoretical framework for Higher-Order Quantum Theory
• Experimentally feasible computational advantage from quantum superposition of gate orders
• Functional Quantum Computing: An Optical Approach
• Optimal Strategies of Quantum Metrology with a Strict Hierarchy
• Operational quantum theory without predefined time
• Quantum and Classical Data Transmission through Completely Depolarising Channels in a Superposition of Cyclic Orders
• Quantum Theory, namely the pure and reversible theory of information
• Experiments on quantum causality
• On the definition and characterisation of multipartite causal (non)separability
• Experimental Aspects of Indefinite Causal Order in Quantum Mechanics
• Causal Boxes: Quantum Information-Processing Systems Closed under Composition
• Classical Communications with Indefinite Causal Order for $N$ completely depolarizing channels
• Beyond Shannon Limits: Quantum Communications through Quantum Paths
• Causal structure in the presence of sectorial constraints, with application to the quantum switch
• Complex conjugation supermap of unitary quantum maps and its universal implementation protocol
• Device-independent test of causal order and relations to fixed-points
• Composable security in relativistic quantum cryptography
• Acausal measurement-based quantum computing
• Evading noise in multiparameter quantum metrology with indefinite causal order
• Unlimited non-causal correlations and their relation to non-locality
• Demonstration of a quantum SWITCH in a Sagnac configuration
• Deterministic Generation of Multipartite Entanglement via Causal Activation in the Quantum Internet
• Computational tameness of classical non-causal models
• Optimal processing of reversible quantum channels
• Fully-Optimized Quantum Metrology: Framework, Tools, and Applications
• Quantum Circuits for the Unitary Permutation Problem
• Indefinite Causal Orders from Superpositions in Time
• Reassessing the computational advantage of quantum-controlled ordering of gates
• Non-causal computation
• Correlation Measure Equivalence in Dynamic Causal Structures of Quantum Gravity
• Breaking the limits of purification: Postselection enhances heat-bath algorithmic cooling
• Theory of Quantum Gravity Information Processing
• Memory in quantum processes with indefinite time direction and causal order
• Entanglement-assisted classical communication can simulate classical communication without causal order
• The SWITCH test for discriminating quantum evolutions
• Practical computational advantage from the quantum switch on a generalized family of promise problems
• Admissible Causal Structures and Correlations
• A no-go theorem for superpositions of causal orders
• A Diagrammatic Approach to Information Transmission in Generalised Switches
• No-signalling constrains quantum computation with indefinite causal structure
• Trading causal order for locality
• Parallelizable adiabatic gate teleportation
• The Multi-round Process Matrix
• Coherent control of the causal order of entanglement distillation
• The Möbius game and other Bell tests for relativity
• Quantum process discrimination with restricted strategies
• Consistent circuits for indefinite causal order
• Mapping indefinite causal order processes to composable quantum protocols in a spacetime
• Background Independence and Quantum Causal Structure
• Quantum theory cannot violate a causal inequality
• Causal nonseparability and its implications for spatiotemporal relations
• Sequential device-independent certification of indefinite causal order
• Remote Creation of Quantum Coherence via Indefinite Causal Order
• Entropic uncertainty under indefinite causal order and input-output direction
• Optimal Thermalization under Indefinite Causal Order with Identical and Asymmetric Baths
• No quantum advantage for violating fixed-order inequalities?
• Flow of dynamical causal structures with an application to correlations