Pith. sign in

REVIEW 2 cited by

Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly

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 2209.02907 v5 pith:M3K3L6MQ submitted 2022-09-07 quant-ph

Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly

classification quant-ph
keywords unitaryoperationinversionquantumdeterministicprotocolqubit-unitaryunknown
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We report a deterministic and exact protocol to reverse any unknown qubit-unitary operation, which simulates the time inversion of a closed qubit system. To avoid known no-go results on universal deterministic exact unitary inversion, we consider the most general class of protocols transforming unknown unitary operations within the quantum circuit model, where the input unitary operation is called multiple times in sequence and fixed quantum circuits are inserted between the calls. In the proposed protocol, the input qubit-unitary operation is called 4 times to achieve the inverse operation, and the output state in an auxiliary system can be reused as a catalyst state in another run of the unitary inversion. We also present the simplification of the semidefinite programming for searching the optimal deterministic unitary inversion protocol for an arbitrary dimension presented by M. T. Quintino and D. Ebler [Quantum $\textbf{6}$, 679 (2022)]. We show a method to reduce the large search space representing all possible protocols, which provides a useful tool for analyzing higher-order quantum transformations for unitary operations.

discussion (0)

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

Forward citations

Cited by 2 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...