pith. sign in

arxiv: 1906.10495 · v1 · pith:7I7T4SRZnew · submitted 2019-06-23 · 💻 cs.CC · quant-ph

Approximating Unitary Preparations of Orthogonal Black Box States

Joshua Alan Cook This is my paper

Pith reviewed 2026-05-25 18:08 UTC · model grok-4.3

classification 💻 cs.CC quant-ph
keywords quantum circuitsunitary approximationorthogonal statesblack-box statesauxiliary resetstate preparationcircuit complexity
0
0 comments X

The pith

For two exactly orthogonal n-qubit states each prepared by small circuits, a polynomial-size approximating unitary maps two basis states to them while resetting auxiliaries on every input.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper asks whether small circuits exist that map m computational basis states to m orthogonal n-qubit states prepared by other small circuits, with the added requirement that auxiliary bits return to zero for every possible input string. For the m=2 case the author supplies an explicit approximating unitary whose size grows polynomially with both n and the allowed error. The construction is possible only because the two target states are exactly orthogonal; the universal auxiliary-reset condition forces the use of more involved approximation methods than would otherwise be needed. A reader cares because the result gives a concrete, efficient way to embed two black-box orthogonal states into a larger reversible computation.

Core claim

I give an approximation of such a unitary in the m = 2 case that has size polynomial in the approximation error, and the number of qubits n. The unitary maps two computational basis states to the two given orthogonal states and returns every auxiliary bit to its initial value for any input, not merely the two basis states of interest.

What carries the argument

The polynomial-size approximating unitary that enforces exact auxiliary reset on the entire input space while mapping two basis states to a pair of exactly orthogonal black-box states.

If this is right

  • Two orthogonal black-box states can be prepared reversibly with circuit size polynomial in n and the error.
  • The auxiliary-reset condition holds uniformly over the whole 2^n-dimensional space rather than only on the two target states.
  • The method supplies a concrete step toward the general m-state version of the problem.
  • The polynomial dependence allows the construction to remain efficient as the number of qubits grows.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same orthogonality-driven approximation technique might extend to other small fixed values of m.
  • If the states are only approximately orthogonal, the polynomial bound may no longer hold.
  • The construction could be used as a subroutine inside larger quantum algorithms that require reversible embedding of orthogonal subspaces.

Load-bearing premise

The two states are exactly orthogonal, each is produced by some small circuit, and the approximating unitary must reset auxiliaries for every possible input string.

What would settle it

An explicit pair of exactly orthogonal states, each preparable by a small circuit, for which every approximating unitary that resets auxiliaries on all inputs requires superpolynomial size in n or 1/error.

read the original abstract

In this paper, I take a step toward answering the following question: for m different small circuits that compute m orthogonal n qubit states, is there a small circuit that will map m computational basis states to these m states without any input leaving any auxiliary bits changed. While this may seem simple, the constraint that auxiliary bits always be returned to 0 on any input (even ones besides the m we care about) led me to use sophisticated techniques. I give an approximation of such a unitary in the m = 2 case that has size polynomial in the approximation error, and the number of qubits n.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript claims that for m=2 exactly orthogonal n-qubit states each prepared by a small circuit, there exists a unitary approximating the partial map from two computational basis states to these states, with circuit size polynomial in n and 1/ε, such that auxiliary qubits are reset to |0⟩ for every one of the 2^n possible inputs.

Significance. If correct, the result supplies an explicit polynomial-size construction for approximate unitary state preparation under the universal auxiliary-reset constraint. The argument relies on a sequence of controlled reflections, approximate isometries extending the partial map, and an explicit uncomputation step that acts uniformly on all inputs and incurs only polynomial overhead; these elements constitute a concrete, falsifiable contribution to quantum circuit complexity for black-box orthogonal states.

minor comments (2)
  1. [Abstract] Abstract, paragraph 2: the statement that the approximating unitary 'has size polynomial in the approximation error, and the number of qubits n' would be clearer if it explicitly referenced the dependence on the size of the given preparing circuits.
  2. The manuscript would benefit from a short diagram or pseudocode block illustrating the top-level structure of the controlled-reflection + uncomputation composition.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary and significance assessment of our work on approximating unitaries for orthogonal black-box states under the auxiliary-reset constraint. The recommendation for minor revision is noted; with no major comments raised we will proceed with any minor editorial adjustments in the revised version.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper presents a direct construction of an approximating unitary for the m=2 case using controlled reflections and approximate isometries, with explicit uncomputation to enforce auxiliary reset on all inputs. No fitted parameters, self-definitional quantities, or load-bearing self-citations appear in the derivation. The polynomial size bound follows from the explicit sequence of operations rather than any reduction to the input states by construction. The result is self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Only the abstract is available, so the ledger records only the background assumptions visible at that level.

axioms (1)
  • standard math Quantum circuits are unitary and act on a fixed number of qubits including auxiliaries.
    Implicit in any discussion of unitary preparations and auxiliary reset.

pith-pipeline@v0.9.0 · 5616 in / 1152 out tokens · 23503 ms · 2026-05-25T18:08:40.649336+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

6 extracted references · 6 canonical work pages · 1 internal anchor

  1. [1]

    Gentle Measurement of Quant um States and Differential Privacy

    S. Aaronson and G. N. Rothblum. “Gentle Measurement of Quant um States and Differential Privacy”. In: to appear in Proceedings of ACM STOC’2019. (2019). url: https://www.scottaaronson.com/papers/dpgentle.pdf

    work page 2019

  2. [2]

    Quantum Algorithms without Initializing the Auxiliary Qubits

    Dong Chi, Jeong San Kim, and Soojoon Lee. “Quantum Algorithms without Initializing the Auxiliary Qubits”. In: Physical review letters 95 (Sept. 2005), p. 080504. doi: 10.1103/PhysRevLett.95.080504

    work page doi:10.1103/physrevlett.95.080504 2005

  3. [3]

    Probability Inequalities for Sums of Bounded Ra n- dom Variables

    Wassily Hoeffding. “Probability Inequalities for Sums of Bounded Ra n- dom Variables”. In: Journal of the American Statistical Association 58.301 (1963), pp. 13–30. doi: 10.1080/01621459.1963.10500830. eprint: https://www.tandfonline.com/doi/pdf/10.1080/01621459.1963.10500830. url: https://www.tandfonline.com/doi/abs/10.1080/01621459.1963.10500830

    work page doi:10.1080/01621459.1963.10500830 1963

  4. [4]

    From Classical to Quantum Shannon Theory

    Mark Wilde. From Classical to Quantum Shannon Theory . 2011. url: https://arxiv.org/abs/1106.1445

    work page arXiv 2011

  5. [5]

    PHYS 7895: Quantum Information Theory, Lecture 16

    Mark Wilde. “PHYS 7895: Quantum Information Theory, Lecture 16”. In: (2015). url: http://www.markwilde.com/teaching/2015-fall-qit/lectures/lecture-16.pdf

    work page 2015

  6. [6]

    Coding Theorem and Strong Converse for Quantum Channels

    Andreas Winter. “Coding Theorem and Strong Converse for Qua ntum Channels”. In: IEEE TRANSACTIONS ON INFORMATION THE- ORY 45.7 (Nov. 1994), pp. 2481–2485. doi: 10.1109/18.796385. url: https://arxiv.org/abs/1409.2536. 17

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1109/18.796385 1994