Quantum nonlocality is possible in the triangle network with no inputs and binary outputs, which is the smallest such scenario by number of variables and outcomes.
Quantum Circuits Architecture
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
abstract
We present a method for optimizing quantum circuits architecture. The method is based on the notion of "quantum comb", which describes a circuit board in which one can insert variable subcircuits. The method allows one to efficiently address novel kinds of quantum information processing tasks, such as storing-retrieving, and cloning of channels.
citation-role summary
background 2
method 1
citation-polarity summary
fields
quant-ph 6verdicts
UNVERDICTED 6representative citing papers
Presents a poly-complexity quantum circuit implementing the random dilation superchannel for parallel channel queries, with approximate sequential extension, a no-go theorem for exact sequential dilation, and an application to exponentially improved channel storage-retrieval.
Quantum strategy stores isometry channels with n = Θ(1/√ε) queries for error ε, quadratic improvement over classical n = Θ(ε^{-1}).
Defines polyslot pslot[C] and srep[C] constructions on symmetric monoidal categories that reconstruct unitary supermaps and forbid time-loops in composition, with equivalence shown on path-contraction groupoids.
Higher-order quantum map types form a distributive lattice of regular subtypes where signalling relations are determined by type function evaluations and structure poset rank parity, with normal forms derived from maximal chains.
A machine that purifies two quantum inputs of different rank with positive probability cannot be a linear positive map, ruling out universal probabilistic purification from finite copies; approximate strategies exhibit a dimension-dependent trade-off between pure-output and append-environment maps.
citing papers explorer
-
The minimal example of quantum network Bell nonlocality
Quantum nonlocality is possible in the triangle network with no inputs and binary outputs, which is the smallest such scenario by number of variables and outcomes.
-
Random dilation superchannel
Presents a poly-complexity quantum circuit implementing the random dilation superchannel for parallel channel queries, with approximate sequential extension, a no-go theorem for exact sequential dilation, and an application to exponentially improved channel storage-retrieval.
-
Quantum Advantage in Storage and Retrieval of Isometry Channels
Quantum strategy stores isometry channels with n = Θ(1/√ε) queries for error ε, quadratic improvement over classical n = Θ(ε^{-1}).
-
Polycategorical Constructions for Unitary Supermaps of Arbitrary Dimension
Defines polyslot pslot[C] and srep[C] constructions on symmetric monoidal categories that reconstruct unitary supermaps and forbid time-loops in composition, with equivalence shown on path-contraction groupoids.
-
Order structure and signalling in higher order quantum maps
Higher-order quantum map types form a distributive lattice of regular subtypes where signalling relations are determined by type function evaluations and structure poset rank parity, with normal forms derived from maximal chains.
-
Probabilistic and approximate universal quantum purification machines
A machine that purifies two quantum inputs of different rank with positive probability cannot be a linear positive map, ruling out universal probabilistic purification from finite copies; approximate strategies exhibit a dimension-dependent trade-off between pure-output and append-environment maps.