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.
Higher- Order Quantum Operations
12 Pith papers cite this work, alongside 1 external citations. Polarity classification is still indexing.
12
Pith papers citing it
1
external citations · external index
citation-role summary
background 4
citation-polarity summary
fields
quant-ph 12roles
background 4polarities
background 4representative citing papers
Develops two protocols for probabilistic storage-and-retrieval of unitary superchannels, with staircase backstitch reaching unit success probability asymptotically as query number grows, plus a universal inversion protocol.
The paper shows that for some pairs of unitary channels, perfect discrimination is possible with separable states but nearly impossible with maximally entangled states, introducing MEWC and MEBC concepts.
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.
Categorical supermaps on any generalised theory with channel-state duality are exactly CJ-supermaps, recovering classical, quantum, and NSWSE-Boxworld supermaps.
Quantum strategy stores isometry channels with n = Θ(1/√ε) queries for error ε, quadratic improvement over classical n = Θ(ε^{-1}).
Causal reference frame and time-delocalized subsystem descriptions of pure processes are coordinate parametrizations of a single neutral object, with unitary perspective transformations possible by reshuffling time order or adding reference-frame subsystems.
Derives analytic expressions for randomized benchmarking under temporally correlated non-Markovian noise, identifies cases where correlations are invisible to RB, and shows they can affect diamond norm errors.
GPU-accelerated see-saw SDP exploration finds no improvement in GYNI winning probability for local dimensions 6-8 over the d=5 value of approximately 0.6218.
A new framework establishes a trade-off between energy cost and complexity in quantum phase estimation, locating a sweet spot for co-optimization at desired precision.
Local quantum memory criteria applied via matrix product operator methods show that single-intervention process tensors generally predict quantum memory at low temperatures in spin-boson models, while dynamical maps detect it for resonant environments at short times.
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.
-
Probabilistic Storage and Retrieval of Quantum Superchannels for "Retrospective'' Intervention
Develops two protocols for probabilistic storage-and-retrieval of unitary superchannels, with staircase backstitch reaching unit success probability asymptotically as query number grows, plus a universal inversion protocol.
-
Entanglement in quantum channel discrimination: sometimes less is more
The paper shows that for some pairs of unitary channels, perfect discrimination is possible with separable states but nearly impossible with maximally entangled states, introducing MEWC and MEBC concepts.
-
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.
-
Supermaps on generalised theories
Categorical supermaps on any generalised theory with channel-state duality are exactly CJ-supermaps, recovering classical, quantum, and NSWSE-Boxworld supermaps.
-
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}).
-
Frame perspectives for process matrices: from coordinate parametrization to spacetime representation
Causal reference frame and time-delocalized subsystem descriptions of pure processes are coordinate parametrizations of a single neutral object, with unitary perspective transformations possible by reshuffling time order or adding reference-frame subsystems.
-
Blind-spots of Randomized Benchmarking Under Temporal Correlations
Derives analytic expressions for randomized benchmarking under temporally correlated non-Markovian noise, identifies cases where correlations are invisible to RB, and shows they can affect diamond norm errors.
-
GPU-accelerated semidefinite programming for causal games
GPU-accelerated see-saw SDP exploration finds no improvement in GYNI winning probability for local dimensions 6-8 over the d=5 value of approximately 0.6218.
-
Trade-off between complexity and energy in quantum phase estimation
A new framework establishes a trade-off between energy cost and complexity in quantum phase estimation, locating a sweet spot for co-optimization at desired precision.
-
Verifying Quantum Memory in the Dynamics of Spin Boson Models
Local quantum memory criteria applied via matrix product operator methods show that single-intervention process tensors generally predict quantum memory at low temperatures in spin-boson models, while dynamical maps detect it for resonant environments at short times.