REVIEW 9 cited by
Transforming quantum operations: quantum supermaps
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 introduce the concept of quantum supermap, describing the most general transformation that maps an input quantum operation into an output quantum operation. Since quantum operations include as special cases quantum states, effects, and measurements, quantum supermaps describe all possible transformations between elementary quantum objects (quantum systems as well as quantum devices). After giving the axiomatic definition of supermap, we prove a realization theorem, which shows that any supermap can be physically implemented as a simple quantum circuit. Applications to quantum programming, cloning, discrimination, estimation, information-disturbance trade-off, and tomography of channels are outlined.
Forward citations
Cited by 9 Pith papers
-
Algebraic Speedups for Exact Inversion of Hamiltonian Evolutions
Known generator structure—additive eigenvalue relations and Wedderburn sector multiplicities—determines and often drastically lowers the exact query cost of reversing a Hamiltonian evolution.
-
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).
-
Distinguishing quantum processes with bounded coherent memory
MADs define a hierarchy of distinguishability measures for multi-time quantum processes that increases with coherent memory dimension and saturates the strategy-norm benchmark at finite memory.
-
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 appli...
-
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...
-
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.
-
Probabilistic exact universal quantum circuits for transforming unitary operations
The paper derives optimal success probabilities and no-go thresholds for probabilistically transforming unknown unitary operations into their transpose, complex conjugate, or inverse, and proves adaptive circuits give...
-
How many systems can be dephased before the quantum switch becomes causally definite?
In bipartite processes and multipartite quantum circuits with quantum control, causal nonseparability persists when any single non-future system remains undephased but becomes separable if all systems or only the futu...
Discussion (0). Continue with ORCID to comment.