Pith. sign in

REVIEW 4 cited by

Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1810.06944 v3 pith:UB7FBJFW submitted 2018-10-16 quant-ph

Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations

Marco T\'ulio Quintino , Qingxiuxiong Dong , Atsushi Shimbo , Akihito Soeda , Mio Murao This is my paper
classification quant-ph
keywords quantumunitarycircuitsuniversalcausalcircuitexactgiven
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Given a quantum gate implementing a $d$-dimensional unitary operation $U_d$, without any specific description but $d$, and permitted to use $k$ times, we present a universal probabilistic heralded quantum circuit that implements the exact inverse $U_d^{-1}$, whose failure probability decays, exponentially in $k$. The protocol employs an adaptive strategy, proven necessary for the exponential performance. It requires $k\geq d-1$, proven necessary for exact implementation of $U_d^{-1}$ with quantum circuits. Moreover, even when quantum circuits with indefinite causal order are allowed, $k\geq d-1$ uses are required. We then present a finite set of linear and positive semidefinite constraints characterizing universal unitary inversion protocols and formulate a convex optimization problem whose solution is the maximum success probability for given $k$ and $d$. The optimal values are computed using semidefinite programming solvers for $k\leq 3$ when $d=2$ and $k\leq 2$ for $d=3$. With this numerical approach we show for the first time that indefinite causal order circuits provide an advantage over causally ordered ones in a task involving multiple uses of the same unitary operation.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

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

  1. Algebraic Speedups for Exact Inversion of Hamiltonian Evolutions

    quant-ph 2026-07 conditional novelty 7.0

    Known generator structure—additive eigenvalue relations and Wedderburn sector multiplicities—determines and often drastically lowers the exact query cost of reversing a Hamiltonian evolution.

  2. Random dilation superchannel

    quant-ph 2025-12 unverdicted novelty 7.0

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

  3. A resource theory of asynchronous quantum information processing

    quant-ph 2025-04 unverdicted novelty 7.0

    Introduces resource theories for asynchronous port-based teleportation with free classical and quantum pre-processing, computes tight fidelity bounds for isotropic, graph, and symmetrized EPR states, and proves the st...

  4. Multicopy quantum state teleportation with application to storage and retrieval of quantum programs

    quant-ph 2024-09 unverdicted novelty 6.0

    Maximal success probability for multicopy teleportation without receiver correction is p(d,k)=k/[d(k-1+d)], attained by explicit protocol using group representation theory, with application to enhanced quantum program...