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 601–700 of 1,002
Multiqubit time-varying quantum channels for NISQ-era superconducting quantum processors
Martínez, J. E., Fuentes, P., iOlius, A. D., Garcia‐Frias, J., Fonollosa, J. R., & Crespo, P. M. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.033055 · Cited by 17
Volume thresholds for quantum fault tolerance
Aggarwal, V., Calderbank, A. R., Gilbert, G. N., & Weinstein, Y. S. (2010) · Quantum Information Processing · doi:10.1007/s11128-010-0181-2 · Cited by 14
Quantum binary field inversion: improved circuit depth via choice of basis representation
Amento, B., Rötteler, M., & Steinwandt, R. (2013) · Quantum Information and Computation · doi:10.26421/qic13.1-2-7 · Cited by 14
Banerjee, A., & Pathak, A. (2010) · International Conference on Emerging Trends in Engineering and Technology (ICETET) · doi:10.1109/icetet.2010.70 · Cited by 14
Characterizing the performance of continuous-variable Gaussian quantum gates
Sharma, K., & Wilde, M. M. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.013126 · Cited by 14
Scalable fermionic error correction in Majorana surface codes
Viyuela, O., Vijay, S., & Fu, L. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.99.205114 · Cited by 14
Comparison of quantum channels and statistical experiments
Jenčová, A. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541699 · Cited by 14
Zero-Knowledge Proof Systems for QMA
Broadbent, A., Ji, Z., Song, F., & Watrous, J. (2020) · SIAM Journal on Computing · doi:10.1137/18m1193530 · Cited by 14
Engineering functional quantum algorithms
Klappenecker, A., & Rötteler, M. (2003) · Physical Review A · doi:10.1103/physreva.67.010302 · Cited by 14
Experimental quantum computation with nuclear spins in liquid solution
Harris, J. S., & Vandersypen, L. M. K. (2001) · Cited by 14
A Cat-State Benchmark on a Seven Bit Quantum ComputerPreprint
Knill, E. H., Laflamme, R., Martínez, R., & Tseng, C.-H. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9908051 · Cited by 14
Quantum computation of eigenvalues within target intervals
Jensen, P. W. K., Kristensen, L. B., Kottmann, J. S., & Aspuru-Guzik, A. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abc096 · Cited by 13
Decoding quantum color codes with MaxSAT
Berent, L., Burgholzer, L., Derks, P.-J. H. S., Eisert, J., & Wille, R. (2024) · Quantum · doi:10.22331/q-2024-10-23-1506 · Cited by 13
Virtual quantum resource distillation: General framework and applications
Takagi, R., Yuan, X., Regula, B., & Gu, M. (2024) · Physical Review A · doi:10.1103/physreva.109.022403 · Cited by 13
Quantum Control Machine: The Limits of Control Flow in Quantum Programming
Yuan, C., Villanyi, A., & Carbin, M. (2024) · Proceedings of the ACM on Programming Languages · doi:10.1145/3649811 · Cited by 24
Single-step parity check gate set for quantum error correction
Üstün, G., Morello, A., & Devitt, S. J. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad473c · Cited by 13
Topological Quantum Gates in Homotopy Type Theory
Myers, D. J., Sati, H., & Schreiber, U. (2024) · Communications in Mathematical Physics · doi:10.1007/s00220-024-05020-8 · Cited by 23
Introducing Ambiguity Clustering: An Accurate and Efficient Decoder for qLDPC Codes
Wolanski, S., & Barber, B. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10326 · Cited by 19
Challenges for Reinforcement Learning in Quantum Circuit Design
Altmann, P. J., Stein, J., Kölle, M., Bärligea, A., Zorn, M., Gabor, T., Phan, T., Feld, S., & Linnhoff–Popien, C. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00187 · Cited by 19
Salm, M., Barzen, J., Leymann, F., & Weder, B. (2020) · doi:10.1145/3412451.3428498 · Cited by 14
Combining Hard and Soft Decoders for Hypergraph Product Codes
Grospellier, A., Grouès, L., Krishna, A., & Leverrier, A. (2019) · HAL · Cited by 13
Learning bounds for quantum circuits in the agnostic setting
Popescu, C. M. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03225-7 · Cited by 13
Evaluating Accuracy and Adversarial Robustness of Quanvolutional Neural Networks
Sooksatra, K., Rivas, P., & Orduz, J. (2021) · International Conference on Computational Science and Computational Intelligence (CSCI) · doi:10.1109/csci54926.2021.00097 · Cited by 14
Based on Quantum Topological Stabilizer Color Code Morphism Neural Network Decoder
Ding, L. J., Wang, H., Wang, Y., & Wang, S. (2022) · Quantum Engineering · doi:10.1155/2022/9638108 · Cited by 13
Postselected Quantum Hypothesis Testing
Regula, B., Lami, L., & Wilde, M. M. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3299870 · Cited by 20
Halder, S., Shrikhande, C., & Maitra, R. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0166433 · Cited by 13
ERASER: Towards Adaptive Leakage Suppression for Fault-Tolerant Quantum Computing
Vittal, S., Das, P., & Qureshi, M. K. (2023) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3613424.3614251 · Cited by 14
Manenti, R., & Motta, M. (2023) · doi:10.1093/oso/9780198787488.001.0001 · Cited by 15
Operator quantum error correction for continuous dynamics
Oreshkov, O., Lidar, D. A., & Brun, T. A. (2008) · Physical Review A · doi:10.1103/physreva.78.022333 · Cited by 13
Certifying quantum memories with coherence
Simnacher, T., Wyderka, N., Spee, C., Yu, X., & Gühne, O. (2019) · Physical Review A · doi:10.1103/physreva.99.062319 · Cited by 13
Mitigation of Decoherence-Induced Quantum-Bit Errors and Quantum-Gate Errors Using Steane’s Code
Cane, R., Chandra, D., Ng, S. X., & Hanzo, L. (2020) · IEEE Access · doi:10.1109/access.2020.2991802 · Cited by 13
One-Shot Manipulation of Entanglement for Quantum Channels
Kim, H.-J., Lee, S., Lami, L., & Plenio, M. B. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3079938 · Cited by 14
Dissipative preparation of generalized Bell states
Sweke, R., Sinayskiy, I., & Petruccione, F. (2013) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/46/10/104004 · Cited by 13
Random walks in Euclidean space
Varjú, P. P. (2014) · Annals of Mathematics · doi:10.4007/annals.2015.181.1.4 · Cited by 13
THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT
Renes, J. M. (2013) · International Journal of Quantum Information · doi:10.1142/s0219749913300027 · Cited by 14
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
van Dam, W., Magniez, F., Mosca, M., & Sántha, M. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539702404377 · Cited by 13
Towards Large-Scale Quantum ComputationPreprint
Fowler, A. G. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0506126 · Cited by 15
Norms and Cones in the Theory of Quantum EntanglementPreprint
Johnston, N. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.1479 · Cited by 13
Quantum-Proof Randomness Extractors via Operator Space Theory
Berta, M., Fawzi, O., & Scholz, V. B. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2627531 · Cited by 12
Liu, H.-T., Chen, B., Zhang, J., Xiao, Y.-X., Li, T., Huang, K., Wang, Z., Li, H., Zhao, K., Xu, Y., et al. (2025) · Physical Review Letters · doi:10.1103/lvb9-pfr3 · Cited by 12
Quantum computing with trapped ions: a beginner’s guide
Bernardini, F., Chakraborty, A., & ORDÓÑEZ, C. R. (2023) · European Journal of Physics · doi:10.1088/1361-6404/ad06be · Cited by 12
Kuroiwa, K., Takagi, R., Adesso, G., & Yamasaki, H. (2024) · Physical Review A · doi:10.1103/physreva.109.042403 · Cited by 19
Complexity is not enough for randomness
Guo, S., Sasieta, M., & Swingle, B. G. (2024) · SciPost Physics · doi:10.21468/scipostphys.17.6.151 · Cited by 20
Usefulness of an enhanced Kitaev phase-estimation algorithm in quantum metrology and computation
Kaftal, T., & Demkowicz-Dobrzański, R. (2014) · Physical Review A · doi:10.1103/physreva.90.062313 · Cited by 12
A simple protocol for fault tolerant verification of quantum computation
Gheorghiu, A., Hoban, M. J., & Kashefi, E. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aaeeb3 · Cited by 14
Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes
Wang, D., Wang, Y.-J., Cao, N., Zeng, B., & Laflamme, R. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac4737 · Cited by 12
Chen, Q., Du, Y., Jiao, Y., Lu, X., Wu, X., & Zhao, Q. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad420a · Cited by 19
Quantum Commitments from Complexity Assumptions
Chailloux, A., Kerenidis, I., & Rosgen, B. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22006-7_7 · Cited by 12
Quantum compiling with diffusive sets of gates
Zhiyenbayev, Y., Akulin, V. M., & Mandilara, A. (2018) · Physical Review A · doi:10.1103/physreva.98.012325 · Cited by 12
Topological dynamical decoupling
Zhang, J., Yu, X.-D., Long, G.-L., & Xue, Q.-K. (2019) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-019-9447-5 · Cited by 12
Simulating extremal temporal correlations
Spee, C., Budroni, C., & Gühne, O. (2020) · New Journal of Physics · doi:10.1088/1367-2630/abb899 · Cited by 12
Characterization of universal two-qubit Hamiltonians
Childs, A. M., Leung, D., Mančinska, L., & Ozols, M. (2011) · Quantum Information and Computation · doi:10.26421/qic11.1-2-3 · Cited by 12
Bounds on the Distance Between a Unital Quantum Channel and the Convex Hull of Unitary Channels
Yu, N., Duan, R., & Xu, Q. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2641447 · Cited by 12
The Hidden Subgroup Problem and Post-quantum Group-Based Cryptography
Horan, K., & Kahrobaei, D. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96418-8_26 · Cited by 12
Eliminating intermediate measurements in space-bounded Quantum computation
Fefferman, B., & Remscrim, Z. (2021) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3406325.3451051 · Cited by 24
Poly-Locality in Quantum Computing
Freedman, M. H. (2002) · Foundations of Computational Mathematics · doi:10.1007/s102080010020 · Cited by 12
Correlated errors can lead to better performance of quantum codes
Shabani, A. (2008) · Physical Review A · doi:10.1103/physreva.77.022323 · Cited by 12
Non-Identity Check Remains QMA-Complete for Short CircuitsPreprint
Ji, Z., & Wu, X. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0906.5416 · Cited by 12
Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation
Reif, J. H. (1998) · Lecture notes in computer science · doi:10.1007/978-3-540-49382-2_10 · Cited by 12
Efficient implementation of unitary transformationsPreprint
Lloyd, S., & Maity, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.03431 · Cited by 12
Senapati, P., Wang, Z., Jiang, W., Humble, T. S., Fang, B., Xu, S., & Guan, Q. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00060 · Cited by 11
Calculating the many-body density of states on a digital quantum computer
Summer, A., Chiaracane, C., Mitchison, M. T., & Goold, J. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013106 · Cited by 17
Exploiting many-body localization for scalable variational quantum simulation
Cao, C., Zhou, Y., Tannu, S., Shannon, N., & Joynt, R. (2025) · Quantum · doi:10.22331/q-2025-12-12-1942 · Cited by 20
Yang, S., & Calderbank, R. (2025) · Quantum · doi:10.22331/q-2025-04-07-1693 · Cited by 11
Wald, S., Yao, L. H., Platini, T., Hooley, C., & Carollo, F. (2025) · Quantum · doi:10.22331/q-2025-05-13-1742 · Cited by 11
Mallick, B., Maity, A. G., Ganguly, N., & Majumdar, A. S. (2025) · Physical Review A · doi:10.1103/nzrc-8yrt · Cited by 11
Valentini, M., van Mourik, M. W., Butt, F., Wahl, J., Dietl, M., Pfeifer, M., Anmasser, F., Colombe, Y., Rössler, C., Holz, P. C., et al. (2025) · Physical Review X · doi:10.1103/b9s1-6r44 · Cited by 19
Quantum-error-correction implementation after multiple gates
Weinstein, Y. S. (2013) · Physical Review A · doi:10.1103/physreva.88.012325 · Cited by 11
Quantum error correction during 50 gates
Weinstein, Y. S. (2014) · Physical Review A · doi:10.1103/physreva.89.020301 · Cited by 11
Learning DNFs under product distributions via mu--biased quantum Fourier sampling
Kanade, V., Rocchetto, A., & Simone Severini, B. (2019) · Quantum Information and Computation · doi:10.26421/qic19.15-16-1 · Cited by 11
Das, S., & Wilde, M. M. (2019) · Physical Review A · doi:10.1103/physreva.100.030302 · Cited by 13
Shaffer, R., Ren, H., Dyrenkova, E., Yale, C. G., Lobser, D., Burch, A. D., Chow, M. N. H., Revelle, M., Clark, S., & Häffner, H. (2023) · Quantum · doi:10.22331/q-2023-05-04-997 · Cited by 13
The battle of clean and dirty qubits in the era of partial error correction
Bultrini, D., Wang, S., Czarnik, P., Gordon, M. H., Cerezo, M., Coles, P. J., & Cincio, Ł. (2023) · Quantum · doi:10.22331/q-2023-07-13-1060 · Cited by 11
A Case for Synthesis of Recursive Quantum Unitary Programs
Deng, H., Tao, R., Peng, Y., & Wu, X. (2024) · Proceedings of the ACM on Programming Languages · doi:10.1145/3632901 · Cited by 14
Sufficient Condition for Universal Quantum Computation Using Bosonic Circuits
Calcluth, C., Reichel, N., Ferraro, A., & Ferrini, G. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020337 · Cited by 16
Polynomial Equivalence of Complexity Geometries
Brown, A. R. (2024) · Quantum · doi:10.22331/q-2024-07-02-1391 · Cited by 11
Quantum Broadcast Channel Simulation via Multipartite Convex Splitting
Berta, M., Cheng, H., & Gao, L. (2025) · Communications in Mathematical Physics · doi:10.1007/s00220-024-05191-4 · Cited by 21
Quantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning
Zen, R. A. M., Ollé, J., Colmenárez, L., Puviani, M. B., Müller, M., & Marquardt, F. (2025) · Physical Review X · doi:10.1103/gqpr-dgz7 · Cited by 38
Generalized state spaces and nonlocality in fault-tolerant quantum-computing schemes
Ratanje, N., & Virmani, S. (2011) · Physical Review A · doi:10.1103/physreva.83.032309 · Cited by 11
Chandra, D., Babar, Z., Nguyen, H. V., Alanis, D., Botsinis, P., Ng, S. X., & Hanzo, L. (2019) · IEEE Access · doi:10.1109/access.2019.2936795 · Cited by 11
Density matrix simulation of quantum error correction codes for near-term quantum devices
Baek, C., Ostuka, T., Tarucha, S., & Choi, B.-S. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/ab5887 · Cited by 12
Device-Independent Quantum Information Processing
Arnon-Friedman, R. (2020) · Springer theses · doi:10.1007/978-3-030-60231-4 · Cited by 14
A quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth O(log^2n)
Rötteler, M., & Steinwandt, R. (2014) · Quantum Information and Computation · doi:10.26421/qic14.9-10-11 · Cited by 11
Rong, X., Lu, D., Kong, X., Geng, J., Wang, Y., Shi, F., Duan, C., & Du, J. (2016) · Advances in Physics X · doi:10.1080/23746149.2016.1266914 · Cited by 11
High-Threshold Code for Modular Hardware With Asymmetric Noise
Xu, X., Zhao, Q., Yuan, X., & Benjamin, S. C. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.12.064006 · Cited by 14
Experimental Challenges of Implementing Quantum Phase Estimation Algorithms on IBM Quantum ComputerPreprint
Mohammadbagherpoor, H., Oh, Y.-H., Singh, A., Yu, X., & Rindos, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.07605 · Cited by 11
Williamson, D. J., & Baspin, N. (2024) · Nature Communications · doi:10.1038/s41467-024-53881-3 · Cited by 22
A General Theory of Comparison of Quantum Channels (and Beyond)
Jenčová, A. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3070120 · Cited by 11
Quantum repetition codes as building blocks of large-period discrete time crystals
Bomantara, R. W. (2021) · Physical review. B./Physical review. B · doi:10.1103/physrevb.104.l180304 · Cited by 10
Quantum outage probability for time-varying quantum channels
Martínez, J. E., Fuentes, P., Crespo, P. M., & Garcia‐Frias, J. (2022) · Physical Review A · doi:10.1103/physreva.105.012432 · Cited by 11
Holdsworth, T., Singh, V., & Wilde, M. M. (2023) · Physical Review A · doi:10.1103/physreva.107.012428 · Cited by 13
Distributing quantum states with finite lifetime
Maranò, S., & Win, M. Z. (2023) · Physical Review A · doi:10.1103/physreva.107.052413 · Cited by 10
Choukroun, Y., & Wolf, L. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i1.27756 · Cited by 13
QuTracer: Mitigating Quantum Gate and Measurement Errors by Tracing Subsets of Qubits
Li, P., Liu, J., Gonzales, A., Saleem, Z. H., Zhou, H., & Hovland, P. (2024) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca59077.2024.00018 · Cited by 13
Circuit knitting facing exponential sampling-overhead scaling bounded by entanglement cost
Jing, M., Zhu, C., & Wang, X. (2025) · Physical Review A · doi:10.1103/physreva.111.012433 · Cited by 17
Mullinax, J. W., Anastasiou, P. G., Larson, J. M., Economou, S. E., & Tubman, N. M. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00150 · Cited by 13
Maximum advantage of quantum illumination
Ray, S. M., Schneeloch, J., Tison, C. C., & Alsing, P. M. (2019) · Physical Review A · doi:10.1103/physreva.100.012327 · Cited by 10
Energy levels estimation on a quantum computer by evolution of a physical quantity
Gnatenko, K. P., Laba, H. P., & Tkachuk, V. M. (2021) · Physics Letters A · doi:10.1016/j.physleta.2021.127843 · Cited by 12
A Conceptually Simple Proof of the Quantum Reverse Shannon Theorem
Berta, M., Christandl, M., & Renner, R. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-18073-6_11 · Cited by 10
Symmetry-protected adiabatic quantum transistors
Williamson, D. J., & Bartlett, S. D. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/5/053019 · Cited by 11
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
