Every N-party quantum circuit with quantum control of causal order can be represented as a routed quantum circuit built from one fixed routed graph G_QC-QC(N).
Quantum computation with programmable connections between gates
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
quant-ph 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Routing Quantum Control of Causal Order
Every N-party quantum circuit with quantum control of causal order can be represented as a routed quantum circuit built from one fixed routed graph G_QC-QC(N).