Quantum computation with programmable connections between gates

DOI10.1016/J.PHYSLETA.2012.08.028zbMATH Open1266.81046arXiv1109.5987OpenAlexW2147651330WikidataQ62107159 ScholiaQ62107159MaRDI QIDQ2376283FDOQ2376283

Giacomo Mauro D'Ariano, Timoteo Colnaghi, Stefano Facchini, Paolo Perinotti

Publication date: 21 June 2013

Published in: Physics Letters. A (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1109.5987

zbMATH Keywords

quantum algorithmsquantum computationquantum switch

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Cites Work

• Programmable Quantum Gate Arrays
• Theoretical framework for quantum networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (16)

• Title not available (Why is that?)
• Operational quantum theory without predefined time
• The SWITCH test for discriminating quantum evolutions
• Optimal processing of reversible quantum channels
• Quantum causal modelling
• Title not available (Why is that?)
• Programmable quantum gate arrays
• Causal and causally separable processes
• Quantum theory, namely the pure and reversible theory of information
• A diagrammatic approach to information transmission in generalised switches
• Computational tameness of classical non-causal models
• Remote creation of quantum coherence via indefinite causal order
• Device-independent test of causal order and relations to fixed-points
• Optimal quantum networks and one-shot entropies
• Quantum circuits cannot control unknown operations
• The space of logically consistent classical processes without causal order

Uses Software

• Automath

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Quantum computational networks 👍 👎
• Integrable quantum computation 👍 👎
• Programmable Quantum Gate Arrays 👍 👎
• Programmable quantum gate arrays 👍 👎
• Probabilistic programmable quantum processors 👍 👎
• Programmable quantum processors 👍 👎
• Quantum gates and circuits 👍 👎
• QUANTUM DOT COMPUTING GATES 👍 👎

This page was built for publication: Quantum computation with programmable connections between gates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376283)