REVIEW 12 cited by
Theoretical framework for quantum networks
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
Signed reviews
read the original abstract
We present a framework to treat quantum networks and all possible transformations thereof, including as special cases all possible manipulations of quantum states, measurements, and channels, such as, e.g., cloning, discrimination, estimation, and tomography. Our framework is based on the concepts of quantum comb-which describes all transformations achievable by a given quantum network-and link product-the operation of connecting two quantum networks. Quantum networks are treated both from a constructive point of view-based on connections of elementary circuits-and from an axiomatic one-based on a hierarchy of admissible quantum maps. In the axiomatic context a fundamental property is shown, which we call universality of quantum memory channels: any admissible transformation of quantum networks can be realized by a suitable sequence of memory channels. The open problem whether this property fails for some nonquantum theory, e.g., for no-signaling boxes, is posed.
Forward citations
Cited by 12 Pith papers
-
Strong unitary designs in optimal depth and space
For every fixed k and error tolerance, strong approximate unitary k-designs are constructed in optimal Theta(log n) depth on the n system qubits using random perfect-matching layers.
-
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).
-
Relational Quantum Causal Processes: Exact Models, Continuum Limits, and the Boundary of Emergent Gravity
Relational quantum causal processes are shown to generate Boolean records, DAG causal order, and Lorentzian metric-measure geometry in controlled models, with autonomous background-free gravity left open.
-
Cloning Quantum Channels
The paper unifies state and channel cloning, proves that a channel family can super-replicate only when a certain generator β(x) is nonzero, and exhibits noisy phase gates as the first non-unitary examples.
-
Singular value transformation for unknown quantum channels
An algorithm block-encodes the Liouville representation of an unknown quantum channel from black-box access, enabling polynomial transformations of its singular values via QSVT.
-
Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order
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...
-
Subsystem decompositions of quantum evolutions and transformations between causal perspectives
Alice's and Bob's causal perspectives in the quantum switch cannot be related by any fixed change of subsystem decomposition, so they are not equivalent descriptions of the same evolution.
-
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.
-
Witnessing the architecture of quantum circuits
A witness framework certifies when a unitary cannot be realized by a prescribed quantum circuit architecture, with SDP and LP relaxations and analytical Clifford bounds.
-
Temporal Kirkwood-Dirac Quasiprobability Distribution and Unification of Temporal State Formalisms through Temporal Bloch Tomography
A generalized Kirkwood–Dirac distribution for multi-time processes unifies pseudo-density operators, doubled density operators, and related temporal state formalisms via temporal Bloch tomography.
-
Tensor-network decoders for process tensor descriptions of non-Markovian noise
A tensor-network-based maximum likelihood decoder is constructed for quantum error correction under process-tensor noise, with an MPS approximation demonstrated on the five-qubit and Steane codes.
-
Composable and Finite Computational Security of Quantum Message Transmission
Secure quantum message transmission can be defined and proven in a finite, composable way, and common game-based definitions are stronger than necessary.
Discussion (0). Continue with ORCID to comment.