Pith. sign in

REVIEW 3 cited by

Perfect discrimination of no-signalling channels via quantum superposition of causal structures

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1109.5154 v3 pith:SUOCWIYX submitted 2011-09-23 quant-ph

classification quant-ph
keywords alicecausalno-signallingquantumstructurescausallychannelsdiscrimination
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A no-signalling channel transforming quantum systems in Alice's and Bob's laboratories is compatible with two different causal structures: (A < B) Alice's output causally precedes Bob's input and (B< A) Bob's output causally precedes Alice's input. I show that a quantum superposition of circuits operating within these two causal structures enables the perfect discrimination between no-signalling channels that can not be perfectly distinguished by any ordinary circuit.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Routing Quantum Control of Causal Order

    quant-ph 2025-07 accept novelty 8.0 of 10

    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).

  2. Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order

    quant-ph 2025-06 conditional novelty 7.0 of 10

    Causally indefinite classical processes can compute a constructed Boolean function family with D^0.792 queries instead of D, and indefinite causal order gives an exact three-query quantum algorithm where sequential qu...

  3. Polycategorical Constructions for Unitary Supermaps of Arbitrary Dimension

    quant-ph 2022-07 unverdicted novelty 7.0 of 10

    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.

Pith tools