The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index; none of the 15 sources its claims cite is checked for support yet.
Quantum computations: algorithms and error correction
Open accessAbstract
Contents §0. Introduction §1. Abelian problem on the stabilizer §2. Classical models of computations 2.1. Boolean schemes and sequences of operations 2.2. Reversible computations §3. Quantum formalism 3.1. Basic notions and notation 3.2. Transformations of mixed states 3.3. Accuracy §4. Quantum models of computations 4.1. Definitions and basic properties 4.2. Construction of various operators from the elements of a basis 4.3. Generalized quantum control and universal schemes §5. Measurement operators §6. Polynomial quantum algorithm for the stabilizer problem §7. Computations with perturbations: the choice of a model §8. Quantum codes (definitions and general properties) 8.1. Basic notions and ideas 8.2. One-to-one codes 8.3. Many-to-one codes §9. Symplectic (additive) codes 9.1. Algebraic preparation 9.2. The basic construction 9.3. Error correction procedure 9.4. Torus codes §10. Error correction in the computation process: general principles 10.1. Definitions and results 10.2. Proofs §11. Error correction: concrete procedures 11.1. The symplecto-classical case 11.2. The case of a complete basis Bibliography
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
86 No basis given · 26 Own interpretation · 12 Not checked yet · 5 Own result · 2 Own method
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We shall see that Q is a complete basis in the approximate sense, see Theorem 4.8 below.”
§ Quantum computations: algorithms and error correction > Choice of the basis.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The norm of an admissible transformation is always equal to one.”
§ Quantum computations: algorithms and error correction > 8 below).
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Proposition 2.3.We assume that F : Ν ->• B m (N C B n ) is computable in a basis A by means of a Boolean scheme of dimension L. Then F® can be represented in the basis A& = {/® : / G A} by a reversible scheme of dimension 2L + m.”
§ Quantum computations: algorithms and error correction > 2.2. Reversible computations.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary. C^ is a complete basis for reversible computations.”
§ Quantum computations: algorithms and error correction > Corollary. C^ is a complete basis for reversible computations.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Proposition 3.6.Let Τ £ T(M,M ® 1) be an admissible transformation such that Try Γ = I M .Then there exists λ G D(J) such that TX = X <g> λ (for any X € L(M)).”
§ Quantum computations: algorithms and error correction > By Lemma 3.2 the non-zero eigenvalues of
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Any classical operator can be represented in the basis 3? = {1.3,σχ ,@,Λφ}.(This follows from the completeness of the classical reversible basis 31.)It follows that any classical operator can be represented in the basis Q.”
§ Quantum computations: algorithms and error correction > 4.2. Construction of various operators from the elements of a basis.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“If a basis of the subgroup Ρ C Z 2 is known, then it is easy to find an element of the form (τη, -1) G P. Then ( m = g, that is, m is the discrete logarithm of g with base ζ.”
§ Quantum computations: algorithms and error correction > §1. Abelian problem on the stabilizer
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: The action of the group G on the finite set M and the group operations in G are easy to compute.
- The authors state this as an assumption: The group G in the stabilizer problem is Abelian.
- The authors state this as an assumption: The set M can be identified with a subset of the Boolean cube B^n.
- The authors state this as an assumption: The function F is available as an oracle or black box that returns F(g,x) for inputs in its domain.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The operators 5 and Κ (see (24)) generate a finite group Ε C U(25) of order 192.”
§ Quantum computations: algorithms and error correction > 4.2. Construction of various operators from the elements of a basis.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Moreover, there exists a rather simple polynomial algorithm for reducing a basis to a unique (for a given subgroup A C Z k ) canonical form.”
§ Quantum computations: algorithms and error correction > §1. Abelian problem on the stabilizer
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: The action of the group G on the finite set M and the group operations in G are easy to compute.
- The authors state this as an assumption: The group G in the stabilizer problem is Abelian.
- The authors state this as an assumption: The set M can be identified with a subset of the Boolean cube B^n.
- The authors state this as an assumption: The function F is available as an oracle or black box that returns F(g,x) for inputs in its domain.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Then the set of operators Η U V~1HV generates the whole group SU(M).”
§ Quantum computations: algorithms and error correction > (29) v2
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
- It may state two separate claims as one. 32
- Probably not a substantial claim. 19
- The quote only partly states this claim. 8
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Factorizing Ε relative to its centre {( k : k = 0,... , 7}, we obtain the corresponding group of unitary transformations ESp 2 (l) C UT(£) of order 24.8 The group ESp 2 (l) is isomorphic to the group of characteristic rotations of the cube, the Pauli matrices σ χ ,σ ν ,σ Ζ £ L(!B® n ) transforming like the basis unit vectors.”
§ Quantum computations: algorithms and error correction > 4.2. Construction of various operators from the elements of a basis.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Quantum probability is additive, just as classical probability is.”
§ Quantum computations: algorithms and error correction > 3.1. Basic notions and notation.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It is clear that any Boolean scheme of dimension L can be transformed into a sequence of cL operations (where c is the largest number of bits acted upon by a basis function).Conversely, any sequence of L operations can be modelled by a Boolean scheme of dimension L.”
§ Quantum computations: algorithms and error correction > Λ[6;4,5] -[5] V[3,5;3] V[4;l,2] Λ [3; 3,4] V[2,4;2] V[l,3;l].
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It is obvious that X),e Q P(p, Vj) + P(p, V±) = 1, where V± is the orthogonal complement of φ^€η V^•.”
§ Quantum computations: algorithms and error correction > 3.1. Basic notions and notation.
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“The discrete logarithm and decomposition into prime factors can be reduced to this problem.”
- Also stated in: § §1. Abelian problem on the stabilizer · plain
“The computational problems of 'factorization' and the 'discrete logarithm' can be reduced to an Abelian problem on the stabilizer.”
§ Quantum computations: algorithms and error correction > Abstract
What the sources say
- Not checked yetcites [49]
- Not checked yetcites [11]
plaindirectn = 2- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Also stated in: § §1. Abelian problem on the stabilizer · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“1) ΤΓ(ΓΧ) = Tr X for any X e L(W) or {which is equivalent) T*1 M = 1 N ;”
- Also stated in: § 3.2. Transformations of mixed states. · plain
“3) Τ is a positive operator.”
§ Quantum computations: algorithms and error correction > 3.2. Transformations of mixed states.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The quote only partly states this claim.
- Also stated in: § 3.2. Transformations of mixed states. · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“First, any mixed state ρ £ D(N) can be represented as”
§ Quantum computations: algorithms and error correction > 3.1. Basic notions and notation.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It follows that St_F(a) is isomorphic to Z k and has a basis {51,... ,#&} of polynomial dimension, that is, ]Cj = i size(gj-) ^ poly(n + k).”
§ Quantum computations: algorithms and error correction > §1. Abelian problem on the stabilizer
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- The authors state this as an assumption: The action of the group G on the finite set M and the group operations in G are easy to compute.
- The authors state this as an assumption: The group G in the stabilizer problem is Abelian.
- The authors state this as an assumption: The set M can be identified with a subset of the Boolean cube B^n.
- The authors state this as an assumption: The function F is available as an oracle or black box that returns F(g,x) for inputs in its domain.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The basis Q' generates a set of operators closed under the transformation U >-¥ A(U) (and also under U i-> U~1).”
§ Quantum computations: algorithms and error correction > (29) v2
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Unfortunately, Λ(5) can only be represented approximately, which gives rise to some technical inconvenience.”
§ Quantum computations: algorithms and error correction > {|°^ * a = ° (28)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The quote only partly states this claim.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“These operators commute with one another and have eigenvalues |(1 ± %/-15), which are not roots of 1.”
§ Quantum computations: algorithms and error correction > (29) v2
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The canonical generators are unitary, they belong to the gradation spaces, and have the following properties:”
§ Quantum computations: algorithms and error correction > 9.1. Algebraic preparation.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one. The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The information operators are defined to within multiplication by a verification operator.”
§ Quantum computations: algorithms and error correction > 9.1. Algebraic preparation.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Besides, each element of Q' can be represented in the basis Q.”
§ Quantum computations: algorithms and error correction > (29) v2
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“A symplectic code can be completely characterized by specifying the verification operators Χχ,... ,X S and information operators Υ Ί & = (U • £/t)a T [s + k]”
§ Quantum computations: algorithms and error correction > 9.1. Algebraic preparation.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary.The operator Λ(Τί) {see Example 4.10) can be represented with accuracyfoot_10 Ο(δ) by a scheme of dimension poly(log(l/(5)) in the basis Q.This scheme can be constructed algorithmically in time poly(log(l/(5)).”
§ Quantum computations: algorithms and error correction > U L :
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one. The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“(Warning: the operator @ copies each basis state appearing in the quantum superposition, rather than the superposition as a whole!)”
§ Quantum computations: algorithms and error correction > Modelling of classical probability. (Compare with Example 3.3.)
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It is not hard to show that ESp 2 (n) is generated by the unitary operators S, Κ and ©, which can be applied to different qbits.”
§ Quantum computations: algorithms and error correction > 9.1. Algebraic preparation.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The operators σ {αχ βχ,... ,α η β η ) = σ αι β 1 (&-• -®σ αη β η form the standard basis in L(S !8ln ).Each of them is both unitary and Hermitian.Their eigenvalues are equal to ±1.”
§ Quantum computations: algorithms and error correction > 9.1. Algebraic preparation.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It follows that GL 2 (n) g ESp 2 (n).The group GL 2 (n) is generated by the operator ©, which can be applied to various qbits.”
§ Quantum computations: algorithms and error correction > 9.1. Algebraic preparation.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It is obvious that w(/i,/j) = 0 (i,j = 1,2,3,4).linearly independent, so E(A, 2) U F + = {0}.”
§ Quantum computations: algorithms and error correction > 9.1. Algebraic preparation.
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one. The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“If t is a unitary transformation, then the condition of (2, 2Γ, Testability can be replaced by (2, Γ, Testability.For classical schemes it suffices to require (Ι,Γ, Testability.”
§ Quantum computations: algorithms and error correction > Remark.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 4 . 8 . Any unitary matrix U £ U(!B® n ) can be represented with arbitrary accuracy δ > 0 by a quantum scheme of dimension exp(O(n)) poly(log(l/i)) in the basis Q'.This scheme can be constructed algorithmically in time exp(O(n))poly(log(l/i)).”
§ Quantum computations: algorithms and error correction > QB[0] (S-S)[0] R<-[0;A O } T'[A 0 , A U A 2 ,A 3 ] {\ξ)(ξ\)[Αο\.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Error correction, that is, the computation of v, can be reduced to finding the smallest 1-chain given its boundary.In turn, this problem can be reduced to the problem of least weight matching, for which a polynomial algorithm is known [55].”
§ Quantum computations: algorithms and error correction > 9.4.
What the sources say
- Not checked yetcites [55]
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It follows that 2s old errors (which existed prior to applying the procedure Σ) in the code qbits will be corrected and only 0(1) ^ β' new ones will appear.”
§ Quantum computations: algorithms and error correction > 11.1. The symplecto-classical case.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- The authors state this as an assumption: In the symplecto-classical case, all classical elements in the basis SC are accurate.
- The authors state this as an assumption: The classical scheme Σ10 is absolutely reliable.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Suppose that two errors occur as the scheme Σ is run.We can always find an i such that the subschemes Σί,Σ( + ι,Σ; + 2 work correctly.It follows that hi = hi + i = hi+2-”
§ Quantum computations: algorithms and error correction > 11.1. The symplecto-classical case.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- The authors state this as an assumption: In the symplecto-classical case, all classical elements in the basis SC are accurate.
- The authors state this as an assumption: The classical scheme Σ10 is absolutely reliable.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“To represent the transformation Λ in the code REP(n, 1) (η ^ 5) it suffices to perform the operation Λ for each pair of code bits, after correcting any possible errors in the input (see Fig. 2b).If a new error occurs (in one of the subschemes R. n or one of the elements Λ), then no more than one output bit will be corrupted.”
§ Quantum computations: algorithms and error correction > Additional information
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It follows that if the state |i7 + ) is prepared in the second qbit, then W acts on the first qbit in the same way as Κ.”
§ Quantum computations: algorithms and error correction > Stable realization of the operator K.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one. The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It is easily seen that U • U^ is a symplectic transformation.”
§ Quantum computations: algorithms and error correction > Ρ(\ξ,ξ,Ο(ξ,ξ,ξ\) = \{\Φ + )(Φ+\,ο) + i(|V->W-l,i),
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This situation can be rectified using the identity A C (A C (U))[1,2,A}=A C (U)[3,A}A{3;1,2).”
§ Quantum computations: algorithms and error correction > Stable realization of the operator K.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Let D o be the identity code and let D r+l = C <v D r (r = 0,1,...).(The codes D r are called cascade codes.)In the basis A we shall construct schemes Φ ίΓ (t £ .A) with the following property: any transformation Τ e Trans(* ir ,(5) represents t in the code D r with accuracy e r = co^l 2 ^, where c = const.Moreover, we require that any Τ £ Trans($/ r ,<5) should represent / in D in the strong”
§ Quantum computations: algorithms and error correction > Remark.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The identity transformation i^ will be realized by a (2, 2F,F')-stable scheme Σ.All the remaining elements of the basis will be realized in a (2, Γ', Testable way.”
§ Quantum computations: algorithms and error correction > 11.1. The symplecto-classical case.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- The authors state this as an assumption: In the symplecto-classical case, all classical elements in the basis SC are accurate.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It is easy to verify that the transformations Υ α β Ί • Υ&β Ί are symplectic, so they can be realized in a stable way.”
§ Quantum computations: algorithms and error correction > Additional information
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Nevertheless (this is a key point in the whole construction!), the depth of the scheme Σ9 ο • • • ο Σι is bounded because TOR(fc) are codes with local verification.Consequently, each of the two possible errors can corrupt only 0(1) qbits.”
§ Quantum computations: algorithms and error correction > 11.1. The symplecto-classical case.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- The authors state this as an assumption: In the symplecto-classical case, all classical elements in the basis SC are accurate.
- The authors state this as an assumption: The classical scheme Σ10 is absolutely reliable.
In the paper
“He proved that a computation of length L can be carried out if the accuracy of each operation is (logL)~c (c = const).”
§ Quantum computations: algorithms and error correction > §0. Introduction
What the sources say
- Not checked yetcites [43]
plainconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“a quantum state cannot be copied”
§ Quantum computations: algorithms and error correction > §0. Introduction
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Since any finitely-generated Abelian group is a factor group Z fc , we can assume without loss of generality that G = Z*.”
§ Quantum computations: algorithms and error correction > §1. Abelian problem on the stabilizer
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may state two separate claims as one.
- The authors state this as an assumption: The group G in the stabilizer problem is Abelian.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Therefore, there is a one-to-one correspondence between combined spaces and finite-dimensional C*-algebras.”
§ Quantum computations: algorithms and error correction > 3.1. Basic notions and notation.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“The less general case G = (Z p )* was studied by Grigoriev in [14], where he constructed an algorithm that is polynomial in k and ρ (but not in logp).”
§ Quantum computations: algorithms and error correction > §1. Abelian problem on the stabilizer
What the sources say
- Not checked yetcites [14]
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- The authors state this as an assumption: The group G in the stabilizer problem is Abelian.
In the paper
“In 1994 Shor designed polynomial quantum algorithms for the discrete logarithm and the decomposition of integers into prime factors [11].”
§ Quantum computations: algorithms and error correction > §0. Introduction
What the sources say
- Not checked yetcites [11]
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Both problems are regarded as difficult.”
§ Quantum computations: algorithms and error correction > §0. Introduction
What the sources say
- Not checked yetcites [12]
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In the literal sense this is impossible.”
§ Quantum computations: algorithms and error correction > §7. Computations with perturbations: the choice of a model
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
None of the sources cited for this claim have been checked yet.
In the paper
“Symplectic codes were first defined in [29].Quasilinear codes were considered (in slightly different terms) by Steane [20], and Shor and Calderbank [19].”
§ Quantum computations: algorithms and error correction > 9.1. Algebraic preparation.
What the sources say
- Not checked yetcites [29]
- Not checked yetcites Steane [20]
- Not checked yetcites Shor and Calderbank [19]
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It is clear that the computation of Sti'(o) is polynomially equivalent to that of H.”
§ Quantum computations: algorithms and error correction > §6. Polynomial quantum algorithm for the stabilizer problem
boostedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The quote only partly states this claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Theorem 8.3.Let 5H C Τ(Ή, Ή') be a set of completely positive transformations.We define the minimal space of operators £ C L(N, N') such that 91 C £ • £*.The following conditions are equivalent:”
§ Quantum computations: algorithms and error correction > 8.2. One-to-one codes.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The quote only partly states this claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The group Η is generated by sufficiently many random elements (see below).”
§ Quantum computations: algorithms and error correction > §6. Polynomial quantum algorithm for the stabilizer problem
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In the problem concerning the transmission of information (or a quantum state) many-to-one codes provide no advantage as compared to one-to-one codes.”
§ Quantum computations: algorithms and error correction > 8.2. One-to-one codes.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“The construction described is due to Shor [43].”
§ Quantum computations: algorithms and error correction > 11.2. The case of a complete basis.
What the sources say
- Not checked yetcites Shor [43]
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The only way around this difficulty is to supply the input information in an encoded form.The output information should also be encoded using a many-to-one code.(The ambiguity includes errors arising at the last step.)Finally, it is natural to encode bitwise all the intermediate results obtained as the accurate scheme is run.”
§ Quantum computations: algorithms and error correction > 10.1. Definitions and results.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“However, if R is realized in an unstable way, the error involved in it can only corrupt the classical bit 2, but not the quantum bit 1 (represented in the code C).Thus we must repeat the measurement five times and take the MAJ function of the five results.”
§ Quantum computations: algorithms and error correction > Stable realization of the operator K.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“The scheme (64) is almost stable: two errors can corrupt only the classical bit 0. Therefore, the measurement is to be repeated five times, followed by taking the MAJ function.”
§ Quantum computations: algorithms and error correction > QB[0] (S-S)[0] R<-[0;A O } T'[A 0 , A U A 2 ,A 3 ] {\ξ)(ξ\)[Αο\.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“(This is always enough, since we assume that no more than two errors can occur.)”
§ Quantum computations: algorithms and error correction > Stable realization of the state |0).
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
- The authors state this as an assumption: No more than two errors can occur.
The authors state this as an assumption.
The action of the group G on the finite set M and the group operations in G are easy to compute.
“We assume that this action and the group operations in G are easy to compute.”
The authors state this as an assumption.
The group G in the stabilizer problem is Abelian.
“We shall assume instead that G is an Abelian group.”
The authors state this as an assumption.
The set M can be identified with a subset of the Boolean cube B^n.
“we shall assume that Μ is identified with a subset of the Boolean cube”
The authors state this as an assumption.
The function F is available as an oracle or black box that returns F(g,x) for inputs in its domain.
“The function F is to be regarded as an oracle, that is, a 'black box' which receives an input word”
The paper relies on this without support.
In real-world conditions, qubits are subject to perturbations even when no operation is performed on them.
“Under real-life conditions qbits will be subject to perturbations even if nothing is done to them.”
The paper relies on this without support.
In sensible applications, the function F can be computed in polynomial time.
“In all sensible applications (see the examples below) F can be computed in polynomial time.”
The paper relies on this without support.
Operators acting on a small number of quantum bits can be physically realized.
“It is possible to realize such operators physically if η is small.”
The authors state this as an assumption.
Errors at different steps are statistically independent because the environment is renewed each step.
“Assuming that the environment is renewed at each step, we can exclude it from consideration and use the language of transformations of density operators (see §3.2). (This assumption means that errors at different steps are statistically independent.)”
The authors state this as an assumption.
Perturbations leave classical bits in classical states.
“Nevertheless, it is natural to assume that the perturbation leaves the classical bits in a classical state.”
The authors state this as an assumption.
The accuracy constant δ is small enough and does not depend on the specific layered scheme.
“The accuracy constant δ will be assumed to be sufficiently small, but independent of the concrete layered scheme.”
The authors state this as an assumption.
The quantum computer operates with mixed states, and unperturbed elementary transformations need not be of the form U·U†.
“It proves convenient to assume from the very beginning that the quantum computer works with mixed states, and even that unperturbed elementary transformations do not necessarily have the form U • t/t.Such computations are called mixed.”
The authors state this as an assumption.
In the simplified quantum code problem, a perturbation occurs at only one step.
“Suppose that a perturbation acts at a single step only.Arbitrary transformations, namely, coding and decoding, are allowed before and after this step.”
The authors state this as an assumption.
The quantum channel belongs to a class where the transformation is a tensor product of single-qubit admissible transformations, each within δ of the identity.
“We shall consider the following class of channels: Ν = DM' = T> n , Τ = Τι®• • •®Γ η , where Tj are admissible transformations with a single qbit”
The authors state this as an assumption.
There exists a T in the error set such that ||T - f|| < ε.
“We assume that there is a T £ 9t such that”
The authors state this as an assumption.
In the derived code setting, Ή'=3Γ and £ contains 3j.
“As a rule, we shall assume that”
The authors state this as an assumption.
In the symplecto-classical case, all classical elements in the basis SC are accurate.
“Now we shall assume that all the classical elements in the basis SC are accurate.”
The authors state this as an assumption.
The classical scheme Σ10 is absolutely reliable.
“the classical scheme Σ10 is assumed to be absolutely reliable.”
The authors state this as an assumption.
Until concrete examples are reached, all bits are assumed to be quantum bits.
“Until we arrive at concrete examples we shall assume that all bits are quantum ones.”
The authors state this as an assumption.
No more than two errors can occur.
“(This is always enough, since we assume that no more than two errors can occur.)”
The authors state this as an assumption.
The first step, construction of schemes similar to R_n, has already been made.
“(It is assumed that the first step, namely, the construction of schemes similar to R n , has already been made.)”
The authors state this as an assumption.
All spaces considered are unitary.
“For simplicity we shall assume that all the spaces considered are unitary.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“More precisely, if the reduced density matrix on any t qubits does not depend on the logical qubit, then there exists a unitary operation which recovers the original state even if the environment interacted with t qubits, i.e. t errors occurred.”
From Fault-Tolerant Quantum Computation with Constant Error Rate (2008) · cites this paper as [61]
Experimental — accuracy not yet measuredIn the citing paper
“The idea is based on a theorem by Schumacher and Nielsen[61] which asserts that a quantum state can be corrected only if no information about the state has leaked to the environment through the noise process.”
From Fault-Tolerant Quantum Computation with Constant Error Rate (2008) · cites this paper as [61]
In the citing paper
“If the EPG is smaller than a threshold, then scalable quantum computing is possible. 5-8”
From Quantum computing with realistically noisy devices (2005) · cites this paper as [6]
In the citing paper
“Estimated thresholds vary from below 10 -6 [5-8] to 3 × 10 -3 [9], with 10 -4 [10] often quoted as the EPG to be achieved in experimental quantum computing.”
From Quantum computing with realistically noisy devices (2005) · cites this paper as [6]
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
The Theory of Error-Correcting Codes
(1977) · North-Holland mathematical library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,891
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · American Mathematical Monthly · doi:10.2307/2322374 · Cited by 6,007
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679
Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
Bennett, C. H., Brassard, G., Popescu, S., Schumacher, B., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.722 · Cited by 2,961
Research works printed but not linked: 6
- D. Grigoriev, "Testing shift equivalence of polynomials using quantum mechanics", Preprint, 1995.
- Β. Β. Plenio, V. Vedral, and P. L. Knight, "Optimal realistic quantum error correcting code", LANL e-print quant-ph/9603022, http://xxx.lanl.gov. · arXiv
- C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters, "Mixed state entanglement and quantum error-correcting codes", LANL e-print quant-ph/9604024, http://xxx.lanl.gov. · arXiv
- A. S. Kholevo, "Some estimates for the amount of information transmittable by a quantum communication channel", Problemy Peredachi Informatsii 9:3 (1973), 3-11; English transl. in Problems of Information Transmission 9 (1973).
- A. Yu. Kitaev, "Fault-tolerant quantum computation by anions", LANL e-print quant-ph/9707021, http://xxx.lanl.gov. · arXiv
- Y. Lecerf, "Machines de Turing reversibles. Recursive insolubilite en η 6 Ν de l'equation u = Θ" ou θ est un 'isomorphisme de codes'", C.R. Acad. Sci. Paris 257 (1963), 2597-2600.
Cited by
Sorted by citations
Items 901–1,000 of 1,002
Geodesic algorithm for unitary gate design with time-independent Hamiltonians
Lewis, D., Wiersema, R., Carrasquilla, J., & Bose, S. (2025) · Physical Review A · doi:10.1103/physreva.111.052618 · Cited by 4
Cost of emulating a small quantum annealing problem in the circuit model
Gonzalez-Conde, J., Morrell, Z., Vuffray, M., Albash, T., & Coffrin, C. (2025) · Physical Review A · doi:10.1103/physreva.111.062606 · Cited by 5
Sample-based Hamiltonian and Lindbladian simulation: non-asymptotic analysis of sample complexity
Go, B., Kwon, H., Park, S., Patel, D., & Wilde, M. M. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ae075b · Cited by 4
Experimentally efficient methods for estimating the performance of quantum measurements
Magesan, E., & Cappellaro, P. (2013) · Physical Review A · doi:10.1103/physreva.88.022127 · Cited by 4
The Toffoli-Hadamard Gate System: an Algebraic Approach
Chiara, M. L. D., Ledda, A., Sergioli, G., & Giuntini, R. (2013) · Journal of Philosophical Logic · doi:10.1007/s10992-013-9271-9 · Cited by 4
Patil, S. R., Javadi-Abhari, A., Chiang, C.-F., Heckey, J., Martonosi, M., & Chong, F. T. (2014) · IEEE International Symposium on Workload Characterization · doi:10.1109/iiswc.2014.6983057 · Cited by 6
Representation-theoretical properties of the approximate quantum Fourier transform
Rötteler, M., & Beth, T. (2008) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-008-0072-2 · Cited by 4
Learning from Physics Experiments with Quantum Computers: Applications in Muon Spectroscopy
McArdle, S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020349 · Cited by 4
Geometric phases of a vortex in a superfluid
Polkinghorne, R., Groszek, A. J., & Simula, T. (2021) · Physical Review A · doi:10.1103/physreva.104.l041305 · Cited by 4
A Quantum Approach to the Problem of Charging Electric Cars on a Motorway
Różycki, R., Józefowska, J., Kurowski, K., Lemański, T., Pecyna, T., Subocz, M., & Waligóra, G. (2022) · Energies · doi:10.3390/en16010442 · Cited by 4
Advancing Comprehension of Quantum Application Outputs: A Visualization Technique
Senapati, P., Athawale, T. M., Pugmire, D., & Guan, Q. (2023) · doi:10.1145/3588983.3596689 · Cited by 4
Quantifying channel coherence via the norm distance
Ye, M., Luo, Y., & Li, Y. (2023) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad1015 · Cited by 4
Feynman Meets Turing: The Infeasibility of Digital Compilers for Gate-Based Quantum Computing
Bock, Y. N., Boche, H., del Toro, Z. G., & Fitzek, F. H. P. (2024) · International Conference on Communications · doi:10.1109/icc51166.2024.10622486 · Cited by 4
Capturing many-body correlation effects with quantum and classical computing
Kowalski, K., Bauman, N. P., Low, G. H., Roetteler, M., Rehr, J. J., & Vila, F. D. (2024) · Physical Review A · doi:10.1103/physreva.110.l060401 · Cited by 4
Magic Mirror on the Wall, How to Benchmark Quantum Error Correction Codes, Overall?
Chatterjee, A., & Ghosh, S. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00050 · Cited by 7
Nondigital Implementation of the Arithmetic of Real Numbers
Litvinov, G. L., Маслов, В. П., & Shpiz, G. B. (2001) · Mathematical Notes · doi:10.1023/a:1010269817483 · Cited by 6
Quantum which-way information and fringe visibility when the detector is entangled with an ancilla
Tej, J. P., Devi, A. R. U., Karthik, H. S., Sudha, & Rajagopal, A. K. (2014) · Physical Review A · doi:10.1103/physreva.89.062116 · Cited by 4
One-way quantum state transfer in a lossy coupled-cavity array
Li, D., Liao, X.-M., & Shao, X. (2019) · Optics Express · doi:10.1364/oe.27.035971 · Cited by 4
Combining T1 and T2 estimation with randomized benchmarking and bounding the diamond distance
Dawkins, H., Wallman, J. J., & Emerson, J. (2020) · Physical Review A · doi:10.1103/physreva.102.022220 · Cited by 4
On the universality and membership problems for quantum gates
Mattioli, L., & Sawicki, A. (2023) · Journal of Mathematical Physics · doi:10.1063/5.0106615 · Cited by 5
Hu, Z., & Kais, S. (2022) · Advanced Quantum Technologies · doi:10.1002/qute.202100158 · Cited by 4
Fast algorithm for quantum polar decomposition and applications
Quek, Y., & Rebentrost, P. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013144 · Cited by 4
Achieving Heisenberg scaling on measurement of a three-qubit system via quantum error correction
Hu, L., Pang, S., & Jordan, A. N. (2022) · Physical Review A · doi:10.1103/physreva.106.052609 · Cited by 4
Robust high-fidelity universal set of quantum gates through non-adiabatic rapid passage
Li, R., & Gaitan, F. (2011) · Journal of Modern Optics · doi:10.1080/09500340.2011.592621 · Cited by 4
Pseudorandom circuits from Clifford-plus- T gates
Weinstein, Y. S. (2013) · Physical Review A · doi:10.1103/physreva.88.062303 · Cited by 4
Directed quantum communication
Åberg, J., Hengl, S., & Renner, R. (2013) · New Journal of Physics · doi:10.1088/1367-2630/15/3/033025 · Cited by 4
Using quantum emulation for advanced computation
Cour, B. R. L., Ott, G. E., & Lanham, S. A. (2017) · Custom Integrated Circuits Conference · doi:10.1109/cicc.2017.7993631 · Cited by 4
Quantum computers and decoherence: exorcising the demon from the machine
Lidar, D. A., & Wu, L.-A. (2003) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.488754 · Cited by 4
A nanospintronic universal quantum gate
Bandyopadhyay, S. (2001) · Physica E Low-dimensional Systems and Nanostructures · doi:10.1016/s1386-9477(01)00188-6 · Cited by 4
Hidden Subhypergroup ProblemPreprint
Amini, M., Kalantar, M., & Roozbehani, M. M. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0609220 · Cited by 4
Nielsen, M. A., & Chuang, I. L. (2012) · Cambridge University Press eBooks · doi:10.1017/cbo9780511976667.019 · Cited by 4
The Role of Correlated Noise in Quantum ComputingPreprint
Staudt, D. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1111.1417 · Cited by 5
New designs of reversible sequential devicesPreprint
Banerjee, A., & Pathak, A. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.1620 · Cited by 4
Abelian Hypergroups and Quantum ComputationPreprint
Bermejo-Vega, J., & Zatloukal, K. C. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.05806 · Cited by 4
Computational Complexity of Some Quantum Theories in $1+1$ DimensionsPreprint
Mehraban, S. A. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.09243 · Cited by 4
Characterizing Noise in Quantum Systems
Magesan, E. (2012) · UWSpace (University of Waterloo) · Cited by 4
Techniques for Quantum Computing
Kaye, P. (2007) · UWSpace (University of Waterloo) · Cited by 4
Quantum Computing Resource Estimate of Molecular Energy SimulationPreprint
Whitfield, J. D., Biamonte, J., & Aspuru‐Guzik, A. (2010) · arXiv (Cornell University) · Cited by 4
Normalizer Circuits and Quantum ComputationPreprint
Bermejo-Vega, J. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.09274 · Cited by 8
Universal Hamiltonians for Exponentially Long SimulationPreprint
Bohdanowicz, T. C., & Brandão, F. G. S. L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.02625 · Cited by 4
Decoding quantum error correction with Ising model hardwarePreprint
Roffe, J., Zohren, S., Horsman, D. C., & Chancellor, N. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.10254 · Cited by 4
Quantum algorithms for highly non-linear Boolean functionsPreprint
Roetteler, M. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0811.3208 · Cited by 4
Symmetries of Codeword Stabilized Quantum CodesPreprint
Beigi, S., Chen, J., Grassl, M., Ji, Z., Wang, Q., & Zeng, B. (2013) · arXiv (Cornell University) · doi:10.4230/lipics.tqc.2013.192 · Cited by 4
Quantum Computation in Large Ion Crystals
Wu, Y. (2019) · Deep Blue (University of Michigan) · Cited by 4
Modeling the effects of contention on application performance in multi-user environments
Figueira, S. M. (1997) · Cited by 4
Halving the cost of quantum multiplexed rotationsPreprint
Low, G. H. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.13439 · Cited by 8
Error correction for reliable quantum computing
Fuentes, P. (2022) · Deposito Adademico Digital Universidad De Navarra (University of Navarra) · doi:10.15581/10171/63067 · Cited by 4
(2008) · CRC Press eBooks · doi:10.1201/b15868-2 · Cited by 4
Limitation of maximally entangled probes for single-shot distinguishability of unitaries
Manna, S., Bhowmik, A. D., & Saha, D. (2025) · Physical Review A · doi:10.1103/bsxv-q9x7 · Cited by 4
Behrends, J., & Béri, B. (2025) · PRX Quantum · doi:10.1103/psf5-b6j2 · Cited by 3
Bidart, A., Vaish, P., Kabengele, T., Pang, Y., Liu, Y., & Rubenstein, B. M. (2026) · Annual Review of Physical Chemistry · doi:10.1146/annurev-physchem-082624-084635 · Cited by 6
Coherence as a Resource for Phase Estimation
Ahnefeld, F., Theurer, T., & Plenio, M. B. (2026) · Physical Review Letters · doi:10.1103/s6d5-lc6g · Cited by 3
Probing mean values and correlations of high-spin systems on a quantum computer
Kuzmak, A. R., & Tkachuk, V. M. (2023) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/ad0952 · Cited by 3
Twisty-puzzle-inspired approach to Clifford synthesis
Bao, N., & Hartnett, G. S. (2024) · Physical Review A · doi:10.1103/physreva.109.032409 · Cited by 3
Modelling of q-deformed harmonic oscillator on quantum computer
Samar, M. I., & Tkachuk, V. M. (2024) · Physics Letters A · doi:10.1016/j.physleta.2024.130146 · Cited by 3
Entangled states from arborescent knots
Mironov, S., & Morozov, A. (2024) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.110.126020 · Cited by 3
Feynman Meets Turing: Computability Aspects of Quantum Compiling Revisited
Bock, Y. N., Boche, H., del Toro, Z. G., & Fitzek, F. H. P. (2025) · IEEE Transactions on Computers · doi:10.1109/tc.2025.3626469 · Cited by 3
LeBlond, T., Groszkowski, P., Lietz, J. G., Seck, C. M., & Bennink, R. S. (2025) · Physical Review Research · doi:10.1103/ktb3-gcxr · Cited by 6
Coupled cluster downfolding theory in simulations of correlated systems on quantum hardware
Bauman, N. P., Zheng, M., Liu, C., Myers, N. M., Panyala, A., Peng, B., Li, A., & Kowalski, K. (2025) · Physical Review Research · doi:10.1103/b1t6-ln6v · Cited by 11
Bai, S., Jangir, H., Kirshanova, E., Ngo, T., & Youmans, W. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-01878-6_14 · Cited by 7
Quantum Computing, Cryptography and Compilers
Mosca, M. (2012) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2012.70 · Cited by 3
One-shot static entanglement cost of bipartite quantum channels
Kim, H.-J., & Lee, S. (2021) · Physical Review A · doi:10.1103/physreva.103.062415 · Cited by 3
Fragility of gate-error metrics in simulation models of flux-tunable transmon quantum computers
Lagemann, H., Willsch, D., Willsch, M., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2023) · Physical Review A · doi:10.1103/physreva.108.022604 · Cited by 4
Q-Pandora Unboxed: Characterizing Resilience of Quantum Error Correction Codes Under Biased Noise
Chatterjee, A., Das, S. K., & Ghosh, S. (2025) · Applied Sciences · doi:10.3390/app15084555 · Cited by 3
On Estimating Time-Varying Pauli Noise
Rehman, J. U., Al-Hraishawi, H., Duong, T. Q., Chatzinotas, S., & Shin, H. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3341886 · Cited by 3
Muhamediyeva, D., & Собиров, Р. А. (2024) · E3S Web of Conferences · doi:10.1051/e3sconf/202449404024 · Cited by 3
Quantum Software Ecosystem Design
Basermann, A., Epping, M., Fauseweh, B., Felderer, M., Lobe, E., Röhrig-Zöllner, M., Schmiedinghoff, G., Schuhmacher, P. K., Setyawati, Y., & Weinert, A. (2024) · Springer eBooks · doi:10.1007/978-3-031-64136-7_7 · Cited by 7
Interpolating Parametrized Quantum Circuits Using Blackbox Queries
Simon, L., Eble, H., Kowalski, H.-H., & Radons, M. (2024) · SIAM Journal on Scientific Computing · doi:10.1137/23m1609543 · Cited by 3
Broadbent, A., Karvonen, M., & Lord, S. (2024) · IACR Communications in Cryptology · doi:10.62056/abe0fhbmo · Cited by 8
Universal adjointation of isometry operations using conversion of quantum supermaps
Yoshida, S., Soeda, A., & Murao, M. (2025) · Quantum · doi:10.22331/q-2025-05-20-1750 · Cited by 3
Fundamental Thresholds for Computational and Erasure Errors via the Coherent Information
Colmenárez, L., Kim, S., & Müller, M. (2025) · PRX Quantum · doi:10.1103/d8rx-srpn · Cited by 6
Error scaling in fault tolerant quantum computation
Lanzagorta, M. O., & Uhlmann, J. K. (2011) · Applied Mathematics and Computation · doi:10.1016/j.amc.2011.07.070 · Cited by 3
Generalized Quantum Arthur--Merlin Games
Kobayashi, H., Gall, F. L., & Nishimura, H. (2019) · SIAM Journal on Computing · doi:10.1137/17m1160173 · Cited by 3
Some properties of maximal trace measure of quantum computer error rate
Fedichkin, L. E., & Kurkin, A. (2022) · International Conference on Micro- and Nano-Electronics (ICMNE) · doi:10.1117/12.2624606 · Cited by 3
A SPICE-based Framework to Emulate Quantum Circuits with classical LC Resonators
Islam, M. M., Hossain, S., & Aziz, A. (2023) · International Symposium on Quality Electronic Design (ISQED) · doi:10.1109/isqed57927.2023.10129351 · Cited by 3
Exact performance of the five-qubit code with coherent errors
Liu, C. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04070-6 · Cited by 4
Error metric for non-trace-preserving quantum operations
Shi, Y. B., & Waks, E. (2023) · Physical Review A · doi:10.1103/physreva.108.032609 · Cited by 5
Non‐Markovianity Benefits Quantum Dynamics Simulation
Chen, Y., Zhang, S., & Zhang, S. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500405 · Cited by 6
(2018) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789813238411_0015 · Cited by 3
High-fidelity universal quantum gates
Li, R., & Gaitan, F. (2010) · Quantum Information and Computation · doi:10.26421/qic10.11-12-4 · Cited by 3
Quantum Error Correction and Fault Tolerant Quantum Computing
Grassl, M., & Rötteler, M. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1800-9_152 · Cited by 3
Algorithmes et architectures pour ordinateurs quantiques supraconducteurs
Blais, A. (2003) · Annales de Physique · doi:10.1051/anphys:2003008 · Cited by 3
Some bounds on the minimum number of queries required for quantum channel perfect discrimination
Lu, C. Z., Chen, J., & Duan, R. (2012) · Quantum Information and Computation · doi:10.26421/qic12.1-2-9 · Cited by 3
Towards a Quantum Sampling Theory: The Case of Finite Groups
Garcı́a, A. G., Hernández-Medina, M. A., & Ibort, A. (2019) · Springer proceedings in physics · doi:10.1007/978-3-030-24748-5_11 · Cited by 3
Quantum Approaches to Logic Circuit Synthesis and Testing
Hayes, J. P., & Markov, I. L. (2006) · Defense Technical Information Center (DTIC) · Cited by 3
Rynbach, A. J. V., Ahsan, M., & Kim, J. (2018) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3154837 · Cited by 3
Ultimate limits of approximate unambiguous discrimination
Zhuang, Q. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043276 · Cited by 3
Generalized Quantum Arthur-Merlin Games
Kobayashi, H., Gall, F. L., & Nishimura, H. (2015) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.ccc.2015.488 · Cited by 3
Wang, D. Z., Gauthier, A. Q., Siegmund, A. E., & Hunt, K. L. C. (2021) · Physical Chemistry Chemical Physics · doi:10.1039/d0cp05444e · Cited by 3
Fault-Tolerant Quantum Error Correction and Fault-Tolerant Quantum Computing
Djordjević, I. B. (2021) · Elsevier eBooks · doi:10.1016/b978-0-12-821982-9.00017-4 · Cited by 3
Eisert, J., & Wolf, M. M. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-387-27705-6_8 · Cited by 3
Simultaneous Communication and Parameter Estimation of Pauli Channels
Rehman, J. U., & Shin, H. (2022) · International Conference on Communications · doi:10.1109/icc45855.2022.9838702 · Cited by 3
Entanglement-assisted, noise-assisted, and monitoring-enhanced quantum bath tagging
Farina, D., Cavina, V., Genoni, M. G., & Giovannetti, V. (2022) · Physical Review A · doi:10.1103/physreva.106.042609 · Cited by 3
The unitary dependence theory for characterizing quantum circuits and states
Hu, Z., & Kais, S. (2023) · Communications Physics · doi:10.1038/s42005-023-01188-y · Cited by 4
Quantum Merlin-Arthur proof systems for synthesizing quantum states
Delavenne, H., Gall, F. L., Liu, Y., & Miyamoto, M. (2025) · Quantum · doi:10.22331/q-2025-04-03-1688 · Cited by 3
Disguising quantum channels by mixing and channel distance trade-off
Fung, C.-H. F., & Chau, H. F. (2014) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/47/10/105302 · Cited by 3
Quantum Error-Correcting Codes
Zeng, B., Chen, X., Zhou, D. L., & Wen, X.-G. (2019) · Quantum science and technology · doi:10.1007/978-1-4939-9084-9_3 · Cited by 3
The Fidelity Alternative and Quantum Measurement SimulationPreprint
Hayden, P. M., & Winter, A. (2010) · arXiv (Cornell University) · Cited by 3
Optimal Perfect Distinguishability between Unitaries and Quantum OperationsPreprint
Lu, C. Z., Chen, J., & Duan, R. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1010.2298 · Cited by 3
Partial randomized benchmarking
Dubovitskii, K., & Makhlin, Y. (2022) · Scientific Reports · doi:10.1038/s41598-022-13813-x · Cited by 1
Metadata
- Authors
- Kitaev, A. Y.
- Corresponding author
- Kitaev, A Yu
- ORCID
- Kitaev, A Yu
- Venue
- Russian Mathematical Surveys
- Publisher
- Steklov Mathematical Institute
- Published
- 1997-12-31
- Volume
- 52
- Issue
- 6
- Pages
- 1191-1249
- ISSN
- 0036-0279 (ISSN-L)
- 1468-4829
- OpenAlex
- W2159566537
- Semantic Scholar
- de6bbbce317c9510cd0e624b7c8d66eff5bf8977
- Cited by
- 1,424
- References
- 50
- Citations by year
- 2026: 68 · 2025: 160 · 2024: 118 · 2023: 128 · 2022: 75 · 2021: 89 · 2020: 83 · 2019: 60 · 2018: 52 · 2017: 32 · 2016: 38 · 2015: 34 · 2014: 46 · 2013: 42 · 2012: 34
- FWCI
- 16.04
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Russian Mathematical Surveys (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Keywords
- quantum computing, quantum algorithms, quantum error correction, quantum error-correcting codes, measurement operators, reversible computation, quantum control, mixed states
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-06, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-06 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
