Pith. sign in

REVIEW 61 references

Demonstrating Coherent Quantum Routers for Bucket-Brigade Quantum Random Access Memory on a Superconducting Processor

T0 review · reviewed 2026-08-07 · deepseek-v4-flash

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

Pith's one-line read A superconducting 10-qubit processor demonstrated coherent quantum routers for bucket-brigade QRAM, with reported fidelities of 95.74% for a single router and 82.40% for a two-layer network.

arxiv 2505.13958 v1 pith:YXKE5AOZ submitted 2025-05-20 quant-ph

Sheng Zhang , Yun-Jie Wang , Peng Wang , Ren-Ze Zhao , Xiao-Yan Yang , Ze-An Zhao , Tian-Le Wang , Hai-Feng Zhang
show 14 more authors
Zhi-Fei Li Yuan Wu Hao-Ran Tao Liang-Liang Guo Lei Du Chi Zhang Zhi-Long Jia Wei-Cheng Kong Zhuo-Zhi Zhang Xiang-Xiang Song Yu-Chun Wu Zhao-Yun Chen Peng Duan Guo-Ping Guo
This is my paper · ORCID
classification quant-ph
keywords quantumroutingcoherentqramroutersaccessachievingbucket-brigade
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

A bucket-brigade quantum random access memory (QRAM) is organized as a binary tree of switches. At each node, a quantum control state decides whether a data qubit goes left or right, and the final location encodes the retrieved memory. This paper reports making those switches, called quantum routers, on a ten-qubit superconducting chip. The routers use a recently proposed gate construction, the transition composite gate scheme, which temporarily uses the third energy level of a transmon so that a controlled swap needs only three two-qubit entangling gates instead of a much deeper decomposition. The control state is stored in the lowest and second-excited levels; if it leaks into the intermediate level, the experiment detects this and discards the run. This post-selection is called eraser detection.

The group tested a single router by routing qubits under superposition and by quantum state tomography, reporting fidelities around 95 percent. They then assembled two layers of routers and report a fitted average fidelity of 82.4 percent. These measurements indicate deterministic, coherent routing on real hardware, which is relevant for building QRAM.

The quantitative claims need care. The headline fidelities come from a fitted decay model whose fitting parameters are not reported, no error bars are shown, and the success rate of post-selection is not given. Since post-selection removes bad runs, the eraser scheme's advantage over the non-eraser scheme cannot be fully assessed without knowing how often events were kept.

Extended reading notes

Core claim

The paper's load-bearing assertion, from the abstract, is: 'we demonstrate coherent quantum routers using a superconducting quantum processor,' with 'individual QRouter fidelities up to 95.74%,' and 'a two-layer quantum routing network achieving an average fidelity of 82.40%.' If correct, the TCG-based QRouter with |0> and |2> address encoding is a deterministic, coherent, reversible routing primitive for bucket-brigade QRAM on a superconducting processor, with the reported single-router and two-layer network fidelities.

Load-bearing premise

The RAT fidelity model M_RAT(N) = l1 + l2(1-F_RAT)^(2N+1) is assumed to describe how routing accuracy decays with depth; with l1 and l2 unreported and no error bars on the data (Fig. 3(e), Fig. 4(f)), the fitted F_RAT values, including 95.74% and 82.40%, are not independently verifiable. A second load-bearing premise is that post-selecting on Q_C not in |1> removes errors without removing valid routed data; the paper reports no acceptance rate, so the eraser scheme's advantage may be inflated by discarding many runs.

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.

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

The central claim rests on the prior TCG gate decomposition (Eq. S9) and on the eraser-channel model. No new physical entities are postulated. The only free parameters in the reported quantitative claims are the RAT fitting parameters and the extracted F_RAT values; per-pair gate calibration waveforms are treated as experimental controls rather than model parameters.

free parameters (5)
  • F_RAT (single-layer, eraser scheme) = 0.9574
    Extracted by fitting M_RAT(N)=l1+l2(1-F_RAT)^(2N+1) to random access test data (Section III, Fig. 3(e)).
  • F_RAT (single-layer, non-eraser scheme) = 0.8748
    Same fitting procedure without post-selection (Section III).
  • F_RAT (two-layer, eraser scheme) = 0.8240
    Fitted average fidelity of the two-layer network (Section IV).
  • F_RAT (two-layer, non-eraser scheme) = 0.8190
    Fitted average fidelity without eraser; the 0.5-point gap versus eraser is within unquantified uncertainty.
  • l1 and l2 (RAT fitting parameters) = not reported
    Free parameters in the fidelity decay model; values are not provided, so fit quality and F_RAT identifiability cannot be assessed.
assumptions (3)
  • domain assumption TCG decomposition of CSWAP into three square-root-CZ gates (Eq. S9) is correct and phase-free.
    Taken from the authors' prior theoretical work (Ref. [33]); main text does not re-derive it. The routing measurements provide in-paper validation, but the router design depends on it.
  • domain assumption Leakage of the address qutrit into |1> is the dominant error channel and is detectable by final measurement.
    Supported only by simplified three-level simulations in Supplementary Section 6; no measured channel breakdown or post-selection acceptance rate is reported.
  • domain assumption Qutrit decoherence model with device T1 and T2* rates captures the relevant noise for RAT simulations.
    Used in Supplementary Section 6; parameter values are device inputs, not fit to the target fidelity, but the model is not validated against randomized benchmarking.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Demonstrating Coherent Quantum Routers for Bucket-Brigade Quantum Random Access Memory on a Superconducting Processor." pith.science (2026). https://pith.science/paper/YXKE5AOZ

@misc{pith2026250513958,
  author       = {Pith},
  title        = {Pith review of: Demonstrating Coherent Quantum Routers for Bucket-Brigade Quantum Random Access Memory on a Superconducting Processor},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YXKE5AOZ}},
  note         = {Machine review of arXiv:2505.13958}
}
abstract

Quantum routers (QRouters) are essential components of bucket-brigade quantum random access memory (QRAM), enabling quantum applications such as Grover's search and quantum machine learning. Despite significant theoretical advances, achieving scalable and coherent QRouters experimentally remains challenging. Here, we demonstrate coherent quantum routers using a superconducting quantum processor, laying a practical foundation for scalable QRAM systems. The quantum router at the core of our implementation utilizes the transition composite gate (TCG) scheme, wherein auxiliary energy levels temporarily mediate conditional interactions, substantially reducing circuit depth compared to traditional gate decompositions. Moreover, by encoding routing addresses in the non-adjacent qutrit states $|0\rangle$ and $|2\rangle$, our design inherently enables eraser-detection capability, providing efficient post-selection to mitigate routing errors. Experimentally, we achieve individual QRouter fidelities up to 95.74%, and validate scalability through a two-layer quantum routing network achieving an average fidelity of 82.40%. Our results represent a significant advancement in quantum routing technology, providing enhanced fidelity, built-in error resilience, and practical scalability crucial for the development of future QRAM and large-scale quantum computing architectures.

Figures

Figures reproduced from arXiv: 2505.13958 by the authors.

Figure 1
Figure 1. (a) illustrates the logical structure of a QRouter and how multiple such routers are recursively composed into a binary-tree network to support superposition-based queries. The physical implementation of the QRouter, shown in [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. (d). The high-contrast routing in [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. FIG. 3 [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: FIG. 4 [PITH_FULL_IMAGE:figures/full_fig_p005_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

61 extracted references · 46 canonical work pages

  1. [1]

    Giovannetti, S

    V . Giovannetti, S. Lloyd, and L. Maccone, Quantum random access memory, Phys. Rev. Lett.100, 160501 (2008)

    work page 2008

  2. [2]

    Then we measuredQ I,Q L andQ R to determine the popu- lationP |k′⟩ (k′ ∈ {000,001,010,011})

    were loaded into2N+ 1QRouters, with each sequence repeated30times. Then we measuredQ I,Q L andQ R to determine the popu- lationP |k′⟩ (k′ ∈ {000,001,010,011}). We regarded the consistency between ideal (P 0 |t⟩) and experimental (P e |t⟩) pop- ulations,M RAT = 1− P t |P 0 |t⟩ −P e |t⟩|, as the quantitative measure, where|t⟩is the routing target state. We ...

    work page

  3. [3]

    The experimental results in Fig

    ofC 1 andC 2 throughθadjustments in the mul- tiple routing tests, while monitoring the data qubitsD 1 and D2. The experimental results in Fig. 4(c) depict the population distributions ofD 1 andD 2 after routing. Whenθ 1 = 0and θ2 = 1, the population ofD 1 reaches its maximum (P max 1 = 93.96%), consistent with the expectedsin 2(θ1) cos2(θ2). A similar tre...

    work page

  4. [4]

    C. T. Hann, C.-L. Zou, Y . Zhang, Y . Chu, R. J. Schoelkopf, S. M. Girvin, and L. Jiang, Hardware-efficient quantum random access memory with hybrid quantum acoustic systems, Phys. Rev. Lett.123, 250501 (2019)

    work page 2019

  5. [5]

    Paler, O

    A. Paler, O. Oumarou, and R. Basmadjian, Parallelizing the queries in a bucket-brigade quantum random access memory, Phys. Rev. A102, 032608 (2020)

    work page 2020

  6. [6]

    Asaka, K

    R. Asaka, K. Sakai, and R. Yahagi, Quantum random access memory via quantum walk, Quantum Science and Technology 6, 035004 (2021)

    2021

  7. [7]

    K. C. Chen, W. Dai, C. Errando-Herranz, S. Lloyd, and D. En- glund, Scalable and high-fidelity quantum random access mem- 6 ory in spin-photon networks, PRX Quantum2, 030319 (2021)

    work page 2021

  8. [8]

    Jaques and A

    S. Jaques and A. G. Rattew, Qram: A survey and critique (2023), arXiv:2305.10310 [quant-ph]

    arXiv 2023

Show all 61 references
  1. [9]

    Weiss, S

    D. Weiss, S. Puri, and S. Girvin, Quantum random access memory architectures using 3d superconducting cavities, PRX Quantum5, 020312 (2024)

    2024

  2. [10]

    L. K. Grover, Quantum mechanics helps in searching for a nee- dle in a haystack, Phys. Rev. Lett.79, 325 (1997)

    1997

  3. [11]

    Biamonte, P

    J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd, Quantum machine learning, Nature549, 195 (2017)

    2017

  4. [12]

    Cerezo, G

    M. Cerezo, G. Verdon, H.-Y . Huang, L. Cincio, and P. J. Coles, Challenges and opportunities in quantum machine learning, Na- ture Computational Science2, 567 (2022)

    2022

  5. [13]

    I. M. Georgescu, S. Ashhab, and F. Nori, Quantum simulation, Rev. Mod. Phys.86, 153 (2014)

    2014

  6. [14]

    Kandala, A

    A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. M. Chow, and J. M. Gambetta, Hardware-efficient variational quantum eigensolver for small molecules and quantum mag- nets, Nature549, 242 (2017)

    2017

  7. [15]

    Giovannetti, S

    V . Giovannetti, S. Lloyd, and L. Maccone, Architectures for a quantum random access memory, Phys. Rev. A78, 052310 (2008)

    2008

  8. [16]

    C. T. Hann, G. Lee, S. Girvin, and L. Jiang, Resilience of quan- tum random access memory to generic noise, PRX Quantum2, 020311 (2021)

    2021

  9. [17]

    L. Zhou, S. Yang, Y .-x. Liu, C. P. Sun, and F. Nori, Quantum zeno switch for single-photon coherent transport, Phys. Rev. A 80, 062109 (2009)

    2009

  10. [18]

    Gonzalez-Ballestero, E

    C. Gonzalez-Ballestero, E. Moreno, F. J. Garcia-Vidal, and A. Gonzalez-Tudela, Nonreciprocal few-photon routing schemes based on chiral waveguide-emitter couplings, Phys. Rev. A94, 063817 (2016)

    2016

  11. [19]

    Cheng, X.-S

    M.-T. Cheng, X.-S. Ma, J.-Y . Zhang, and B. Wang, Single pho- ton transport in two waveguides chirally coupled by a quantum emitter, Optics express24, 19988 (2016)

    2016

  12. [20]

    Zhou, L.-P

    L. Zhou, L.-P. Yang, Y . Li, and C. P. Sun, Quantum routing of single photons with a cyclic three-level system, Phys. Rev. Lett. 111, 103604 (2013)

    2013

  13. [21]

    Y . T. Zhu and W. Z. Jia, Single-photon quantum router in the microwave regime utilizing double superconducting resonators with tunable coupling, Phys. Rev. A99, 063815 (2019)

    2019

  14. [22]

    J. Lu, Z. H. Wang, and L. Zhou, T-shaped single-photon router, Opt. Express23, 22955 (2015)

    2015

  15. [23]

    J. Lu, L. Zhou, L.-M. Kuang, and F. Nori, Single-photon router: Coherent control of multichannel scattering for single photons with quantum interferences, Phys. Rev. A89, 013805 (2014)

    2014

  16. [24]

    Z. Wang, Y . Wu, Z. Bao, Y . Li, C. Ma, H. Wang, Y . Song, H. Zhang, and L. Duan, Experimental realization of a determin- istic quantum router with superconducting quantum circuits, Phys. Rev. Appl.15, 014049 (2021)

    2021

  17. [25]

    Ren, S.-l

    Y .-l. Ren, S.-l. Ma, J.-k. Xie, X.-k. Li, M.-t. Cao, and F.-l. Li, Nonreciprocal single-photon quantum router, Phys. Rev. A105, 013711 (2022)

    2022

  18. [26]

    Y . Li, Z. Bao, Z. Wang, Y . Wu, J. Wang, J. Yang, H. Xiong, Y . Song, H. Zhang, and L. Duan, Quantum switch for itiner- ant microwave single photons with superconducting quantum circuits, Phys. Rev. Appl.21, 044030 (2024)

    2024

  19. [27]

    Du, Y .-T

    L. Du, Y .-T. Chen, J.-H. Wu, and Y . Li, Nonreciprocal interfer- ence and coherent photon routing in a three-port optomechani- cal system, Optics Express28, 3647 (2020)

    2020

  20. [28]

    G. S. Agarwal and S. Huang, Optomechanical systems as single-photon routers, Phys. Rev. A85, 021801 (2012)

    2012

  21. [29]

    Yuan, J.-J

    X. Yuan, J.-J. Ma, P.-Y . Hou, X.-Y . Chang, C. Zu, and L.-M. Duan, Experimental demonstration of a quantum router, Scien- tific reports5, 12452 (2015)

    2015

  22. [30]

    Bartkiewicz, A

    K. Bartkiewicz, A. ˇCernoch, and K. Lemr, Implementation of an efficient linear-optical quantum router, Scientific Reports8, 13480 (2018)

    2018

  23. [31]

    N. E. Palaiodimopoulos, S. Ohler, M. Fleischhauer, and D. Pet- rosyan, Chiral quantum router with rydberg atoms, Phys. Rev. A109, 032622 (2024)

    2024

  24. [32]

    F. Yan, P. Krantz, Y . Sung, M. Kjaergaard, D. L. Campbell, T. P. Orlando, S. Gustavsson, and W. D. Oliver, Tunable coupling scheme for implementing high-fidelity two-qubit gates, Phys. Rev. Appl.10, 054062 (2018)

    2018

  25. [33]

    Arute, K

    F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell, et al., Quantum supremacy using a programmable supercon- ducting processor, Nature574, 505 (2019)

    2019

  26. [34]

    D. Gao, D. Fan, C. Zha, J. Bei, G. Cai, J. Cai, S. Cao, F. Chen, J. Chen, K. Chen, X. Chen, X. Chen, Z. Chen, Z. Chen, Z. Chen, W. Chu, H. Deng, Z. Deng, P. Ding, X. Ding, Z. Ding, S. Dong, Y . Dong, B. Fan, Y . Fu, S. Gao, L. Ge, M. Gong, J. Gui, C. Guo, S. Guo, X. Guo, L. Ha...

    2025

  27. [35]

    Zhang, P

    S. Zhang, P. Duan, Y .-J. Wang, T.-L. Wang, P. Wang, R.- Z. Zhao, X.-Y . Yang, Z.-A. Zhao, L.-L. Guo, Y . Chen, H.-F. Zhang, L. Du, H.-R. Tao, Z.-F. Li, Y . Wu, Z.-L. Jia, W.-C. Kong, Z.-Y . Chen, Z.-Z. Zhang, X.-X. Song, Y .-C. Wu, and G.-P. Guo, Realizing scalable conditiona...

    2025 arXiv

  28. [36]

    Kubica, A

    A. Kubica, A. Haim, Y . Vaknin, H. Levine, F. Brand ˜ao, and A. Retzker, Erasure qubits: Overcoming theT 1 limit in super- conducting circuits, Phys. Rev. X13, 041022 (2023)

    2023

  29. [37]

    Vittal, P

    S. Vittal, P. Das, and M. Qureshi, Eraser: Towards adap- tive leakage suppression for fault-tolerant quantum computing (2023)

    2023

  30. [38]

    Foxen, C

    B. Foxen, C. Neill, A. Dunsworth, P. Roushan, B. Chiaro, A. Megrant, J. Kelly, Z. Chen, K. Satzinger, R. Barends, F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, S. Boixo, D. Buell, B. Burkett, Y . Chen, R. Collins, E. Farhi, A. Fowler, C. Gidney, M. Giustina, R. Graff,...

    2020

  31. [39]

    Y . Sung, L. Ding, J. Braum ¨uller, A. Veps¨al¨ainen, B. Kannan, M. Kjaergaard, A. Greene, G. O. Samach, C. McNally, D. Kim, A. Melville, B. M. Niedzielski, M. E. Schwartz, J. L. Yoder, T. P. Orlando, S. Gustavsson, and W. D. Oliver, Realization of high-fidelity cz andzz-free ...

    2021

  32. [40]

    demonstrating coherent quan- tum routers for bucket-brigade quantum random access mem- ory on a superconducting processor

    Supplementary information for “demonstrating coherent quan- tum routers for bucket-brigade quantum random access mem- ory on a superconducting processor” (2025)

    2025

  33. [42]

    Neill, T

    C. Neill, T. McCourt, X. Mi, Z. Jiang, M. Niu, W. Mruczkiewicz, I. Aleiner, F. Arute, K. Arya, J. Ata- laya, et al., Accurately computing the electronic properties of a quantum ring, Nature594, 508 (2021)

    2021

  34. [43]

    J. A. Gross, ´E. Genois, D. M. Debroy, Y . Zhang, W. Mruczkiewicz, Z.-P. Cian, and Z. Jiang, Characterizing co- herent errors using matrix-element amplification, npj Quantum Information10, 123 (2024)

    2024

  35. [44]

    Motzoi, J

    F. Motzoi, J. M. Gambetta, P. Rebentrost, and F. K. Wilhelm, Simple pulses for elimination of leakage in weakly nonlinear qubits, Phys. Rev. Lett.103, 110501 (2009)

    2009

  36. [45]

    Y .-J. Wang, S. Zhang, T.-P. Sun, Z.-A. Zhao, X.-F. Xu, X.-N. Zhuang, H.-Y . Liu, C. Xue, P. Duan, Y .-C. Wu, Z.-Y . Chen, and G.-P. Guo, Hardware-efficient quantum random access mem- ory design with a native gate set on superconducting platforms (2024), arXiv:2306.10250 [quant-ph]

    2024 arXiv

  37. [46]

    Z.-Y . Chen, C. Xue, Y .-J. Wang, T.-P. Sun, H.-Y . Liu, X.- N. Zhuang, M.-H. Dou, T.-R. Zou, Y . Fang, Y .-C. Wu, and G.-P. Guo, Efficient and error-resilient data access protocols for a limited-sized quantum random access memory (2023), arXiv:2303.05207 [quant-ph]

    2023 arXiv

  38. [47]

    Preskill, Quantum Computing in the NISQ era and beyond, Quantum2, 79 (2018)

    J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum2, 79 (2018)

    2018

  39. [48]

    J. W. Z. Lau, K. H. Lim, H. Shrotriya, and L. C. Kwek, Nisq computing: where are we and where do we go?, AAPPS bul- letin32, 27 (2022)

    2022

  40. [49]

    Khalid, J

    U. Khalid, J. U. Rehman, S. N. Paing, H. Jung, T. Q. Duong, and H. Shin, Quantum network engineering in the nisq age: Principles, missions, and challenges, IEEE Network38, 112 (2024)

    2024

  41. [50]

    Mundada, G

    P. Mundada, G. Zhang, T. Hazard, and A. Houck, Suppression of qubit crosstalk in a tunable coupling superconducting circuit, Phys. Rev. Appl.12, 054023 (2019)

    2019

  42. [51]

    P. Zhao, K. Linghu, Z. Li, P. Xu, R. Wang, G. Xue, Y . Jin, and H. Yu, Quantum crosstalk analysis for simultaneous gate operations on superconducting qubits, PRX Quantum3, 020301 (2022)

    2022

  43. [52]

    Yang, H.-F

    X.-Y . Yang, H.-F. Zhang, L. Du, H.-R. Tao, L.-L. Guo, T.-L. Wang, Z.-L. Jia, W.-C. Kong, Z.-Y . Chen, P. Duan,et al., Fast, universal scheme for calibrating microwave crosstalk in super- conducting circuits, Applied Physics Letters125(2024)

    2024

  44. [53]

    Rodrigo, S

    S. Rodrigo, S. Abadal, C. G. Almud ´ever, and E. Alarc´on, Mod- elling short-range quantum teleportation for scalable multi-core quantum computing architectures (2021)

    2021

  45. [54]

    X. Li, Y . Ma, J. Han, T. Chen, Y . Xu, W. Cai, H. Wang, Y . Song, Z.-Y . Xue, Z.-q. Yin, and L. Sun, Perfect quantum state transfer in a superconducting qubit chain with parametrically tunable couplings, Phys. Rev. Appl.10, 054009 (2018)

    2018

  46. [55]

    Demonstrating Coherent Quantum Routers for Bucket-Brigade Quantum Random Access Memory on a Superconducting Processor

    M. Christandl, N. Datta, T. C. Dorlas, A. Ekert, A. Kay, and A. J. Landahl, Perfect transfer of arbitrary states in quantum spin networks, Phys. Rev. A71, 032312 (2005). S1 Supplementary Information for “Demonstrating Coherent Quantum Routers for Bucket-Brigade Quantum Random ...

    2005

  47. [56]

    The topology of the chip is shown in Fig

    DEVICE We conducted experiments on a superconducting quantum processor namedWukong, comprising 72 transmon superconduct- ing qubits (Q) and 126 transmon-type couplers (C) arranged in a grid-like topology. The topology of the chip is shown in Fig. S1. We selected ten of these q...

  48. [57]

    CONTROLLED SW AP OPERATION BASED ON TRANSITION COMPOSITE GATE SCHEME This section presents a comprehensive overview of the theoretical framework and experimental results for the controlled SW AP (CSW AP) operation developed in this study [S9, S11]. In previous work, we propose...

  49. [58]

    QUANTUM ROUTER A. Quantum router and address-path entanglement validation This section presents the theoretical framework and experimental validation of address–path entanglement in the QRouter, using the non-eraser scheme (|L⟩=|0⟩,|R⟩=|1⟩) as a representative case for simplic...

  50. [59]

    Routing system layout design We present a practical layout strategy for implementing a quantum routing system on a lattice-based quantum processor

    QUANTUM ROUTING NETWORK TOW ARDS QUANTUM RANDOM ACCESS MEMORY A. Routing system layout design We present a practical layout strategy for implementing a quantum routing system on a lattice-based quantum processor. Realizing a QRAM prototype requires the systematic arrangement a...

  51. [60]

    The resulting population landscapes, shown in Fig

    of control nodesC 1 andC 2 by adjusting the parametersθ 1 andθ 2, while monitoring the population dynamics of the target data qubitsD 1 andD 2. The resulting population landscapes, shown in Fig. S7(a), reveal that whenθ 1 = 0and θ2 =π, the population ofD 1 reaches a maximum of...

  52. [61]

    Simulation results of eraser-detection This section presents a theoretical and simulation-based analysis of the effects of decoherence and eraser-detection with post-selection (PS)

    SIMULATION AND ANALYSIS A. Simulation results of eraser-detection This section presents a theoretical and simulation-based analysis of the effects of decoherence and eraser-detection with post-selection (PS). Decoherence refers to the interaction between a quantum system and i...

  53. [62]

    The SPTCG scheme employs a non-unitary evolution process to achieve unidirectional state transitions from one initial state to the target state

    UNIDIRECTIONAL QUANTUM ROUTING NETWORK BASED ON THE SHORT PATH DESIGN This section presents the design of unidirectional quantum routers (QRouters) implemented via the short-path transition con- trolled gate (SPTCG) scheme [S8]. The SPTCG scheme employs a non-unitary evolution...

    2020 arXiv

Pith tools

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