Pith. sign in

REVIEW 2 major objections 1 minor 64 references

Enhancing quantum processor capabilities during idle times

T0 review · 2 major / 1 minor · reviewed 2026-06-26 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Multipartite entanglement generated during idle times can be stored to enable multiple parallel long-distance two-qubit gates on processors with limited connectivity.

desk verdict The paper frames idle-time generation of d-dimensional cluster states as a way to build parallel long-distance gates in 1D architectures, but leaves the transfer costs unaddressed. read the letter →

arxiv 2606.20841 v1 pith:QO55L27J submitted 2026-06-18 quant-ph

Wolfgang Dür This is my paper · ORCID
classification quant-ph
keywords quantumcomputingmultipartiteentanglementclusterstatesidletimesauxiliarysystemslong-distancegateslimitedconnectivity
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

The paper proposes using idle periods in quantum processors to generate multipartite entangled states in auxiliary systems rather than leaving them unused. These states can later assist computations by providing resources whose power scales with their entanglement structure. For 1D geometries, d-dimensional cluster states support an increasing number of parallel long-distance gates as d grows, with generation complexity rising accordingly. A reader would care because this converts otherwise wasted time into preparation of resources that expand what the main processor can do on demand.

What carries the argument

d-dimensional cluster states as auxiliary resource states whose entanglement features determine the number of parallel long-distance two-qubit gates they can support.

What would settle it

An experiment in which a generated d-dimensional cluster state is transferred to a 1D processor and fails to enable the expected number of parallel long-distance gates due to loss of entanglement during storage or coupling.

Watch

Extended reading notes

Core claim

By generating and storing multipartite entangled resource states in auxiliary systems during idle times, including intervals within an ongoing algorithm, the future capabilities of the quantum processor are enhanced. In architectures with limited connectivity such as 1D geometries, d-dimensional cluster states allow flexible performance of multiple long-distance two-qubit gates in parallel, where both the complexity to generate the states and the number of achievable gates increase with d.

Load-bearing premise

Multipartite entangled states generated and stored in auxiliary systems can be transferred or coupled into the main processor with negligible decoherence or operational overhead while preserving their entanglement features.

Editorial extensions

If this is right

  • Idle times before a computation and any inactive steps during an algorithm can be used to prepare increasingly powerful auxiliary resource states.
  • The number of parallel long-distance two-qubit gates that can be performed increases directly with the dimension d of the cluster state.
  • Generation complexity of the resource states also scales with d, linking preparation effort to the resulting computational flexibility.
  • This establishes an alternative operating paradigm where auxiliary entanglement continuously augments processor capabilities on demand.

Reading between the lines

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

  • The approach could let algorithms draw on pre-prepared entanglement for specific subroutines without needing to generate it on the fly during active computation.
  • Similar benefits might extend to processor layouts with other limited connectivities, such as sparse 2D grids, by choosing appropriate multipartite states.
  • A key practical test would measure whether the overhead of coupling auxiliary states remains low enough to yield net speedup in actual hardware runs.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 1 minor

Summary. The paper proposes an alternative operating paradigm for quantum computers that generates multipartite entangled resource states in dedicated auxiliary systems during idle times (both pre-computation and intra-algorithm) and later couples them into the main processor to enhance capabilities. It identifies classes of states whose computational power scales with entanglement features and generation complexity, and illustrates the idea for limited-connectivity (e.g., 1D) architectures by claiming that d-dimensional cluster states enable an increasing number of parallel long-distance two-qubit gates as d grows, with generation complexity also scaling with d.

Significance. If the integration costs can be shown to be negligible, the approach would provide a concrete way to convert idle processor time into pre-generated entanglement resources that improve parallelism in restricted geometries. The explicit linking of entanglement structure, generation cost, and usable gate count is a useful conceptual framing, though the absence of quantitative analysis on transfer overhead limits the immediate practical significance.

major comments (2)
  1. [Abstract] Abstract: the central claim that d-dimensional cluster states 'allow one to flexibly perform multiple long-distance two-qubit gates in parallel, where both the complexity to generate them, as well as the number of achievable gates increases with d' is asserted without any derivation, circuit construction, or analysis of how the auxiliary states are coupled into a 1D-limited main processor while preserving the required entanglement structure.
  2. [Abstract] Abstract and proposal overview: the net-enhancement argument rests on the assumption that multipartite states generated in auxiliary systems can be transferred or coupled into the main processor 'with negligible decoherence or operational overhead,' yet no quantitative bounds on storage/transfer fidelity, no overhead cost for coupling operations, and no accounting for how limited 1D connectivity constrains the coupling step are supplied; if these costs are non-negligible the claimed advantage disappears.
minor comments (1)
  1. The manuscript would benefit from explicit definitions or citations for the 'classes of multipartite entangled resource states' whose power is related to entanglement features, to allow readers to verify the claimed scaling relations.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their thoughtful review and for highlighting areas where the presentation can be strengthened. We address each major comment below and outline the revisions we will make.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the central claim that d-dimensional cluster states 'allow one to flexibly perform multiple long-distance two-qubit gates in parallel, where both the complexity to generate them, as well as the number of achievable gates increases with d' is asserted without any derivation, circuit construction, or analysis of how the auxiliary states are coupled into a 1D-limited main processor while preserving the required entanglement structure.

    Authors: The detailed constructions and coupling analysis are provided in Section 3 of the manuscript, which describes the generation of d-dimensional cluster states via auxiliary controlled-phase gates whose depth scales with d, followed by a teleportation-based coupling protocol that uses only nearest-neighbor operations on the 1D main processor while preserving the multipartite entanglement. We will revise the abstract to explicitly reference Section 3 so that the supporting material is immediately apparent. revision: partial

  2. Referee: [Abstract] Abstract and proposal overview: the net-enhancement argument rests on the assumption that multipartite states generated in auxiliary systems can be transferred or coupled into the main processor 'with negligible decoherence or operational overhead,' yet no quantitative bounds on storage/transfer fidelity, no overhead cost for coupling operations, and no accounting for how limited 1D connectivity constrains the coupling step are supplied; if these costs are non-negligible the claimed advantage disappears.

    Authors: We agree that the absence of quantitative overhead estimates limits the immediate practical assessment. The manuscript presents a conceptual paradigm rather than a hardware-specific cost model. In revision we will add a dedicated paragraph in Section 4 that (i) enumerates the additional gates required for the coupling step under 1D connectivity, (ii) notes that these costs remain constant with d while the number of parallel long-range gates grows, and (iii) states that the net benefit holds whenever the per-gate error rate is below the threshold set by the auxiliary-state generation advantage. Full numerical simulation of fidelity under realistic noise models is left for future work. revision: yes

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity; conceptual proposal with independent claims

full rationale

The paper advocates a paradigm for generating and storing multipartite entanglement in auxiliary systems during idle times to enhance quantum processors, illustrated with d-dimensional cluster states enabling parallel long-distance gates. No equations, fitted parameters, or derivations are present in the provided text that reduce claims to self-definitions or inputs by construction. The central illustration ('d-dimensional cluster states allow one to flexibly perform multiple long-distance two-qubit gates in parallel, where both the complexity to generate them, as well as the number of achievable gates increases with d') is stated as a showable property without any reduction to prior fitted values or self-citations. No load-bearing self-citation chains, ansatzes smuggled via citation, or renaming of known results appear. The work is self-contained as a conceptual proposal against external benchmarks of entanglement generation and gate parallelism.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

Based solely on the abstract, the proposal rests on standard quantum information assumptions about entanglement generation, storage, and usage; no free parameters, invented entities, or ad-hoc axioms are explicitly introduced.

assumptions (1)
  • domain assumption Multipartite entangled states can be generated and maintained in auxiliary systems during idle times for later flexible use in computation.
    Implicit foundation for storing entanglement to enhance future capabilities.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Enhancing quantum processor capabilities during idle times." pith.science (2026). https://pith.science/paper/QO55L27J

@misc{pith2026260620841,
  author       = {Pith},
  title        = {Pith review of: Enhancing quantum processor capabilities during idle times},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/QO55L27J}},
  note         = {Machine review of arXiv:2606.20841}
}
abstract

We advocate an alternative paradigm to operate quantum computers that utilizes multipartite entanglement generated in dedicated auxiliary systems during idle times. This stored entanglement enhances the future capabilities of the quantum processor, as it can be flexibly used to assist and speed-up computations when needed. We identify classes of multipartite entangled resource states whose computational power are related to their entanglement features, and in turn to the complexity to generate them. During idle times, one can thus continuously work towards generating more and more powerful auxiliary multipartite entangled states. Idle times include both times prior to the start of a computation, but also any step during the execution of an algorithm where parts of the processor are not actively involved. To illustrate our approach, we consider architectures with limited connectivity, e.g. corresponding to a 1D geometry. We show that $d$-dimensional cluster states allow one to flexibly perform multiple long-distance two-qubit gates in parallel, where both the complexity to generate them, as well as the number of achievable gates increases with $d$.

Figures

Figures reproduced from arXiv: 2606.20841 by the authors.

Figure 1
Figure 1. Illustration of the usage of idle times to enhance [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. (a) 1D interaction geometry between auxiliary sys [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. (a) 1D interaction geometry, where to each data qubit (green) one memory qubit (blue) is attached, which in turn is [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: (a) Entangling qubits E are (virtually) arranged on a 3D lattice of size 3 × 3 × 3, which is obtained from a rectangular (virtual) 2D structure (b) on a rectangular lattice of size 3 × 9 by folding. Notice the snake-like arrangement of the underlying 1D interaction geo…
Figure 5
Figure 5. Figure 5: (a) System of size 8 × 8 with underlying 2D interaction geometry, where available interactions are indicated by black edges. The entangling qubits are virtually arranged into elementary squares of size 4 × 4 (blue/red/yellow/green), which are folded to form a 3D-CS (cu…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

64 extracted references · 5 canonical work pages

  1. [1]

    If a qubit of the graph state is measured in the PauliX,YorZbasis, the resulting quantum state is (up to a local unitary operation) again a graph state, with a different graph [47]

    Graph state manipulation by means of single-qubit measurments Consider an arbitrary graph state corresponding to a graphG. If a qubit of the graph state is measured in the PauliX,YorZbasis, the resulting quantum state is (up to a local unitary operation) again a graph state, with a different graph [47]. Specifically, the action of a PauliX,YorZmeasurement...

  2. [2]

    Single long-ranged gate in a 1D and 2D geometry In the 1D interaction geometry withNdata- andN auxiliary qubits (see Fig. 3a), performing a single two- qubit gate between two (randomly chosen) qubits solely in a gate-based fashion requiresO(N)steps: the average distance between two qubits isN/2, and in order to per- form a two-qubit gate one needs to brin...

  3. [3]

    As long asm≤m d, a dD-CS offers a constant advantage ofO(N)over a gate- based approach

    Multiple long-ranged gates in a 1D geometry The cost to performmgates on disjoint pairs of qubits in a gate-based scenario is the same as for a single gate, since any permutation ofNqubits can be done inN steps: all the SWAPs can be done simultaneously (in roundlbetween qubits(k, k+ 1)for allkodd [even] if lis odd [even]) (see also [23]). As long asm≤m d,...

  4. [4]

    This is the case when two- qubit gates use a joint bus, e.g

    Multiple long-ranged gates in a bus-based setting Here we consider a gate-based set-up with all-to-all connectivity, but where only a single two-qubit gate can be performed per time step. This is the case when two- qubit gates use a joint bus, e.g. the motional mode in an ion-trap setup [43] where Cirac-Zoller type gates are used [42]. Hence two-qubit gat...

  5. [5]

    This allows one to simply store the already gen- erated states, and start with the generation of an addi- 7 tional resource state

    Generation of additional resource states The simplest and most transparent setting is when multiple additional memory qubits (setM) are avail- able. This allows one to simply store the already gen- erated states, and start with the generation of an addi- 7 tional resource state. The strategy thereby depends on the expected available time, and the required...

  6. [6]

    closeness

    Modification of 2D-CS to generate 3D-CS The direct generation of a dD-CS as described above assumes that the initial state inMis a product state, and one needs to generate all required entanglement, i.e. all edges. Here we discuss the case where one has generated somed−1dimensional cluster state ofNqubits inM, and wants to modify or utilize it to generate...

    work page doi:10.55776/p36009

  7. [7]

    Raussendorf and H

    R. Raussendorf and H. J. Briegel, Phys. Rev. Lett.86, 5188 (2001)

    2001

  8. [8]

    Raussendorf, D

    R. Raussendorf, D. E. Browne, and H. J. Briegel, Phys. Rev. A68, 022312 (2003)

    2003

Show all 64 references
  1. [9]

    H. J. Briegel, D. E. Browne, W. Dür, R. Raussendorf, and M. Van den Nest, Nature Physics5, 19 (2009)

    2009

  2. [10]

    H. J. Briegel and R. Raussendorf, Phys. Rev. Lett.86, 910 (2001)

    2001

  3. [11]

    Hillmich, A

    S. Hillmich, A. Zulehner, and R. Wille, ASPDAC ’21, 792–797 (2021)

    2021

  4. [12]

    Bäumer, V

    E. Bäumer, V. Tripathi, D. S. Wang, P. Rall, E. H. Chen, S. Majumder, A. Seif, and Z. K. Minev, PRX Quantum 5, 030339 (2024)

    2024

  5. [13]

    Bäumer and S

    E. Bäumer and S. Woerner, Phys. Rev. Res.7, 023120 (2025)

    2025

  6. [14]

    H. Kang, J. F. Kam, G. J. Mooney, and L. C. Hollenberg, Phys. Rev. Appl.23, 014057 (2025)

    2025

  7. [15]

    Plathanam Babu, O

    A. Plathanam Babu, O. Kerppo, A. Muñoz-Moller, M. Haghparast, and M. Silveri, Quantum Science and Technology10, 035004 (2025)

    2025

  8. [16]

    Bäumer, V

    E. Bäumer, V. Tripathi, A. Seif, D. Lidar, and D. S. Wang, Phys. Rev. Lett.133, 150602 (2024)

    2024

  9. [17]

    Buhrman, M

    H. Buhrman, M. Folkertsma, B. Loff, and N. M. P. Neu- mann, Quantum8, 1552 (2024)

    2024

  10. [18]

    DeCross, E

    M. DeCross, E. Chertkov, M. Kohagen, and M. Foss-Feig, Physical Review X13, 041057 (2023)

    2023

  11. [19]

    D. Malz, G. Styliaris, Z.-Y. Wei, and J. I. Cirac, Physical Review Letters132, 040404 (2024)

    2024

  12. [20]

    K. C. Smith, A. Khan, B. K. Clark, S. M. Girvin, and T.-C. Wei, PRX Quantum5, 030344 (2024)

    2024

  13. [21]

    Zhang, S

    Y. Zhang, S. Gopalakrishnan, and G. Styliaris, PRX Quantum5, 040304 (2024)

    2024

  14. [22]

    Piroli, G

    L. Piroli, G. Styliaris, and J. I. Cirac, Physical Review Letters133, 230401 (2024)

    2024

  15. [23]

    Sahay and R

    R. Sahay and R. Verresen, PRX Quantum6, 010329 (2025)

    2025

  16. [24]

    Beverland, V

    M. Beverland, V. Kliuchnikov, and E. Schoute, PRX Quantum3, 020342 (2022)

    2022

  17. [25]

    Yang and P

    W. Yang and P. Rall, IEEE Transactions on Quantum Engineering5, 1 (2024)

    2024

  18. [26]

    Piroli, G

    L. Piroli, G. Styliaris, and J. I. Cirac, Phys. Rev. Lett. 133, 230401 (2024)

    2024

  19. [27]

    Berthusen, D

    N. Berthusen, D. Devulapalli, E. Schoute, A. M. Childs, M. J. Gullans, A. V. Gorshkov, and D. Gottesman, PRX 10 Fig. 4. (a) Entangling qubitsEare (virtually) arranged on a 3D lattice of size3×3×3, which is obtained from a rectangular (virtual) 2D structure (b) on a rectangular...

    2025

  20. [28]

    S. H. Choe and R. König, PRX Quantum6, 010357 (2025)

    2025

  21. [29]

    Devulapalli, E

    D. Devulapalli, E. Schoute, A. Bapat, A. M. Childs, and A. V. Gorshkov, Phys. Rev. Res.6, 033313 (2024)

    2024

  22. [30]

    J. Yu, S. R. Muleady, Y.-X. Wang, N. Schine, A. V. Gor- shkov, and A. M. Childs, Phys. Rev. Lett.136, 030601 (2026)

    2026

  23. [31]

    T. N. Kaldenbach and M. Heller, Quantum Science and Technology10, 015010 (2024)

    2024

  24. [32]

    Devulapalli, C

    D. Devulapalli, C. Yin, A. Y. Guo, E. Schoute, A. M. Childs, A. V. Gorshkov, and A. Lucas, Quantum routing and entanglement dynamics through bottlenecks (2025), arXiv:2505.16948 [quant-ph]

    2025

  25. [33]

    Eldredge, L

    Z. Eldredge, L. Zhou, A. Bapat, J. R. Garrison, A. Desh- pande, F. T. Chong, and A. V. Gorshkov, Phys. Rev. Res. 2, 033316 (2020)

    2020

  26. [34]

    Riera-Sàbat and W

    F. Riera-Sàbat and W. Dür, New Journal of Physics26, 123015 (2024)

    2024

  27. [35]

    Dür, Quantum Science and Technology11, 015013 (2025)

    W. Dür, Quantum Science and Technology11, 015013 (2025)

    2025

  28. [36]

    Rosenblatt, H

    Y.Kim, A.Eddins, S.Anand, K.X.Wei, E.vandenBerg, S. Rosenblatt, H. Nayfeh, Y. Wu, M. Zaletel, K. Temme, and A. Kandala, Nature618, 500 (2023)

    2023

  29. [37]

    Acharya and et.al., Nature638, 920 (2025)

    R. Acharya and et.al., Nature638, 920 (2025)

    2025

  30. [38]

    J. C. Hoke and et.al, Nature622, 481 (2023)

    2023

  31. [39]

    Levine, A

    H. Levine, A. Keesling, G. Semeghini, A. Omran, T. T. Wang, S. Ebadi, H. Bernien, M. Greiner, V. Vuletić, H. Pichler, and M. D. Lukin, Physical Review Letters 123, 170503 (2019)

    2019

  32. [40]

    S. J. Evered, D. Bluvstein, M. Kalinowski, S. Ebadi, T. Manovitz, H. Zhou, S. H. Li, A. A. Geim, T. T. Wang, N. Maskara, H. Levine, G. Semeghini, M. Greiner, V. Vuletić, and M. D. Lukin, Nature622, 268 (2023)

    2023

  33. [41]

    Bluvstein, S

    D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. Bonilla Ataides, N. Maskara, I. Cong, X. Gao, P. Sales Rodriguez, T. Karolyshyn, G. Semegh- ini, M. J. Gullans, M. Greiner, V. Vuletić, and M. D. Luki...

    2024

  34. [42]

    Q. Xu, J. P. Bonilla Ataides, C. A. Pattison, N. Raveen- dran, D. Bluvstein, J. Wurtz, B. Vasić, M. D. Lukin, L. Jiang, and H. Zhou, Nature Physics20, 1084 (2024)

    2024

  35. [43]

    Pogorelov, T

    I. Pogorelov, T. Feldker, C. D. Marciniak, L. Postler, G. Jacob, O. Krieglsteiner, V. Podlesnic, M. Meth, V. Negnevitsky, M. Stadler, B. Höfer, C. Wächter, K. Lakhmanskiy, R. Blatt, P. Schindler, and T. Monz, PRX Quantum2, 020343 (2021)

    2021

  36. [44]

    Postler, S

    L. Postler, S. Heuβen, I. Pogorelov, M. Rispler, T. Feld- ker, M. Meth, C. D. Marciniak, R. Stricker, M. Ring- bauer, R. Blatt, P. Schindler, M. Müller, and T. Monz, Nature605, 675 (2022)

    2022

  37. [45]

    Valentini, M

    M. Valentini, M. W. van Mourik, F. Butt, J. Wahl, M. Di- etl, M. Pfeifer, F. Anmasser, Y. Colombe, C. Rössler, P. Holz, R. Blatt, M. Müller, T. Monz, and P. Schindler, http://arxiv.org/abs/2406.02406 (2024)

    2024

  38. [46]

    Frisch, A

    A. Frisch, A. Erhard, T. Feldker, F. Girtler, M. Het- trich, W. Huss, G. Jacob, C. Maier, G. Mayramhof, D. Nigg, C. Sommer, J. Ulmanis, E. Wodey, M. Zangerl, and T. Monz, Trapped-ion quantum computing, in Quantum Software: Aspects of Theory and System Design, edited by I. Exma...

    2024

  39. [47]

    C. D. Bruzewicz, J. Chiaverini, R. McConnell, and J. M. Sage, Applied Physics Reviews6, 021314 (2019)

    2019

  40. [48]

    J. I. Cirac and P. Zoller, Phys. Rev. Lett.74, 4091 (1995)

    1995

  41. [49]

    Fazio, R

    N. Fazio, R. Freund, D. Sannamoth, A. Steiner, C. D. 11 Marciniak, M. Rispler, R. Harper, T. Monz, J. Emerson, and S. D. Bartlett, Characterizing physical and logical errors in a transversal cnot via cycle error reconstruction (2025), arXiv:2504.11980 [quant-ph]

    2025

  42. [50]

    Notice that in a setting where also data qubits are con- nected and can interact according to some interaction ge- ometry, the corresponding two-qubit gates between data qubits may be implemented directly

  43. [51]

    Freund, A

    J. Freund, A. Pirker, and W. Dür, Phys. Rev. Res.6, 033267 (2024)

    2024

  44. [52]

    M. Hein, J. Eisert, and H. J. Briegel, Physical Review A 69, 062311 (2004)

    2004

  45. [53]

    Enrico Fermi

    M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. Van den Nest, and H.-J. Briegel, in Quantum Computers, Algorithms and Chaos, Pro- ceedings of the International School of Physics "Enrico Fermi", Vol. 162, edited by G. Casati, D. L. Shepelyan- sky, P. Zoller, and G. Benenti (IOS ...

    2006

  46. [54]

    Bravyi, D

    S. Bravyi, D. Maslov, and Y. Nam, Phys. Rev. Lett.129, 230501 (2022)

    2022

  47. [55]

    if end-points of different Bell states are too close to each other, or are located among another path

    Notice that some configurations might not be obtainable, e.g. if end-points of different Bell states are too close to each other, or are located among another path. In the latter case, choosing an alternative path could circumvent the problem though

  48. [56]

    Freund, A

    J. Freund, A. Pirker, L. Vandré, and W. Dür, New Jour- nal of Physics27, 094505 (2025)

    2025

  49. [57]

    Cowtan, S

    A. Cowtan, S. Dilkes, R. Duncan, A. Krajenbrink, W. Simmons, and S. Sivarajah, 14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019), Leibniz International Pro- ceedings in Informatics (LIPIcs),135, 5:1 (2019)

    2019

  50. [58]

    A. M. Childs, E. Schoute, and C. M. Unsal, 14th Con- ference on the Theory of Quantum Computation, Com- munication and Cryptography (TQC 2019), Leibniz In- ternational Proceedings in Informatics (LIPIcs),135, 3:1 (2019)

    2019

  51. [59]

    Bapat, A

    A. Bapat, A. M. Childs, A. V. Gorshkov, S. King, E. Schoute, and H. Shastri, Quantum5, 533 (2021)

    2021

  52. [60]

    Bapat, A

    A. Bapat, A. M. Childs, A. V. Gorshkov, and E. Schoute, PRX Quantum4, 010313 (2023)

    2023

  53. [61]

    Yuan and S

    P. Yuan and S. Zhang, Quantum9, 1757 (2025)

    2025

  54. [62]

    Miguel-Ramiro, M

    J. Miguel-Ramiro, M. F. Mor-Ruiz, and W. Dür, Uni- versal nested quantum switch (2026), arXiv:2603.00236 [quant-ph]

    2026

  55. [63]

    M. F. Mor-Ruiz and W. Dür, IEEE Journal on Selected Areas in Communications42, 1793 (2024)

    2024

  56. [64]

    Romanova, J

    A. Romanova, J. Wallnöfer, and W. Dür, High-fidelity entanglement from 2d cluster states (2026), in prepara- tion. 12 APPENDIX A: PERMUTATIONS ON SUBSETS OF QUBITS Performing arbitrary permutations on subsets of qubits is an important element to overcome geometric interac- tio...

    2026

Pith tools

Reviewed June 26, 2026 · model on record in the stance chip above.