Quantum computation with programmable connections between gates

DOI10.1016/j.physleta.2012.08.028zbMath1266.81046arXiv1109.5987OpenAlexW2147651330WikidataQ62107159 ScholiaQ62107159MaRDI QIDQ2376283

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

Publication date: 21 June 2013

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

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

zbMATH Keywords

quantum algorithmsquantum computationquantum switch

Mathematics Subject Classification ID

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

Related Items (13)

Computational tameness of classical non-causal models ⋮ Quantum theory, namely the pure and reversible theory of information ⋮ The SWITCH test for discriminating quantum evolutions ⋮ Remote creation of quantum coherence via indefinite causal order ⋮ Optimal processing of reversible quantum channels ⋮ Unnamed Item ⋮ Quantum circuits cannot control unknown operations ⋮ The space of logically consistent classical processes without causal order ⋮ Device-independent test of causal order and relations to fixed-points ⋮ Quantum causal modelling ⋮ Operational quantum theory without predefined time ⋮ Causal and causally separable processes ⋮ Optimal quantum networks and one-shot entropies

Uses Software

• Automath

Cites Work

• Programmable Quantum Gate Arrays
• Theoretical framework for quantum networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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