Pith. Sign in

RECORD

Function-dependent Phase Transform in Quantum Computing

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Dong Pyo Chi, Jinsoo Kim, Soojoon Lee

Quantum Physics · Submitted 8 Jun 2000

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim We construct a quantum algorithm that performs function-dependent phase transform and requires no initialization of an ancillary register.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDquant-ph/0006039 (version 1)
Pith IDCINR2NE5, Pith's permanent record of this paper and its review
CitationDong Pyo Chi, Jinsoo Kim, Soojoon Lee. "Function-dependent Phase Transform in Quantum Computing." arXiv:quant-ph/0006039 (2000). https://pith.science/paper/CINR2NE5
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,502 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.11 · human participants 0.01 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.17 · compares with prior results 0.12 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

We construct a quantum algorithm that performs function-dependent phase transform and requires no initialization of an ancillary register. The algorithm recovers the initial state of an ancillary register regardless of whether its state is pure or mixed. Thus we can use any qubits as an ancillary register even though they are entangled with others and are occupied by other computational process. We also show that our algorithm is optimal in the sense of the number of function evaluations.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We construct a quantum algorithm that performs function-dependent phase transform and requires no initialization of an ancillary register. contribution 0.99 0.95 0.55 asserted 1.00
s1 The algorithm recovers the initial state of an ancillary register regardless of whether its state is pure or mixed. result 0.83 0.90 0.22 asserted 1.00
s2 Thus we can use any qubits as an ancillary register even though they are entangled with others and are occupied by other computational process. interpretation 0.93 0.77 0.25 asserted 0.79
s3 We also show that our algorithm is optimal in the sense of the number of function evaluations. result 0.86 0.94 0.16 asserted 1.00

What kind of paper the classifier reports this is: method or tool 0.99 · evidence from proof or derivation 0.99.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We construct a quantum algorithm that performs function-dependent phase transform and requires no initialization of an ancillary register. The algorithm recovers the initial state of an ancillary register regardless of whether its state is pure or mixed. Thus we can use any qubits as an ancillary register even though they are entangled with others and are occupied by other computational process. We also show that our algorithm is optimal in the sense of the number of function evaluations.

Human review

How Pith checks papers → · Full audit of this paper →

How the literature uses it

Papers whose main result relates to this one's

How each label was checked · JSON

Found among the papers closest to this one by title and main claim. Pith's classifier compared each pair's main results and a second model family confirmed the relation; checked against two further families, shown conflicts agreed 118 times in 120 and shown same results 218 times in 239. The quoted sentence is the other paper's main claim.

States the same result 1 paper
  • We present a quantum algorithm for the f-conditioned phase transform which does not require any initialization of ancillary register.

    The f-conditioned Phase Transform · 0.89

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.