pith. sign in

arxiv: 2605.21045 · v1 · pith:TVV4MVENnew · submitted 2026-05-20 · 🪐 quant-ph · cond-mat.mtrl-sci· cond-mat.str-el· cs.AR

Towards transistor-based quantum computing

Y.-D. Liu , X. Xu , Q.-R. Wang , D.-S. Wang This is my paper

Pith reviewed 2026-05-21 04:46 UTC · model grok-4.3

classification 🪐 quant-ph cond-mat.mtrl-scicond-mat.str-elcs.AR
keywords quantum computingsymmetry-protected topological orderquantum transistorsteleportationClifford gatesfault tolerancetopological protectionquantum architecture
0
0 comments X

The pith

Teleportation-based quantum transistors called telesistors are ground states of symmetry-protected topological order that suppress noise and enable high-fidelity Clifford gates without active error correction.

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

The paper proposes a universal quantum computing architecture built around teleportation-based quantum transistors, termed telesistors. These devices are constructed as ground states of systems with symmetry-protected topological order. This property lets them suppress certain noises and deliver high-fidelity Clifford gates passively. The protection is quantified by string order parameters and acts as a low-overhead base layer. Standard fault-tolerant encodings such as stabilizer codes can then be added to reach full universal quantum computation. The design also links to existing architectures and suggests advantages in modularity, integration, and program storage.

Core claim

Teleportation-based quantum transistors, called telesistors, are ground states of systems with symmetry-protected topological order, hence suppress certain noises and provide high-fidelity Clifford gates without the need for active error correction. This physical protection, quantified by the string order parameters, serves as a low-overhead foundation upon which conventional fault-tolerant encoding can be built to achieve universal quantum computation.

What carries the argument

Teleportation-based quantum transistors (telesistors) realized as ground states of symmetry-protected topological order systems, which use string order parameters to quantify noise suppression and enable passive high-fidelity Clifford gates.

If this is right

  • High-fidelity Clifford gates become available without active error correction.
  • Conventional stabilizer codes can be layered on top to reach universal quantum computation with lower overhead.
  • The architecture connects to known qubit-based designs while improving modularity and integration.
  • Program storage and device integration become more efficient than in standard qubit circuits.
  • Realization appears plausible with existing fabrication technology.

Where Pith is reading between the lines

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

  • Candidate materials already studied for topological order could be tested for telesistor behavior by checking string order parameters under gate operations.
  • Hybrid devices combining telesistors with semiconductor control electronics might simplify scaling compared with purely qubit-based processors.
  • Extensions that add non-Clifford operations could be built by coupling telesistors to other protected phases without increasing error-correction overhead.
  • The transistor-like modularity might allow quantum programs to be stored and swapped in hardware rather than reloaded from external control.

Load-bearing premise

Telesistors based on symmetry-protected topological order can be physically realized in a controllable way that actually delivers the claimed noise suppression and gate fidelity in a scalable device.

What would settle it

An experiment that fabricates a candidate telesistor device, measures its string order parameter, and demonstrates Clifford gate fidelities that remain high without active error correction.

Figures

Figures reproduced from arXiv: 2605.21045 by D.-S. Wang, Q.-R. Wang, X. Xu, Y.-D. Liu.

Figure 1
Figure 1. Figure 1: A quantum transistor in the form of matrix-product [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Two-leg ladders to realize CZ gate. Top: square lattice; Bottom: honeycomb lattice. The control (c) and tar￾get (t) qubits are on the left of the cluster. Time evolves towards the right. form Z P odd ao+ P even beX P even ae⊗Z P odd bo+ P even aeX P even be (14) for a, b as outcome of each leg. Furthermore, we find the width of the ladder can be extended. In order to see this, we present a symmetry￾based m… view at source ↗
Figure 3
Figure 3. Figure 3: Coupling among gates. Top left: coupling between [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: The encoding structure for a ground state in a [PITH_FULL_IMAGE:figures/full_fig_p008_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: An illustration of the quantum computer architec [PITH_FULL_IMAGE:figures/full_fig_p013_5.png] view at source ↗
read the original abstract

In this work, we propose and study in depth a universal quantum computing architecture based on a quantum construction of transistors. Our teleportation-based quantum transistors, called ``telesistors'', are ground states of systems with symmetry-protected topological order, hence suppress certain noises and provide high-fidelity Clifford gates without the need for active error correction. This physical protection, quantified by the string order parameters, serves as a low-overhead foundation upon which conventional fault-tolerant encoding (e.g., with stabilizer codes) can be built to achieve universal quantum computation. This architecture shows rich connections with current known architectures, and some desirable merits especially compared with the qubit-based circuits regarding modularity, integration, and program storage. Our study shows that it is plausible to realize it with current technology in the near future.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 1 minor

Summary. The manuscript proposes a universal quantum computing architecture based on teleportation-based quantum transistors ('telesistors') realized as ground states of systems with symmetry-protected topological (SPT) order. These are claimed to suppress certain noises (quantified by string order parameters) and deliver high-fidelity Clifford gates at the physical level without active error correction, providing a low-overhead foundation that can be combined with conventional stabilizer-code fault tolerance to reach universal computation. The work also discusses connections to existing architectures and potential advantages in modularity, integration, and program storage, while asserting that realization with current technology is plausible.

Significance. If the central mapping from SPT order to concrete noise suppression holds, the proposal could offer a physically protected substrate for Clifford gates that reduces the overhead of fault-tolerant quantum computing by layering standard encodings atop topological protection. The conceptual integration of teleportation, SPT physics, and transistor-like modularity is a strength that might stimulate new device-oriented thinking, though the lack of quantitative derivations or simulations limits immediate technical impact.

major comments (2)
  1. [Abstract] Abstract: the central claim that SPT order in telesistor ground states suppresses relevant noises sufficiently to enable high-fidelity Clifford gates without active correction rests on the existence of string order parameters but provides no explicit Hamiltonian, noise model, or fidelity calculation showing exponential protection or error rates below threshold under realistic local noise channels.
  2. [Abstract / closing claim] The manuscript (as summarized in the abstract and reader's assessment): the weakest assumption—that controllable, scalable physical realization of SPT-based telesistors will actually deliver the claimed noise suppression—is load-bearing for the architecture's practicality, yet no device parameters, error analysis, or simulation results are supplied to substantiate robustness.
minor comments (1)
  1. The invented term 'telesistor' is used without an explicit definition or comparison to conventional transistor analogies in the quantum-computing literature, which could confuse readers unfamiliar with the teleportation construction.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their detailed and constructive comments on our manuscript. We believe the feedback will help improve the clarity and rigor of our proposal for a telesistor-based quantum computing architecture. Below, we provide point-by-point responses to the major comments.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the central claim that SPT order in telesistor ground states suppresses relevant noises sufficiently to enable high-fidelity Clifford gates without active correction rests on the existence of string order parameters but provides no explicit Hamiltonian, noise model, or fidelity calculation showing exponential protection or error rates below threshold under realistic local noise channels.

    Authors: The manuscript is primarily a conceptual proposal that leverages well-established results from the theory of symmetry-protected topological order. String order parameters are known to characterize the protection against local, symmetry-preserving perturbations in SPT phases, which can suppress certain noise channels relevant to Clifford gate operations. We do not provide a specific microscopic Hamiltonian or numerical fidelity estimates in this work because the focus is on the architectural implications rather than a detailed physical implementation. To address the referee's concern, we will revise the manuscript to include an example Hamiltonian that realizes the desired SPT order and a qualitative analysis of the resulting noise suppression. Full quantitative calculations would require dedicated numerical studies and are beyond the current scope; we will note this explicitly. revision: partial

  2. Referee: [Abstract / closing claim] The manuscript (as summarized in the abstract and reader's assessment): the weakest assumption—that controllable, scalable physical realization of SPT-based telesistors will actually deliver the claimed noise suppression—is load-bearing for the architecture's practicality, yet no device parameters, error analysis, or simulation results are supplied to substantiate robustness.

    Authors: We agree that the practical realization is a key assumption. The manuscript argues for plausibility based on recent experimental progress in realizing SPT phases in systems such as Rydberg atoms, trapped ions, and superconducting circuits. However, specific device parameters and error analyses are not included as this is an architectural proposal. In the revised version, we will expand the discussion on potential physical implementations and clearly delineate the assumptions regarding noise suppression. This will help readers better assess the proposal's feasibility without overstating current capabilities. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation relies on established SPT concepts

full rationale

The paper proposes telesistors as ground states of SPT-ordered systems that suppress noise via string order parameters and enable high-fidelity Clifford gates, then layers conventional fault-tolerant codes on top. This chain invokes standard results from topological quantum matter and teleportation protocols without any self-definitional reduction, fitted parameter renamed as prediction, or load-bearing self-citation that collapses the central claim. The architecture is presented as a plausible construction with connections to existing approaches rather than a closed derivation that reproduces its inputs by construction. No equations or steps in the provided abstract and description reduce the claimed protection to an internal fit or tautology.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The proposal rests on the existence and realizability of symmetry-protected topological order in suitable physical systems, plus standard assumptions of quantum mechanics and teleportation protocols. No free parameters are fitted in the abstract. The main invented entity is the telesistor itself.

axioms (2)
  • domain assumption Symmetry-protected topological order exists and can be engineered in physical systems to provide string order parameters that suppress noise.
    Invoked in the abstract to justify physical protection without active error correction.
  • ad hoc to paper Teleportation-based quantum transistors can be constructed as ground states of such SPT systems.
    Central modeling choice that defines the telesistor.
invented entities (1)
  • telesistor no independent evidence
    purpose: To serve as a modular, noise-suppressed building block for universal quantum computation via high-fidelity Clifford gates.
    New postulated device type introduced in the abstract as the core of the architecture.

pith-pipeline@v0.9.0 · 5673 in / 1479 out tokens · 25174 ms · 2026-05-21T04:46:57.211144+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

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

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

Reference graph

Works this paper leans on

102 extracted references · 102 canonical work pages

  1. [1]

    Realized in actual quantum materials

    work page

  2. [2]

    Simulated in controllable quantum computing plat- forms or prepared by quantum circuits

    work page

  3. [3]

    telesistor

    Generated via Floquet engineering on actual quan- tum materials or simulated quantum systems. The first type mostly requires the realization of the parent Hamiltonian. Due to the many-body nature of cluster stabilizers, it is well known that it is not easy to realize a parent cluster Hamiltonian with two-body spin interactions [71]. This is different from...

    work page

  4. [4]

    M. A. Nielsen, I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge U.K., 2000

    work page 2000

  5. [5]

    T. D. Ladd, F. Jelezko, R. Laflamme, Y. Nakamura, C. Monroe, J. L. O’Brien, Quantum computers, Nature 464 (7285) (2010) 45–53

    work page 2010

  6. [6]

    Raussendorf, H

    R. Raussendorf, H. J. Briegel, A one-way quantum com- puter, Phys. Rev. Lett. 86 (2001) 5188–5191

    work page 2001

  7. [7]

    Bravyi, A

    S. Bravyi, A. Kitaev, Universal quantum computation with ideal clifford gates and noisy ancillas, Phys. Rev. A 71 (2005) 022316

    work page 2005

  8. [8]

    A. M. Childs, D. Gosset, Z. Webb, Universal computa- tion by multiparticle quantum walk, Science 339 (2013) 791

    work page 2013

  9. [9]

    T. S. Cubitt, A. Montanaro, S. Piddock, Universal quan- tum hamiltonians, Proceedings of the National Academy of Sciences 115 (38) (2018) 9497–9502

    work page 2018

  10. [10]

    Albash, D

    T. Albash, D. A. Lidar, Adiabatic quantum computation, Rev. Mod. Phys. 90 (2018) 015002

    work page 2018

  11. [11]

    Arrighi, An overview of quantum cellular automata, Natural Computing 18 (2019) 885–899

    P. Arrighi, An overview of quantum cellular automata, Natural Computing 18 (2019) 885–899

    work page 2019

  12. [12]

    Y. Yang, R. Renner, G. Chiribella, Optimal univer- sal programming of unitary gates, Phys. Rev. Lett. 125 (2020) 210501

    work page 2020

  13. [13]

    Wang, Universal quantum computing models: a perspective of resource theory, Acta Phys

    D.-S. Wang, Universal quantum computing models: a perspective of resource theory, Acta Phys. Sin. 73 (2024) 220302

    work page 2024

  14. [14]

    D. M. Harris, S. L. Harris, Digital design and computer architecture, Elsevier, 2013

    work page 2013

  15. [15]

    Wang, A prototype of quantum von Neumann ar- chitecture, Commun

    D.-S. Wang, A prototype of quantum von Neumann ar- chitecture, Commun. Theor. Phys. 74 (2022) 095103

    work page 2022

  16. [16]

    Choi, Completely positive linear maps on complex matrices, Linear Algebra Appl

    M.-D. Choi, Completely positive linear maps on complex matrices, Linear Algebra Appl. 10 (1975) 285–290

    work page 1975

  17. [17]

    Wang, Quantum sequential circuits, arXiv preprint arXiv:2602.05166 (2026)

    D.-S. Wang, Quantum sequential circuits, arXiv preprint arXiv:2602.05166 (2026)

    work page arXiv 2026

  18. [18]

    C. H. Bennett, G. Brassard, C. Cr´ epeau, R. Jozsa, A. Peres, W. K. Wootters, Teleporting an unknown quan- tum state via dual classical and einstein-podolsky-rosen channels, Phys. Rev. Lett. 70 (1993) 1895–1899

    work page 1993

  19. [19]

    Gottesman, I

    D. Gottesman, I. L. Chuang, Demonstrating the viabil- ity of universal quantum computation using teleportation and single-qubit operations, Nature 402 (6760) (1999) 390–393

    work page 1999

  20. [20]

    X. Zhou, D. W. Leung, I. L. Chuang, Methodology for quantum logic gate construction, Phys. Rev. A 62 (2000) 052316

    work page 2000

  21. [21]

    We note that the classical case is more nuanced; for in- stance, bits can also be stored in hardware such as hard drives

    work page

  22. [22]

    Knill, R

    E. Knill, R. Laflamme, G. Milburn, A scheme for effi- cient quantum computation with linear optics, Nature (London) 409 (2001) 46

    work page 2001

  23. [23]

    Bacon, S

    D. Bacon, S. T. Flammia, G. M. Crosswhite, Adiabatic quantum transistors, Phys. Rev. X 3 (2013) 021015

    work page 2013

  24. [24]

    D. J. Williamson, S. D. Bartlett, Symmetry-protected adiabatic quantum transistors, New J. Phys. 17 (2015) 053019

    work page 2015

  25. [25]

    Asoudeh, V

    M. Asoudeh, V. Karimipour, A review of perfect quan- tum state transfer, from one to two and three dimensional arrays of qubits, International J. Theor. Phys. 64 (2025) 198

    work page 2025

  26. [26]

    D.-S. Wang, D. T. Stephen, R. Raussendorf, Qudit quan- tum computation on matrix product states with global symmetry, Phys. Rev. A 95 (2017) 032312

    work page 2017

  27. [27]

    Raussendorf, D.-S

    R. Raussendorf, D.-S. Wang, A. Prakash, T.-C. Wei, D. T. Stephen, Symmetry-protected topological phases with uniform computational power in one dimension, Phys. Rev. A 96 (2017) 012302

    work page 2017

  28. [28]

    D. T. Stephen, D.-S. Wang, A. Prakash, T.-C. Wei, R. Raussendorf, Computational power of symmetry- protected topological phases, Phys. Rev. Lett. 119 (2017) 010504

    work page 2017

  29. [29]

    Raussendorf, C

    R. Raussendorf, C. Okay, D.-S. Wang, D. T. Stephen, H. P. Nautrup, Computationally universal phase of quan- tum matter, Phys. Rev. Lett. 122 (2019) 090501

    work page 2019

  30. [30]

    D. T. Stephen, H. P. Nautrup, J. Bermejo-Vega, J. Eis- ert, R. Raussendorf, Subsystem symmetries, quantum cellular automata, and computational phases of quantum matter, Quantum 3 (2019) 142

    work page 2019

  31. [31]

    A. K. Daniel, R. N. Alexander, A. Miyake, Compu- tational universality of symmetry-protected topologi- cally ordered cluster phases on 2D Archimedean lattices, Quantum 4 (2020) 228

    work page 2020

  32. [32]

    Wei, Symmetry-protected phases for measurement- based quantum computation, Advances in Physics: X 3 (2018) 1461026

    T.-C. Wei, Symmetry-protected phases for measurement- based quantum computation, Advances in Physics: X 3 (2018) 1461026

    work page 2018

  33. [33]

    Raussendorf, W

    R. Raussendorf, W. Yang, A. Adhikary, Measurement- based quantum computation in finite one-dimensional systems: string order implies computational power, Quantum 7 (2023) 1215

    work page 2023

  34. [34]

    Gu, X.-G

    Z.-C. Gu, X.-G. Wen, Tensor-entanglement-filtering renormalization approach and symmetry-protected topo- logical order, Phys. Rev. B 80 (2009) 155131

    work page 2009

  35. [35]

    G. K. Brennen, A. Miyake, Measurement-based quan- tum computer in the gapped ground state of a two-body hamiltonian, Phys. Rev. Lett. 101 (2008) 010502

    work page 2008

  36. [36]

    A. C. Doherty, S. D. Bartlett, Identifying phases of quan- tum many-body systems that are universal for quantum computation, Phys. Rev. Lett. 103 (2009) 020506

    work page 2009

  37. [37]

    S. D. Bartlett, G. K. Brennen, A. Miyake, J. M. Renes, Quantum computational renormalization in the haldane phase, Phys. Rev. Lett. 105 (2010) 110502. 16

    work page 2010

  38. [38]

    Miyake, Quantum computation on the edge of a symmetry-protected topological order, Phys

    A. Miyake, Quantum computation on the edge of a symmetry-protected topological order, Phys. Rev. Lett. 105 (2010) 040501

    work page 2010

  39. [39]

    J. M. Renes, A. Miyake, G. K. Brennen, S. D. Bartlett, Holonomic quantum computing in symmetry-protected ground states of spin chains, New J. Phys. 15 (2013) 025020

    work page 2013

  40. [40]

    Y. Hong, D. T. Stephen, A. J. Friedman, Quantum tele- portation implies symmetry-protected topological order, Quantum 8 (2024) 1499

    work page 2024

  41. [41]

    D.-S. Wang, G. Zhu, C. Okay, R. Laflamme, Quasi-exact quantum computation, Phys. Rev. Res. 2 (2020) 033116

    work page 2020

  42. [42]

    Wang, Y.-J

    D.-S. Wang, Y.-J. Wang, N. Cao, B. Zeng, R. Laflamme, Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes, New J. Phys. 24 (2022) 023019

    work page 2022

  43. [43]

    Zhou, Z.-W

    S. Zhou, Z.-W. Liu, L. Jiang, New perspectives on covari- ant quantum error correction, Quantum 5 (2021) 521

    work page 2021

  44. [44]

    Y. Yang, Y. Mo, J. M. Renes, G. Chiribella, M. P. Woods, Optimal universal quantum error correction via bounded reference frames, Phys. Rev. Res. 4 (2022) 023107

    work page 2022

  45. [45]

    Perez-Garcia, F

    D. Perez-Garcia, F. Verstraete, M. M. Wolf, J. I. Cirac, Matrix product state representations, Quantum Inf. Comput. 7 (5) (2007) 401–430

    work page 2007

  46. [46]

    D. V. Else, I. Schwarz, S. D. Bartlett, A. C. Do- herty, Symmetry-protected phases for measurement- based quantum computation, Phys. Rev. Lett. 108 (2012) 240505

    work page 2012

  47. [47]

    Affleck, T

    I. Affleck, T. Kennedy, E. H. Lieb, H. Tasaki, Rigorous results on valence-bond ground states in antiferromag- nets, Phys. Rev. Lett. 59 (1987) 799–802

    work page 1987

  48. [48]

    Galeski, K

    S. Galeski, K. Y. Povarov, D. Blosser, S. Gvasaliya, R. Wawrzynczak, J. Ollivier, J. Gooth, A. Zheludev,LT Scaling in Depleted Quantum Spin Ladders, Phys. Rev. Lett. 128 (2022) 237201

    work page 2022

  49. [49]

    Philippe, F

    J. Philippe, F. Elson, N. P. M. Casati, S. Sanz, M. Met- zelaars, O. Shliakhtun, O. K. Forslund, J. Lass, T. Shi- roka, A. Linden, D. G. Mazzone, J. Ollivier, S. Shin, M. Medarde, B. Lake, M. M˚ ansson, M. Bartkowiak, B. Normand, P. K¨ ogerler, Y. Sassa, M. Janoschek, G. Simutis, (C 5H9NH3)2cubr4: A metal-organic two- ladder quantum magnet, Phys. Rev. B 1...

    work page 2024

  50. [50]

    Jakovac, T

    I. Jakovac, T. Cvitani´ c, D. Arˇ con, M. Herak, D. Cinˇ ci´ c, N. B. Topi´ c, Y. Hosokoshi, T. Ono, K. Iwashita, N. Hayashi, N. Amaya, A. Matsuo, K. Kindo, I. Lonˇ cari´ c, M. Horvati´ c, M. Takigawa, M. S. Grbi´ c, Properties of an organic models= 1 haldane chain system, Phys. Rev. B 111 (2025) 064407

    work page 2025

  51. [51]

    Edmunds, E

    C. Edmunds, E. Rico, I. Arrazola, G. Brennen, M. Meth, R. Blatt, M. Ringbauer, Symmetry-protected topologi- cal haldane phase on a qudit quantum processor, PRX Quantum 6 (2025) 020349

    work page 2025

  52. [52]

    Iadecola, L

    T. Iadecola, L. H. Santos, C. Chamon, Stroboscopic symmetry-protected topological phases, Phys. Rev. B 92 (2015) 125107

    work page 2015

  53. [53]

    T. E. Lee, Y. N. Joglekar, P. Richerme, String order via floquet interactions in atomic systems, Phys. Rev. A 94 (2016) 023610

    work page 2016

  54. [54]

    Russomanno, B.-e

    A. Russomanno, B.-e. Friedman, E. G. Dalla Torre, Spin and topological order in a periodically driven spin chain, Phys. Rev. B 96 (2017) 045422

    work page 2017

  55. [55]

    Miller, A

    J. Miller, A. Miyake, Hierarchy of universal entangle- ment in 2d measurement-based quantum computation, npj Quantum Information 2 (2016) 16036

    work page 2016

  56. [56]

    S. D. Sarma, M. Freedman, C. Nayak, Majorana zero modes and topological quantum computation, npj Quan- tum Information 1 (2015) 15001

    work page 2015

  57. [57]

    Bonderson, M

    P. Bonderson, M. Freedman, C. Nayak, Measurement- only topological quantum computation, Phys. Rev. Lett. 101 (2008) 010501

    work page 2008

  58. [58]

    Wang, Choi states, symmetry-based quantum gate teleportation, and stored-program quantum computing, Phys

    D.-S. Wang, Choi states, symmetry-based quantum gate teleportation, and stored-program quantum computing, Phys. Rev. A 101 (2020) 052311

    work page 2020

  59. [59]

    Y.-T. Liu, K. Wang, Y.-D. Liu, D.-S. Wang, A Survey of Universal Quantum von Neumann Architecture, Entropy 25 (8) (2023) 1187

    work page 2023

  60. [60]

    Wang, A family of quantum von Neumann archi- tecture, Chin

    D.-S. Wang, A family of quantum von Neumann archi- tecture, Chin. Phys. B 33 (2024) 080302

    work page 2024

  61. [61]

    Xu, Y.-D

    X. Xu, Y.-D. Liu, S. Shi, Y.-J. Wang, D.-S. Wang, Dis- tributed quantum computing with black-box subroutines, Quantum Sci. Technol. 10 (2025) 045014

    work page 2025

  62. [62]

    Raussendorf, Quantum cellular automaton for uni- versal quantum computation, Phys

    R. Raussendorf, Quantum cellular automaton for uni- versal quantum computation, Phys. Rev. A 72 (2005) 022301

    work page 2005

  63. [63]

    Raussendorf, Quantum computation via translation- invariant operations on a chain of qubits, Phys

    R. Raussendorf, Quantum computation via translation- invariant operations on a chain of qubits, Phys. Rev. A 72 (2005) 052301

    work page 2005

  64. [64]

    D. T. Stephen, Computational power of one-dimensional symmetry-protected topological phases, Master Thesis, University of British Columbia (2017)

    work page 2017

  65. [65]

    Levin, Z.-C

    M. Levin, Z.-C. Gu, Braiding statistics approach to symmetry-protected topological phases, Phys. Rev. B 86 (2012) 115109

    work page 2012

  66. [66]

    Gross, J

    D. Gross, J. Eisert, Novel schemes for measurement- based quantum computation, Phys. Rev. Lett. 98 (2007) 220503

    work page 2007

  67. [67]

    T.-C. Wei, I. Affleck, R. Raussendorf, Affleck-Kennedy- Lieb-Tasaki State on a Honeycomb Lattice is a Universal Quantum Computational Resource, Phys. Rev. Lett. 106 (2011) 070501

    work page 2011

  68. [68]

    Miyake, Quantum computational capability of a 2d va- lence bond solid phase, Annals of Physics 326 (7) (2011) 1656 – 1671, july 2011 Special Issue

    A. Miyake, Quantum computational capability of a 2d va- lence bond solid phase, Annals of Physics 326 (7) (2011) 1656 – 1671, july 2011 Special Issue

    work page 2011

  69. [69]

    Wang, Quantum computation by teleportation and symmetry, Int

    D.-S. Wang, Quantum computation by teleportation and symmetry, Int. J. Mod. Phys. B 33 (15) (2019) 1930004

    work page 2019

  70. [70]

    Gachechiladze, O

    M. Gachechiladze, O. G¨ uhne, A. Miyake, Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states, Phys. Rev. A 99 (2019) 052304

    work page 2019

  71. [71]

    Takeuchi, Catalytic transformation from computa- tionally universal to strictly universal measurement- based quantum computation, Phys

    Y. Takeuchi, Catalytic transformation from computa- tionally universal to strictly universal measurement- based quantum computation, Phys. Rev. Lett. 133 (2024) 050601

    work page 2024

  72. [72]

    Affleck, E

    I. Affleck, E. H. Lieb, A proof of part of haldane’s conjec- ture on spin chains, in: Condensed Matter Physics and Exactly Soluble Models, Springer, 1986, pp. 235–247

    work page 1986

  73. [73]

    Pollmann, E

    F. Pollmann, E. Berg, A. M. Turner, M. Oshikawa, Sym- metry protection of topological phases in one-dimensional quantum spin systems, Phys. Rev. B 85 (2012) 075125

    work page 2012

  74. [74]

    Griffin, S

    T. Griffin, S. D. Bartlett, Spin lattices with two-body hamiltonians for which the ground state encodes a cluster state, Phys. Rev. A 78 (2008) 062306

    work page 2008

  75. [75]

    Hagiwara, K

    M. Hagiwara, K. Katsumata, I. Affleck, B. I. Halperin, J. P. Renard, Observation of s=1/2 degrees of freedom in an s=1 linear-chain heisenberg antiferromagnet, Phys. Rev. Lett. 65 (1990) 3181–3184

    work page 1990

  76. [76]

    S. Cao, B. Wu, F. Chen, M. Gong, Y. Wu, Y. Ye, C. Zha, H. Qian, C. Ying, S. Guo, et al., Generation of genuine 17 entanglement up to 51 superconducting qubits, Nature 619 (7971) (2023) 738–742

    work page 2023

  77. [77]

    O’Sullivan, K

    J. O’Sullivan, K. Reuer, A. Grigorev, X. Dai, A. Hern´ andez-Ant´ on, M. H. Mu˜ noz-Arias, C. Hellings, A. Flasby, D. Colao Zanuz, J.-C. Besse, et al., Determin- istic generation of two-dimensional multi-photon cluster states, Nature Communications 16 (1) (2025) 5505

    work page 2025

  78. [78]

    Blanes, F

    S. Blanes, F. Casas, J. A. Oteo, J. Ros, The magnus expansion and some of its applications, Physics Reports 470 (2009) 151

    work page 2009

  79. [79]

    Khemani, A

    V. Khemani, A. Lazarides, R. Moessner, S. L. Sondhi, Phase structure of driven quantum systems, Phys. Rev. Lett. 116 (2016) 250401

    work page 2016

  80. [80]

    A. J. Friedman, B. Ware, R. Vasseur, A. C. Potter, Topo- logical edge modes without symmetry in quasiperiodi- cally driven spin chains, Phys. Rev. B 105 (2022) 115117

    work page 2022

Showing first 80 references.