Pith. sign in

REVIEW 3 major objections 6 minor 31 references

1D Cluster State Generation On Superconducting Hardware

T0 review · 3 major / 6 minor · reviewed 2026-08-05 · deepseek-v4-flash

Pith's one-line read One global Hamiltonian pulse creates a 1D cluster state from a charge-qubit chain at every odd multiple of π.

desk verdict A sound re-derivation of You et al.'s cluster-state protocol with a T1/T2 simulation whose headline numbers depend on an unstated coupling scale. read the letter →

arxiv 2508.21798 v2 pith:HCHMJZZ3 submitted 2025-08-29 quant-ph physics.app-ph

classification quant-phphysics.app-ph
keywords clusterstatesmeasurement-basedquantumcomputationchargequbitssuperconductingcircuitsHamiltonianevolutiondecoherenceT2dephasingT1relaxation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper tries to show that a linear array of superconducting charge qubits, with interaction strengths tuned to balance single-qubit and two-qubit terms, can be converted into a 1D cluster state by letting a single global Hamiltonian act for a fixed time. The derivation rewrites the Hamiltonian as ℏg times a sum of commuting nearest-neighbor projectors, so the evolution factorizes exactly; at gt=(2n+1)π each factor is a controlled phase that flips only the |+⟩|+⟩ component, yielding the cluster state in a basis-rotated form. This matters because cluster states are the universal resource for measurement-based quantum computing, and one-step generation avoids the gate overhead that plagues the circuit model. For a 4-qubit instance the paper verifies the state and simulates decoherence: ideal revivals reach near-unity fidelity, T1 relaxation keeps the first peak above 90%, T2 dephasing drags later peaks to about 70%, and combined noise drops post-projection coherence to 50% within 15 time units.

What carries the argument

The object carrying the argument is the pairwise projector Π_iΠ_{i+1}, where Π_i projects onto the σ^x eigenstate |+⟩_i=(|0⟩_i−|1⟩_i)/√2. After the parameter conditions of Eq. (7), the array Hamiltonian becomes H_A=ℏg∑_{i=1}^{N-1}Π_iΠ_{i+1}; since all these projectors are diagonal in the x-basis, they commute, so the evolution U(t) factorizes into independent two-qubit factors. At the special time gt=(2n+1)π each factor reduces to I−2Π_iΠ_{i+1}, a gate that applies −1 only when both qubits are in |+⟩, and the product of these gates converts the initial |0⟩ string into the X-basis product form Eq. (10) that is the cluster state.

What would settle it

Fix g explicitly (for example gT1=1), simulate or run the four-qubit evolution, and measure the fidelity to the ideal cluster state at t=π/g and at the fourth revival; if T2-only fidelity does not drop to roughly the reported 70% level at the fourth revival, or if the stabilizers S_i=Z_{i-1}X_iZ_{i+1} are not all +1 at t=π/g in the noise-free case, the central claim fails.

Watch

Extended reading notes

Core claim

The central claim is that the unitary U(t)=∏_{i=1}^{N-1}[I−2Π_iΠ_{i+1}], with Π_i=(1−σ_i^x)/2, generated by the tuned Hamiltonian at gt=(2n+1)π, maps |0⟩^⊗N to |ψ⟩=2^{-N/2}∏_{i=1}^{N}(|−⟩_i+|+⟩_i σ^x_{i+1}) with σ^x_{N+1}=I. The paper calls this "precisely our desired cluster state" and proves it by applying a Hadamard to every qubit: H^{⊗N}|ψ⟩=∏ CZ_{i,i+1}|+⟩^{⊗N}, the standard linear cluster state. Numerical simulation of the 4-qubit case shows fidelity peaks near 100% at the odd multiples of π predicted by the argument; including T1 reduces the first peak to above 90% and later revivals to roughly 80%, while pure T2 dephasing brings the fourth revival to about 70%. Under combined T1+T2 no

Load-bearing premise

The quantitative fidelity and coherence claims rest on an unstated coupling scale g that converts the revival times gt=(2n+1)π into the same time axis as the adopted coherence times T1 and T2; if g differs, every headline percentage changes. The protocol also assumes a single flux value per qubit can simultaneously satisfy the boundary and interior balance conditions of Eq. (7) across the whole chain.

Editorial extensions

If this is right

  • A cluster state for MBQC can be prepared by one global interaction pulse at t=π/g rather than by a sequence of two-qubit CZ gates, removing per-gate overhead in the resource-preparation stage.
  • The revival condition gt=(2n+1)π gives discrete preparation times; since T2 degradation grows with each revival, the first window at t=π is the practical operating point.
  • T2 dephasing is the dominant error source for this protocol, so hardware and pulse engineering that lengthen T2 or refocus low-frequency noise matter more than improving T1.
  • Because the factorization argument holds for any chain length N, the protocol extends to larger 1D clusters analytically; the obstacle to scaling is decoherence, not the derivation.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If g is raised while coherence times stay fixed, the first revival moves to earlier physical time and all reported fidelities should improve; publishing g alongside the coherence times would make the 15-time-unit coherence curve a testable physical prediction.
  • The same projector-commutation trick is specific to a one-dimensional chain: on a 2D cluster graph, neighboring pair projectors share qubits and do not all commute, so this one-step construction does not trivially generalize.
  • A minimal experimental certificate would be to measure the stabilizers S_1=X_1Z_2, S_i=Z_{i-1}X_iZ_{i+1}, S_N=Z_{N-1}X_N at t=π/g; all should return expectation +1 if the produced state is the claimed cluster state.
  • The Hamiltonian's projector form suggests a refocusing strategy: because the unitary at gt=π is a constant entangler, inserting a global σ^x π-pulse between two half-evolution intervals might partially cancel dephasing while keeping the same cluster-state endpoint.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The paper re-derives and simulates a one-step Hamiltonian protocol for generating 1D cluster states on superconducting charge-qubit arrays, following You et al. It rewrites a flux-tuned Ising-type Hamiltonian as a sum of two-qubit projectors (Eq. 8), shows that evolution at gt=(2n+1)π implements a product of controlled-phase-like operations, and identifies the output with a standard cluster state via a Hadamard rotation (Sec. 3.4). Numerical simulations with QuTiP for 4 qubits compare ideal, T1-only, T2-only, and combined decoherence, reporting that T2 degrades fidelity more than T1. The paper concludes that MBQC protocols need synchronization with high-coherence windows and targeted error mitigation.

Significance. If the derivation and noise comparison are correct, this is a useful pedagogical replication of You et al.'s protocol, with the virtue of an explicit and apparently correct algebraic check: the projector-exponential identity in the Appendix is sound, and the Hadamard verification in Sec. 3.4 provides a genuine non-circular identification with the standard CZ-based cluster state. The paper does not present new experimental data, but the analytic result that the evolution produces a cluster state at revival times is valuable. However, the quantitative noise results are not currently grounded because the coupling scale and the Lindblad operators are unspecified, and the physical realizability of the tuning conditions is asserted rather than proven.

major comments (3)
  1. [Section 5, Eq. (9)] The numerical results in Figs. 2–5 depend on the unstated coupling g. The revival condition is gt=(2n+1)π, so the peaks occur at t=(2n+1)π/g. T1 and T2 are given as absolute times (262.69 μs and 176.67 μs, Sec. 4.3), but the paper never converts the simulation time axis to physical seconds. Thus 'fidelity >90%', '~70% by the fourth revival', and 'coherence drops to 50% within 15 time units' are functions of the unknown dimensionless products gT1 and gT2. Changing g changes whether the revivals occur before or after significant decoherence. Without specifying g (or reporting results as functions of gT1/gT2), the headline quantitative claims are not reproducible. This is a central, load-bearing omission, not a cosmetic one.
  2. [Section 4.3] The Lindblad collapse operators are not defined. A master-equation simulation requires explicit jump operators for T1 (e.g., σ^- = |0⟩⟨1| in the charge basis, or its counterpart in the σ^x eigenbasis) and for pure dephasing (e.g., σ^z or σ^x). For the Hamiltonian in Eq. (8), the natural qubit basis is the σ^x eigenbasis, but the paper does not state which basis was used or how T1 and T2 were mapped onto operators. Different choices yield different fidelity curves and can affect the T1-vs-T2 ranking. Specify the collapse operators and any frame transformations used in the QuTiP simulation.
  3. [Section 3.1, Eq. (7)] The existence of a flux configuration satisfying Eq. (7) is asserted, not derived. Λ_{i,i+1} in Eq. (5) depends on both Φ_i and Φ_{i+1}, while E_Ji in Eq. (4) depends on Φ_i. The conditions 1/2 E_Ji = Λ_{i,i+1} for i=2,...,N−1 and E_J1 = Λ_{1,2} = E_JN are therefore a system of coupled equations across the chain. The claim that 'there is always a unique flux value Φ_i' is not shown for the chain with boundaries, and no concrete parameter set is provided. Since Eq. (8) — and hence Eq. (10) — uses Eq. (7) as a premise, this gap weakens the link between the abstract cluster-state construction and the proposed charge-qubit hardware. The authors should either prove existence of a simultaneous solution or explicitly state the tuning as an idealization and discuss its approximate realizability.
minor comments (6)
  1. [Abstract and Section 5.5] The abstract says 'under noise T2 decays to 50% within 15 time units', while Sec. 5.5 reports that under combined decoherence the coherence drops to 50%, with T1-only remaining above 70%. Please clarify which noise model is behind the 50% value. The conclusion that T2 is more harmful than T1 is best supported by a direct T2-only comparison, not by the combined-channel curve.
  2. [Section 4.2] Equation numbering is duplicated: Eqs. (7) and (8) are already used in Sec. 3.1 for the tuning conditions and the projective Hamiltonian. The fidelity definitions in Sec. 4.2 should be renumbered (e.g., Eqs. (11) and (12)).
  3. [Section 3.1 / 3.2] The projector notation changes between sections: Eq. (1a) uses Π^± = (1±σ^x)/2, while Sec. 3.2 defines Π_i = (1−σ^x_i)/2 and assigns |+⟩ the eigenvalue −1. This convention is internally consistent after the 'Important Convention' note, but it would help to explicitly state that Π_i in Sec. 3.2 is Π^− in the earlier notation, to avoid reader confusion.
  4. [Section 4.3] The simulation adopts IBM 'transmon charge qubit' coherence times (T1=262.69 μs, T2=176.67 μs), but the protocol assumes charge qubits in the charging regime E_c ≫ E_J. Transmons operate in the opposite regime E_J ≫ E_C. Please justify the transferability of these coherence parameters to the modeled system, or rephrase the hardware context.
  5. [References] References [17] and [18] are identical (Lanyon et al., same journal, volume, pages, and year). Please remove the duplicate.
  6. [Figures] The figures appear as placeholders in the manuscript. For a journal submission, include the actual fidelity/coherence plots with labeled axes, physical units (or a clear 'units of 1/g' label), and the simulation parameters used. This is particularly important given the missing g discussed in the major comments.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the cluster-state derivation is self-contained and independently verified against the standard CZ-based cluster state.

full rationale

The paper's central derivation (Eqs. 1-10) is a self-contained construction, not a disguised restatement of its inputs. The parameter conditions in Eq. (7) are deliberately imposed to reduce the charge-qubit Hamiltonian to H = ℏg Σ Π_iΠ_{i+1}; the unitary then factorizes because the projectors commute, and at gt=(2n+1)π each factor becomes I-2Π_iΠ_{i+1}. Applying this to |0>⊗N yields Eq. (10). The target state is not defined as the output of this evolution: Section 3.4 independently verifies that H⊗N|Ψ> equals the standard CZ-based linear cluster state Π CZ_i,i+1|+>⊗N via explicit Hadamard conjugation. This is an external algebraic check, so the 'cluster state' label is not being assigned by construction. No fitted parameter is renamed as a prediction; the noise simulations use standard IBM coherence times [1] and Lindblad dynamics, and the qualitative T2-vs-T1 comparison is a consequence of the adopted noise model, not a circular fit. The omission of the coupling scale g is a reproducibility gap but does not make any derivation equivalent to its inputs. There are no load-bearing self-citations: the cited Hamiltonian source [29] is not by the present author, and the paper rederives the steps rather than merely invoking the citation. Overall, the analytical core is sound and self-contained, with no circular step.

Assumptions & free parameters 2 free parameters · 5 assumptions · 0 invented entities

The paper introduces no new physical entities. The core derivation is parameter-free given the Hamiltonian of Ref. [29] and the tuning conditions in Eq. (7), which are construction choices. The load-bearing missing number is the coupling scale g: with T1 and T2 given in microseconds and the time axis in units of 1/g, every reported percentage is set by the unstated products gT1 and gT2. The noise model and coherence values are external assumptions, and the simultaneous flux-tunability of Eq. (7) is asserted rather than demonstrated.

free parameters (2)
  • interaction scale g (equivalently gT1, gT2) = not stated
    The Hamiltonian is H = ℏg Σ ΠiΠi+1 (Eqs. (8)-(9)). All revival times and all noise-affected fidelities in Section 5 depend on g, which is never given. T1 and T2 are absolute times, so the dimensionless products gT1 and gT2 determine every reported percentage.
  • tuning conditions on EJ and Λ (Eq. 7) = EJ1 = Λ1,2 = EJN = ℏg/4; EJi/2 = Λi,i+1 = ℏg/4 for interior i
    These relations are chosen by hand so the Hamiltonian becomes a sum of projectors. They are a construction inherited from You et al. [29], not fitted to data, but they are a design choice required for the derivation to work.
assumptions (5)
  • domain assumption Lindblad master equation with T1 and T2 collapse operators is the correct noise model for this protocol
    Section 4.3 adopts this model with no microscopic or spectral justification, and applies transmon coherence values to a charge-qubit protocol.
  • domain assumption The charge qubit operates in the charging regime Eci ≫ EJi and can be tuned to the degeneracy point CiVi/e = 1 where εi = 0
    Invoked in Section 3.1, Eqs. (3)-(6), to reduce the single-qubit Hamiltonian to −EJi σx.
  • domain assumption A flux value Φi in [0, Φ0/2] satisfies Eq. (7) simultaneously for all qubits in the chain
    Section 3.1 asserts "there is always a unique flux value" per qubit, but the simultaneous satisfaction of the boundary conditions (EJ1 = Λ1,2, EJN = ΛN−1,N) and interior conditions (EJi/2 = Λi,i+1) is not proven.
  • standard math For an idempotent operator A, e^{−iθA} = I + (e^{−iθ} − 1)A
    Appendix 1; proved by power series expansion in the paper.
  • standard math Hadamard basis-change rules H|+⟩ = |1⟩, H|−⟩ = |0⟩, and HσxH = σz
    Section 3.4; verified by direct matrix multiplication in the paper and used to identify the X-basis state with the standard cluster state.

how reviews work

0 comments
Cite this review

Pith. "Pith review of 1D Cluster State Generation On Superconducting Hardware." pith.science (2026). https://pith.science/paper/HCHMJZZ3

@misc{pith2026250821798,
  author       = {Pith},
  title        = {Pith review of: 1D Cluster State Generation On Superconducting Hardware},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HCHMJZZ3}},
  note         = {Machine review of arXiv:2508.21798}
}
abstract

Measurement-based Quantum Computation(MBQC) utilize entanglement as resource for performing quantum computation. Generating cluster state using entanglement as resource is a key bottleneck for the adoption of MBQC. To generate cluster state with charge-qubit arrrays, we provide analytical derivations and numerical validations for 4-qubit cluster state. We compare our fidelities under ideal (noise-free) Hamiltonian evolution and due to effect of decoherence. We show incorporating energy relaxation ($T_1$) yields $>$90\% fidelity while pure dephasing $T_2$ show $70\%$ decays at fourth harmonics. We further show under noise $T_2$ decays to 50\% within 15 time units, versus $>$70\% under relaxation time units ($T_1$)--only. This decay quantify degradation effect of $T_2$ on preparing cluster--state preparation is more than $T_1$. We highlight the critical need for targeted error-mitigation strategies in near-term MBQC implementations.

Figures

Figures reproduced from arXiv: 2508.21798 by the authors.

Figure 1
Figure 1. Ideal evolution fidelity of The 4-qubit Cluster State Generating Hamiltonian. [PITH_FULL_IMAGE:figures/full_fig_p017_1.png] view at source ↗
Figure 2
Figure 2. T1 decoherence fidelity for 4-Qubit Cluster State Generation Hamiltonian 5.3 T2 Dephasing Introducing pure dephasing T2 leads to a faster drop in oscillation contrast. While the first peak still exceeds 90%, subsequent revivals decline to around 70% by the fourth. This matches our expectation that loss of phase coherence is more detrimental than energy decay alone for this protocol. 17 [PITH_FULL_IMAGE:figures/full… view at source ↗
Figure 3
Figure 3. T2 decoherence fidelity plot of 4-qubit Cluster State Generation 5.4 Combined Decoherence When both T1 and T2 act together, fidelity peaks shrink most dramatically: the first revival is near 85%, and later peaks fall below 70%. This worst-case scenario underscores the challenge of cluster-state preparation on real hardware [PITH_FULL_IMAGE:figures/full_fig_p018_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Combined fidelity plot of 4-qubit Cluster State Generation [PITH_FULL_IMAGE:figures/full_fig_p018_4.png]
Figure 5
Figure 5. Figure 5: Coherence-decay plot for 4-qubit Cluster State Generated at time [PITH_FULL_IMAGE:figures/full_fig_p019_5.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

31 extracted references · 9 canonical work pages

  1. [1]

    IBM Quantum Computers: Evolution, Performance, and Future Directions

    M. AbuGhanem. “IBM Quantum Computers: Evolution, Performance, and Future Directions”. In: arXiv preprint arXiv:2410.00916 (2024). doi: 10.48550/arXiv. 2410.00916

  2. [2]

    Adiabatic quantum computation

    Tameem Albash and Daniel A. Lidar. “Adiabatic quantum computation”. In: Rev. Mod. Phys.90.1 (2018), p. 015002. doi: 10.1103/RevModPhys.90.015002

  3. [3]

    R. N. Alexander et al. QuTiP: Quantum Toolbox in Python. 2024. arXiv: 2412. 04705 [quant-ph]

  4. [4]

    The coherent interaction between matter and radiation: A tutorial on the Jaynes–Cummings model

    Matteo Bina. “The coherent interaction between matter and radiation: A tutorial on the Jaynes–Cummings model”. In: Eur. Phys. J. Spec. Top.203 (2012), pp. 163–

  5. [5]

    Measurement-based quantum computation

    Hans J. Briegel et al. “Measurement-based quantum computation”. In: Nat. Phys. 5.1 (2009), pp. 19–26. doi: 10.1038/nphys1157

  6. [6]

    Noise-Resilient Quantum Computing with a Nitrogen-Vacancy Center and Nuclear Spins

    J. Casanova, Z.-Y. Wang, and M. B. Plenio. “Noise-Resilient Quantum Computing with a Nitrogen-Vacancy Center and Nuclear Spins”. In: Phys. Rev. Lett.117 (13 Sept. 2016), p. 130502. doi: 10 . 1103 / PhysRevLett . 117 . 130502. url: https : //link.aps.org/doi/10.1103/PhysRevLett.117.130502

  7. [7]

    Silicon carbide color centers for quantum applications

    Stefania Castelletto and Alberto Boretti. “Silicon carbide color centers for quantum applications”. In: J. Phys.: Photonics 2.2 (2020), p. 022001. doi: 10.1088/2515- 7647/ab77a2

  8. [8]

    Superconducting quantum bits

    John Clarke and Frank K. Wilhelm. “Superconducting quantum bits”. In: Nature 453.7198 (2008), pp. 1031–1042. doi: 10.1038/nature07128

Show all 31 references
  1. [9]

    Superconducting Circuits for Quan- tum Information: An Outlook

    Michel H. Devoret and Robert J. Schoelkopf. “Superconducting Circuits for Quan- tum Information: An Outlook”. In: Science 339.6124 (2013), pp. 1169–1174. doi: 10.1126/science.1231930

  2. [10]

    Simulating physics with computers

    Richard P. Feynman. “Simulating physics with computers”. In: Int. J. Theor. Phys. 21.6–7 (1982), pp. 467–488. doi: 10.1007/BF02650179

  3. [11]

    Freedman et al

    Michael H. Freedman et al. Topological Quantum Computation. 2002. arXiv: quant- ph/0101025 [quant-ph]. 20

  4. [12]

    Stabilizer Codes and Quantum Error Correction

    Daniel Gottesman. “Stabilizer Codes and Quantum Error Correction”. Ph.D. thesis. California Institute of Technology, 1997. url: https://arxiv.org/abs/quant- ph/9705052

  5. [13]

    Graham and Mark Saffman

    Thomas M. Graham and Mark Saffman. Fast Feedback for Measurement-Based Quantum Computation with Neutral Atoms. 2024. url: https://purl.stanford. edu/py978gh8681

  6. [14]

    Fidelity for Mixed Quantum States

    Richard Jozsa. “Fidelity for Mixed Quantum States”. In: J. Mod. Opt.41.12 (1994), pp. 2315–2323. doi: 10.1080/09500349414552171

  7. [15]

    Trotterization in Quantum Theory

    Physics Claire Kluber. “Trotterization in Quantum Theory”. In: (2025). arXiv: 2310.13296 [quant-ph]. url: https://arxiv.org/abs/2310.13296

  8. [16]

    Charge-insensitive qubit design derived from the Cooper pair box

    Jens Koch et al. “Charge-insensitive qubit design derived from the Cooper pair box”. In: Phys. Rev. A76.4 (2007), p. 042319. doi: 10.1103/PhysRevA.76.042319

  9. [18]

    Measurement-Based Quantum Computation with Trapped Ions

    B. P. Lanyon et al. “Measurement-Based Quantum Computation with Trapped Ions”. In: Phys. Rev. Lett.111 (21 Nov. 2013), p. 210501.doi: 10.1103/PhysRevLett. 111.210501 . url: https://link.aps.org/doi/10.1103/PhysRevLett.111. 210501

  10. [19]

    Orchestrating Measurement-Based Quantum Computation over Photonic Quantum Processors

    Yingheng Li et al. “Orchestrating Measurement-Based Quantum Computation over Photonic Quantum Processors”. In: Proceedings of the 60th Annual ACM/IEEE Design Automation Conference. DAC ’23. San Francisco, California, United States: IEEE Press, 2025, pp. 1–6. isbn: 979835032348...

  11. [20]

    Quantum-state engineering with Josephson-junction devices

    Yuriy Makhlin, Gerd Sch¨ on, and Alexander Shnirman. “Quantum-state engineering with Josephson-junction devices”. In: Rev. Mod. Phys.73.2 (2001), pp. 357–400. doi: 10.1103/RevModPhys.73.357

  12. [21]

    Rabi oscillations in a large Josephson-junction qubit

    John M. Martinis et al. “Rabi oscillations in a large Josephson-junction qubit”. In: Phys. Rev. Lett.89.11 (2002), p. 117901. doi: 10.1103/PhysRevLett.89.117901

  13. [22]

    Nielsen and Isaac L

    Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge: Cambridge University Press,

  14. [23]

    Quantum Computing in the NISQ Era and Beyond

    John Preskill. “Quantum Computing in the NISQ Era and Beyond”. In: Quantum 2 (2018), p. 79. doi: 10.22331/q-2018-08-06-79

  15. [24]

    A One-Way Quantum Computer

    Robert Raussendorf and Hans J. Briegel. “A One-Way Quantum Computer”. In: Phys. Rev. Lett.86.22 (2001), pp. 5188–5191.doi: 10.1103/PhysRevLett.86.5188

  16. [25]

    Suppressing charge noise decoherence in superconducting charge qubits

    J. A. Schreier et al. “Suppressing charge noise decoherence in superconducting charge qubits”. In: Phys. Rev. B 77 (2008), p. 180502. doi: 10.1103/PhysRevB. 77.180502

  17. [26]

    Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

    Peter W. Shor. “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”. In: SIAM J. Comput.26.5 (1997), pp. 1484–

  18. [28]

    Quantum walks: a comprehensive review

    Salvador El ´ ıas Venegas-Andraca. “Quantum walks: a comprehensive review”. In: Quantum Inf. Process.11.5 (2012), pp. 1015–1106. doi: 10.1007/s11128- 012- 0432-5

  19. [29]

    Efficient one-step generation of large cluster states with solid-state circuits

    J. Q. You et al. “Efficient one-step generation of large cluster states with solid-state circuits”. In: Phys. Rev. A75.5 (2007), p. 052319. doi: 10.1103/PhysRevA.75. 052319. Appendix

  20. [33]

    We aim to evaluate the exponential e−iθA

    Derivation of e−iθA = I + (e−iθ − 1)A Let A be a projector, i.e., A2 = A. We aim to evaluate the exponential e−iθA. Recall the power series expansion of the exponential function: e−iθA = ∞X n=0 (−iθA)n n! . Because A2 = A, we observe: An = A for all n ≥ 1. Therefore: (−iθA)n =...

  21. [183]

    arXiv: 1111.1143 [quant-ph]

    doi: 10.1140/epjst/e2012-01541-3. arXiv: 1111.1143 [quant-ph]

  22. [1509]

    doi: 10.1137/S0097539795293172. 21

  23. [2010]

    doi: 10.1017/CBO9780511976667

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.