Pith. sign in

REVIEW 4 major objections 4 minor 69 references

OneAdapt: Adaptive Compilation for Resource-Constrained Photonic One-Way Quantum Computing

T0 review · 4 major / 4 minor · reviewed 2026-08-16 · deepseek-v4-flash

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

Pith's one-line read OneAdapt claims a resource-adaptive compiler for photonic one-way quantum computing that reduces 1D depth by 3.68x over a flexible-lattice IR and shrinks 2D area from 8x8 to 3x3 for 64-qubit programs.

desk verdict A credible compiler/IR extension with large measured depth reductions; main caveats are missing code/data, randomized placement without seeds, and a hardware-cost assumption for skewed edges supported only by simulation. read the letter →

arxiv 2504.17116 v1 pith:QIMPCKJB submitted 2025-04-23 quant-ph cs.AR

Hezi Zhang , Jixuan Ruan , Dean Tullsen , Yufei Ding , Ang Li , Travis S. Humble This is my paper · ORCID
classification quant-phcs.AR PACS 03.67.Lx
keywords photonicquantumcomputingmeasurement-basedone-wayintermediaterepresentationcompileroptimizationtemporaledgesfusion-basedarchitecturefault-tolerant
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

Photonic one-way quantum computers run a program as a sequence of measurements on a large entangled state generated by fusing small resource states. That entangled state is the intermediate representation (IR) linking program to hardware, and its shape determines required chip area, number of fusion devices, and runtime. This paper claims that a new IR—keeping the lattice structure of a cluster state but bounding temporal-edge lengths and allowing those edges to skew one step within a 2D layer—lets a resource-adaptive compiler reduce the 1D depth of compiled programs by 3.68x on average over a flexible-lattice IR, while respecting a user-given bound on temporal-edge length. Relative to a cluster-state compiler the paper reports a 3.56x depth reduction at length limit 1, and a 2.87x depth reduction in surface-code fault-tolerant settings. These numbers matter because they translate into fewer delay lines and fusion devices on each chiplet, shorter photon storage times, and smaller chip count.

What carries the argument

The central object is an extended flexible-lattice IR: a 3D lattice with two finite spatial dimensions and one infinite temporal dimension, in which every temporal edge has length at most $D_f$ and may connect nodes whose 2D coordinates differ by a Hamming distance of 1. The mechanism that makes the claims work is a pair of optimization passes on this IR. Dynamic node refresh selects nodes stored in delay lines, remaps them to the current 2D layer before their age reaches the limit, and tunes the fraction of refreshed positions so that new nodes still have room; 2D-bounded temporal routing chooses each refreshed node's new position within the unit Hamming ball to either minimize distance to already-mapped neighbors or maximize free space. Together they convert the unbounded fusion-device cost of flexible temporal edges into a controllable resource while keeping the physical layer-generation procedure, based on percolation and path searching among successful fusions, essentially unchanged.

What would settle it

A hardware experiment would settle the claim: generate a series of 2D layers with Hamming-distance-1 skewed temporal edges under 75% fusion success, and measure the average physical-to-logical layer ratio and success probability of the skewed path searches. If the ratio rises substantially above the roughly 3.1 value reported for straight temporal edges, or if skewed paths fail much more often than straight ones, the claimed depth and area reductions are not attainable at the assumed hardware cost.

Watch

Extended reading notes

Core claim

The central claim is that the conflict between easy hardware generation and efficient program mapping in photonic MBQC can be bypassed by an IR that sits between the rigid cluster state and the unbounded graph state. The IR keeps a lattice within each finite 2D layer, allows temporal edges between layers only up to an adaptive length limit $D_f$, and permits temporal edges to connect nodes at Hamming distance 1 in the 2D plane, which the paper argues requires little physical modification. Two passes carry the result: dynamic node refresh remaps nodes before their delay-line storage reaches the limit, removing the dedicated refresh layers of prior work; and 2D-bounded temporal routing uses skewed edges to bring connected nodes together, behaving like a native SWAP in the simplest case and more generally reducing both depth and area. The evaluation claims an average 3.68x 1D-depth reduction over the prior flexible-lattice compiler with all temporal edges within the specified $D_f$ (the baseline overshoots by 89.9% on average), a 3.56x depth reduction at $D_f=1$ against a cluster-state-style compiler, 2D size reduction from 8x8 to 3x3 for 64-qubit programs at $D_f=10$, and a 2.87x resource reduction in surface-code FTQC.

Load-bearing premise

The load-bearing premise is that skewed temporal edges—edges that connect nodes one step apart in the 2D plane across nearby layers—can be realized on photonic hardware with only minor modifications and with no meaningful increase in the physical-to-logical layer ratio; the paper's evidence for this is its own simulation, not a hardware demonstration.

Editorial extensions

If this is right

  • A processor with a fixed set of fusion devices can run any compiled program up to a chosen temporal-edge bound, because every temporal edge is guaranteed to be no longer than $D_f$.
  • At $D_f = 1$, the compiled IR has zero measurement wait, so one measurement device per chiplet suffices and the compiler becomes a direct competitor to cluster-state mapping.
  • Allowing temporal edges of length up to 10 lets 64-qubit benchmarks fit on a 3x3 grid instead of 8x8, with the 3D volume roughly halved despite a local depth increase.
  • The same dynamic refresh that bounds fusion-device needs also cuts surface-code FTQC resource consumption by an average factor of 2.87x, so the benefit is not limited to the NISQ regime.

Reading between the lines

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

  • The reported 2.01x advantage over a SWAP-strengthened baseline implies that the value of 2D-bounded temporal routing is global position choice, not just qubit swapping, so circuits with heavy routing demand such as QFT should show the largest gains.
  • If the Hamming-distance-1 skew is physically confirmed, the IR could cut delay-line diversity: instead of building $O(n)$ distinct delay-line lengths for edges up to length $n$, only the lengths actually used by the compiled IR would need to be fabricated.
  • The refresh bound $b_r$ and its tuning parameter $p$ are heuristics; an online controller that adapts them to observed congestion and delay-line occupancy is a natural extension that could reduce depth further without changing the IR.
  • Dynamic refresh is fundamentally a delay-line memory management policy, so the idea should transfer to other quantum platforms with bounded intermediate storage, though the paper only evaluates it on photonic fusion hardware.
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, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The manuscript introduces OneAdapt, an MBQC compiler for photonic one-way quantum computing. It proposes an intermediate representation that extends the FlexLattice IR by (i) bounding the length of temporal edges via dynamic node refresh and (ii) permitting skewed temporal edges within Hamming distance 1, exploited by a 2D-bounded temporal routing pass. The evaluation reports, relative to the OnePerc FlexLattice compiler, a 3.68x average reduction in 1D depth with bounded temporal-edge lengths, and relative to a Qiskit-adapted cluster-state baseline a 3.56x reduction; it also reports a reduction of the required 2D size for 64-qubit programs from 8x8 to 3x3 at D_f=10, and a 2.87x depth reduction in a surface-code FTQC setting. The central contribution is a resource-adaptive IR and associated compiler passes, with the physical realizability of skewed edges as the key enabling assumption.

Significance. If the reported numbers hold, OneAdapt would be a meaningful step toward resource-constrained photonic MBQC: the IR-level depth and area reductions are large, the dynamic-refresh design is a clean idea, and the inclusion of an independent Qiskit-based baseline and an ablation isolates the effect of the 2D-bounded routing. The depth numbers in Tables 1 and 2 are measured compiler outputs rather than fitted quantities, and the PL-ratio result reproduces the prior OnePerc value, which indicates internal consistency rather than circularity. The overall significance is, however, conditional on the physical overhead of skewed edges: the claim that Hamming-distance-1 skew is nearly free is supported only by the authors' own randomized simulation, not by a hardware scheme or a test on compiler-generated skew patterns. Reproducibility also limits confidence: no code or data are provided and randomized heuristics are evaluated with single values.

major comments (4)
  1. [Sec. 4.5, Fig. 10(a)] The central physical-realizability claim is not supported by the experiment presented. Fig. 10(a) measures PL ratio by selecting 10-40% of all possible skewed edges at random and skewing them in random directions on a 6x6 lattice; but the compiler's routing heuristics in Sec. 4.4 choose positions to minimize inter-node distances or maximize free space, so actual skew patterns are likely more directionally correlated and can differ substantially from random samples. The claim that PL ratio remains about 3.1 should be verified on the actual compiler-generated output, including the extreme 3x3 / D_f=10 regime of Fig. 11(c), with a distribution over compilation seeds. Without this, the advertised depth and area reductions cannot be translated into physical resource savings.
  2. [Sec. 4.5] Section 4.5 asserts that realizing skewed temporal edges requires 'little modification' because path searching can connect IR nodes at nearby 2D locations across layers, but it does not provide a concrete physical routing scheme, a resource accounting of additional delay lines or switches, or any hardware demonstration. The IR-level model counts logical nodes and layers only; it does not model whether skewed paths can be implemented with the same fusion devices and delay-line resources, or whether extra switches and delay lines are needed. Please either give an explicit physical construction with its hardware overhead, or soften the conclusion so that the depth and size reductions are claimed at the IR level rather than as physical resource reductions.
  3. [Sec. 4.1, Tables 1-3] Results are not reproducible from the manuscript. The compilation flow in Sec. 4.1 includes random selection of new nodes and random placement in multiple rounds, yet Tables 1-3 and Fig. 11 report a single value per configuration without seeds, variance, or a statement of the number of runs. Since the improvements are factor-level (3.68x, 3.56x, 2.87x), a randomized heuristic evaluated once per point does not rule out seed-dependent outliers. Please provide the artifact and report the mean and spread (or min/max) over a fixed number of seeds.
  4. [Table 3] The ablation in Table 3 has many '-' entries in the 'w/o 2D-bounded temporal routing' columns, and the text states that compilation 'would get stuck at the level of D_f ~ 75 layers' without stating the criterion for being stuck or explaining each missing entry. Since this table supports the load-bearing claim that the 2D-bounded temporal routing is what makes small D_f attainable, please specify whether missing entries are failed compilations, not attempted, or omitted for space, and give the exact congestion or failure criterion.
minor comments (4)
  1. [Abstract and Sec. 1] The phrase 'compilers on previous IRs lacks the adaptability' contains a subject-verb agreement error and should read 'lack adaptability.'
  2. [Sec. 3.1, Fig. 6(c2)] The sentence 'the lengths of edge e2, e4, e6 and e6 are also reduced to 4' should read 'e2, e4, e5 and e6'; the duplicate 'e6' appears to be a typo.
  3. [Sec. 4.3, Eq. (1)] The parameter p in Eq. (1) is described as adjustable with a default of 0.4, but no sensitivity analysis is reported; please state how results change with p or justify the fixed choice.
  4. [Sec. 5.1, Baseline 1] The description 'we restrict the number of dependency layers that can appear on each layer (2 is achievable)' is unclear; please specify the algorithmic mechanism and why 2 is the achievable bound.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the compiler results are measured against independent or prior-work baselines, and the PL-ratio feasibility check is a simulation consistency result rather than a fitted prediction.

full rationale

The paper's central claims are benchmark measurements, not quantities derived from fitted inputs. The 3.68x depth improvement over OnePerc and the 3.56x improvement over the Qiskit-derived baseline come from Table 1 and Table 2, which report compiler outputs produced by the authors' implementation and by the baseline compilers; these are observed quantities, not consequences of definitions. The adaptive bound D_f is a constraint enforced by the dynamic refresh pass, and Table 1 shows the compiled D_f values do satisfy the bound, which is a design guarantee rather than a self-referential prediction. The one potentially load-bearing self-citation is the PL-ratio feasibility argument in Section 4.5 and Fig. 10. There, the paper claims skewed edges introduce negligible overhead and cites a PL ratio of about 3.1 that aligns with the FlexLattice IR result from the authors' prior OnePerc work. This is not circular: Fig. 10(a) is a randomized simulation of skewed-edge densities, Fig. 10(b) compiles benchmark programs and reports the resulting PL ratio, and the ~3.1 value is a measured consistency check with a previously reported number, not a parameter fitted to reproduce that target. The adjustable parameter p in Eq. (1) is a heuristic tuning knob; the paper explicitly states its effect on depth and path-searching overhead, and no headline result depends on a specific fitted value of p. The QEC comparison in Section 5.4 compares dynamic refresh against a static interleaving strategy, and the 2.87x depth reduction is again a measured outcome. Self-citations to OnePerc [24] and OneQ [43] are present and the reviewers noted that the primary baseline is the authors' own compiler, but the baseline outputs are obtained by running the cited prior compilers under stated strategies, so the comparison is empirical rather than definitional. No step in the derivation chain reduces to its own input, and no fitted parameter is repackaged as a prediction. The paper is therefore self-contained against external and prior-work baselines, with no significant circularity.

Assumptions & free parameters 4 free parameters · 6 assumptions · 0 invented entities

The central claims rest on several assumptions inherited from prior hardware architectures and MBQC theory, plus one assumption specific to this paper: that Hamming-distance-1 skewed temporal edges are physically cheap. The hand-set refresh parameter p and the fixed PL ratio are the main free choices; neither is fitted to reproduce the headline depth numbers, but p is not sensitivity-tested. No new physical entities are introduced.

free parameters (4)
  • refresh bound parameter p = 0.4 (default)
    Equation (1) sets b_r = min(m_last/S + p, 1); p trades optional refresh aggressiveness against 1D depth and is hand-chosen with no sensitivity analysis across benchmarks.
  • PL ratio allocation = 4
    Section 5.1 fixes PL ratio to 4, slightly above the simulated average of ~3.1, to ensure high IR generation success; this scales RSL counts and wait times, though it does not affect the depth ratios reported in Table 1.
  • Hamming skew distance = 1
    Section 4.4 restricts skewed edges to Hamming distance 1 based on Fig 10(a) to keep the PL ratio near FlexLattice; this is a design choice informed by simulation, not a fitted parameter.
  • refresh period D_f in FTQC evaluation = matched to 1:1:1 baseline
    In Section 5.4, D_f is configured to match the best baseline ratio; Fig 13 scans D_f from 40 to 80 for 30-qubit circuits. This is an evaluation configuration choice, not a universal constant.
assumptions (6)
  • domain assumption Hardware model of fusion-based photonic processors: resource state generators, delay lines, fusion and measurement devices per chiplet, one resource state per cycle, and same-cycle fusions restricted to neighbors.
    Section 2.2 and Fig 4; inherited from the PsiQuantum architecture and OnePerc [24].
  • domain assumption IR temporal edges are realized by delay lines of varying lengths, and supporting edges of arbitrary length 1..n requires O(n) fusion devices with distinct delay lines.
    Section 1, first contribution; this motivates bounding temporal edge lengths.
  • standard math Two consecutive X or three consecutive Y measurements implement an identity up to Pauli corrections, enabling node refresh.
    Section 4.3, citing [18,22]; standard MBQC identity pattern.
  • ad hoc to paper Skewed temporal edges within Hamming distance 1 can be realized by small modifications to path searching, with negligible hardware overhead.
    Section 4.5; only supported by the paper's own PL-ratio simulation in Fig 10, not by hardware demonstration.
  • standard math The dependency DAG from measurement calculus correctly captures all real-time feedforward constraints.
    Section 4.2, citing [22,59].
  • domain assumption Surface code can be implemented foliated on resource state layers with Raussendorf cluster states, with patches interleaved as in Fig 5.
    Sections 2.4 and 5.4, citing [19,49,51,53].

how reviews work

0 comments
Cite this review

Pith. "Pith review of OneAdapt: Adaptive Compilation for Resource-Constrained Photonic One-Way Quantum Computing." pith.science (2026). https://pith.science/paper/QIMPCKJB

@misc{pith2026250417116,
  author       = {Pith},
  title        = {Pith review of: OneAdapt: Adaptive Compilation for Resource-Constrained Photonic One-Way Quantum Computing},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/QIMPCKJB}},
  note         = {Machine review of arXiv:2504.17116}
}
read the original abstract

Measurement-based quantum computing (MBQC), a.k.a. one-way quantum computing (1WQC), is a universal quantum computing model, which is particularly well-suited for photonic platforms. In this model, computation is driven by measurements on an entangled state, which serves as an intermediate representation (IR) between program and hardware. However, compilers on previous IRs lacks the adaptability to the resource constraint in photonic quantum computers. In this work, we propose a novel IR with new optimization passes. Based on this, it realizes a resource-adaptive compiler that minimizes the required hardware size and execution time while restricting the requirement for fusion devices within an adaptive limit. Moreover, our optimization can be integrated with Quantum Error Correction (QEC) to improve the efficiency of photonic fault-tolerant quantum computing (FTQC).

Figures

Figures reproduced from arXiv: 2504.17116 by the authors.

Figure 1
Figure 1. Different IRs for photonic one-way quantum computing. [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Physical hardware of photonic platform. purple fibers represent a no-delay and a two-layer delay: photons generated two layers apart can be routed through these fibers to arrive simultaneously at the fusion device. Second, we introduce skewed temporal edges, which are allowed to connect nodes on different 2D layers within a small 2D distance. While the FlexLat￾tice IR only permits temporal edges between nodes at the… view at source ↗
Figure 3
Figure 3. 1-qubit teleportation (a) and its generalization (b). [PITH_FULL_IMAGE:figures/full_fig_p003_3.png] view at source ↗
Figures from the paper (10 more)
Figure 4
Figure 4. Figure 4: Physical hardware of photonic platform the resource states around 𝐵 are delayed to fuse with the RSL after the second logical layer, unlike other resource states that are fused with their next RSL. PL Ratio Due to fusion failures, the formation of each logical layer co…
Figure 5
Figure 5. Figure 5: Periodic Refresh for QEC Fusion-based architectures require a large QEC code distance due to the need to tolerate the high fusion failure rate and photon loss rate [53], leading to a requirement for large RSLs. This resource overhead can be mitigated by a space-time tr…
Figure 6
Figure 6. Figure 6: IR in OnePerc (a) and IR in this paper (b). Dynamic refreshing that prevents temporal edges from exceeding a length [PITH_FULL_IMAGE:figures/full_fig_p005_6.png]
Figure 7
Figure 7. Figure 7: Compilation flow. Scheduling As shown in [PITH_FULL_IMAGE:figures/full_fig_p006_7.png]
Figure 8
Figure 8. Figure 8: Insertion of identity patterns (a) XX and (b) YYY. [PITH_FULL_IMAGE:figures/full_fig_p007_8.png]
Figure 10
Figure 10. Figure 10: This means that the refreshed nodes can be mapped to [PITH_FULL_IMAGE:figures/full_fig_p007_10.png]
Figure 10
Figure 10. Figure 10: Effects of IR extension. temporal edges become denser. Moreover, when the skew distance is restricted to only 1, the PL ratio is about the same as that of FlexLattice IR, which corresponds to a 2D skew limit of 0. To prevent an increased overhead, our extended IR rest…
Figure 11
Figure 11. Figure 11: Effects of 2D size on 64-qubit programs when [PITH_FULL_IMAGE:figures/full_fig_p010_11.png]
Figure 12
Figure 12. Figure 12: Effect of dynamic refresh when QEC is incorporated. [PITH_FULL_IMAGE:figures/full_fig_p011_12.png]
Figure 13
Figure 13. Figure 13: Effects of refresh period limit on QEC depth. [PITH_FULL_IMAGE:figures/full_fig_p011_13.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

69 extracted references · 37 canonical work pages

  1. [1]

    O’Brien, Akira Furusawa, and Jelena Vučković

    Jeremy L. O’Brien, Akira Furusawa, and Jelena Vučković. Photonic quantum technologies. Nature Photonics, 3(12):687, 2009. URL: https://www.nature.com/ articles/nphoton.2009.229, doi:10.1038/nphoton.2009.229

    doi:10.1038/nphoton.2009.229 2009

  2. [2]

    Bogdanov, M

    S. Bogdanov, M. Y. Shalaginov, A. Boltasseva, and V. M. Shalaev. Material platforms for integrated quantum photonics. Opt. Mater. Express , 7(1):111– 132, Jan 2017. URL: http://opg.optica.org/ome/abstract.cfm?URI=ome-7-1-111, doi:10.1364/OME.7.000111

    doi:10.1364/ome.7.000111 2017

  3. [3]

    Quantum computational advantage using photons.Science, 370(6523):1460–1463, 2020

    Han-Sen Zhong, Hui Wang, Yu-Hao Deng, Ming-Cheng Chen, Li-Chao Peng, Yi-Han Luo, Jian Qin, Dian Wu, Xing Ding, Yi Hu, Peng Hu, Xiao-Yan Yang, Wei-Jun Zhang, Hao Li, Yuxuan Li, Xiao Jiang, Lin Gan, Guangwen Yang, Lixing You, Zhen Wang, Li Li, Nai-Le Liu, Chao-Yang Lu, and Jian-Wei Pan. Quantum computational advantage using photons.Science, 370(6523):1460–1...

    doi:10.1126/science.abe8770 2020

  4. [4]

    Renema, Chao-Yang Lu, and Jian-Wei Pan

    Han-Sen Zhong, Yu-Hao Deng, Jian Qin, Hui Wang, Ming-Cheng Chen, Li-Chao Peng, Yi-Han Luo, Dian Wu, Si-Qiu Gong, Hao Su, Yi Hu, Peng Hu, Xiao-Yan Yang, Wei-Jun Zhang, Hao Li, Yuxuan Li, Xiao Jiang, Lin Gan, Guangwen Yang, Lixing You, Zhen Wang, Li Li, Nai-Le Liu, Jelmer J. Renema, Chao-Yang Lu, and Jian-Wei Pan. Phase-programmable gaussian boson sampling ...

    2021

  5. [5]

    Madsen, Fabian Laudenbach, Mohsen Falamarzi

    Lars S. Madsen, Fabian Laudenbach, Mohsen Falamarzi. Askarani, Fabien Rortais, Trevor Vincent, Jacob F. F. Bulmer, Filippo M. Miatto, Leonhard Neuhaus, Lukas G. Helt, Matthew J. Collins, Adriana E. Lita, Thomas Gerrits, Sae Woo Nam, Varun D. Vaidya, Matteo Menotti, Ish Dhand, Zachary Vernon, Nicolás Quesada, and Jonathan Lavoie. Quantum computational adva...

    2022

  6. [6]

    A manufacturable platform for photonic quantum computing

    Koen Alexander, Andrea Bahgat, Avishai Benyamini, Dylan Black, Damien Bon- neau, Stanley Burgos, Ben Burridge, Geoff Campbell, Gabriel Catalano, Alex Ceballos, et al. A manufacturable platform for photonic quantum computing. arXiv preprint arXiv:2404.17570, 2024

    arXiv 2024

  7. [7]

    3/4-efficient bell measurement with passive linear optics and unentangled ancillae

    Fabian Ewert and Peter van Loock. 3/4-efficient bell measurement with passive linear optics and unentangled ancillae. Physical review letters, 113(14):140403,

    work page

  8. [8]

    Hartree-fock on a superconducting qubit quantum computer

    Google AI Quantum, Collaborators*†, Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Sergio Boixo, Michael Broughton, Bob B Buckley, et al. Hartree-fock on a superconducting qubit quantum computer. Science, 369(6507):1084–1089, 2020

    work page 2020

Show all 69 references
  1. [9]

    Demonstration of quantum volume 64 on a superconducting quantum computing system

    Petar Jurcevic, Ali Javadi-Abhari, Lev S Bishop, Isaac Lauer, Daniela F Bo- gorin, Markus Brink, Lauren Capelluto, Oktay Günlük, Toshinari Itoko, Naoki Kanazawa, et al. Demonstration of quantum volume 64 on a superconducting quantum computing system. Quantum Science and Techno...

    2021

  2. [10]

    Towards practical quan- tum computers: Transmon qubit with a lifetime approaching 0.5 milliseconds

    Chenlu Wang, Xuegang Li, Huikai Xu, Zhiyuan Li, Junhua Wang, Zhen Yang, Zhenyu Mi, Xuehui Liang, Tang Su, Chuhong Yang, et al. Towards practical quan- tum computers: Transmon qubit with a lifetime approaching 0.5 milliseconds. npj Quantum Information, 8(1):3, 2022

    2022

  3. [11]

    Measurement- induced entanglement phase transition on a superconducting quantum processor with mid-circuit readout

    Jin Ming Koh, Shi-Ning Sun, Mario Motta, and Austin J Minnich. Measurement- induced entanglement phase transition on a superconducting quantum processor with mid-circuit readout. Nature Physics, 19(9):1314–1319, 2023

    2023

  4. [12]

    Demonstration of the trapped-ion quantum ccd computer architecture

    Juan M Pino, Jennifer M Dreiling, Caroline Figgatt, John P Gaebler, Steven A Moses, MS Allman, CH Baldwin, Michael Foss-Feig, David Hayes, Karl Mayer, et al. Demonstration of the trapped-ion quantum ccd computer architecture. Nature, 592(7853):209–213, 2021

    2021

  5. [13]

    A universal qudit quantum processor with trapped ions

    Martin Ringbauer, Michael Meth, Lukas Postler, Roman Stricker, Rainer Blatt, Philipp Schindler, and Thomas Monz. A universal qudit quantum processor with trapped ions. Nature Physics, 18(9):1053–1057, 2022

    2022

  6. [14]

    Measurement-induced quantum phases realized in a trapped-ion quantum computer

    Crystal Noel, Pradeep Niroula, Daiwei Zhu, Andrew Risinger, Laird Egan, De- bopriyo Biswas, Marko Cetina, Alexey V Gorshkov, Michael J Gullans, David A Huse, et al. Measurement-induced quantum phases realized in a trapped-ion quantum computer. Nature Physics, 18(7):760–764, 2022

    2022

  7. [15]

    Aquila: Quera’s 256-qubit neutral-atom quantum computer

    Jonathan Wurtz, Alexei Bylinskii, Boris Braverman, Jesse Amato-Grill, Sergio H Cantu, Florian Huber, Alexander Lukin, Fangli Liu, Phillip Weinberg, John Long, et al. Aquila: Quera’s 256-qubit neutral-atom quantum computer. arXiv preprint arXiv:2306.11727, 2023

    2023 arXiv

  8. [16]

    High-fidelity parallel entangling gates on a neutral-atom quantum computer

    Simon J Evered, Dolev Bluvstein, Marcin Kalinowski, Sepehr Ebadi, Tom Manovitz, Hengyun Zhou, Sophie H Li, Alexandra A Geim, Tout T Wang, Nishad Maskara, et al. High-fidelity parallel entangling gates on a neutral-atom quantum computer. Nature, 622(7982):268–272, 2023

    2023

  9. [17]

    Logical quantum processor based on reconfigurable atom arrays

    Dolev Bluvstein, Simon J Evered, Alexandra A Geim, Sophie H Li, Hengyun Zhou, Tom Manovitz, Sepehr Ebadi, Madelyn Cain, Marcin Kalinowski, Dominik Hangleiter, et al. Logical quantum processor based on reconfigurable atom arrays. Nature, 626(7997):58–65, 2024

    2024

  10. [18]

    Measurement-based quantum computation on cluster states

    Robert Raussendorf, Dan Browne, and Hans Briegel. Measurement-based quantum computation on cluster states. Raussendorf, R. and Browne, D.E. and Briegel, H.J. (2003) Measurement-based quantum computation on cluster states. Physical Review A, 68 (2). 022312.1-022312.32. ISSN 105...

    2003

  11. [19]

    Fusion based photonic quantum computing

    Terry Rudolph. Fusion based photonic quantum computing. In APS March Meeting Abstracts, volume 2022, pages D28–001, 2022. URL: https://www.nature. com/articles/s41467-023-36493-1, doi:10.1038/s41467-023-36493-1

    2022 doi

  12. [20]

    Entanglement in graph states and its applications

    Marc Hein, Wolfgang Dür, Jens Eisert, Robert Raussendorf, Maarten Van den Nest, and H-J Briegel. Entanglement in graph states and its applications. In Quantum computers, algorithms and chaos , pages 115–218. IOS Press, 2006

    2006

  13. [21]

    Determinism in the one-way model

    Vincent Danos and Elham Kashefi. Determinism in the one-way model. Physical Review A—Atomic, Molecular, and Optical Physics, 74(5):052310, 2006

    2006

  14. [22]

    Parallelizing quantum circuits

    Anne Broadbent and Elham Kashefi. Parallelizing quantum circuits. Theoreti- cal computer science, 410(26):2489–2510, 2009. URL: https://www.sciencedirect. com/science/article/pii/S0304397508009377?via%3Dihub, doi:10.1016/j.tcs. 2008.12.046

    2009 doi

  15. [23]

    Fmcc: Flexible measurement-based quantum computation over cluster state

    Yingheng Li, Aditya Pawar, Zewei Mo, Youtao Zhang, Jun Yang, and Xulong Tang. Fmcc: Flexible measurement-based quantum computation over cluster state. In Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Syste...

    2024

  16. [24]

    Oneperc: A randomness-aware compiler for photonic quantum computing

    Hezi Zhang, Jixuan Ruan, Hassan Shapourian, Ramana Rao Kompella, and Yufei Ding. Oneperc: A randomness-aware compiler for photonic quantum computing. In Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating System...

    2024

  17. [25]

    Arbitrarily complete bell-state measurement using only linear optical elements

    Warren P Grice. Arbitrarily complete bell-state measurement using only linear optical elements. Physical Review A, 84(4):042331, 2011. URL: https://journals. aps.org/pra/abstract/10.1103/PhysRevA.84.042331, doi:10.1103/PhysRevA.84. 042331

    2011 doi

  18. [26]

    Interleaving: Modular architectures for fault-tolerant photonic quantum computing (2021)

    H Bombin, IH Kim, D Litinski, N Nickerson, M Pant, F Pastawski, S Roberts, and T Rudolph. Interleaving: Modular architectures for fault-tolerant photonic quantum computing (2021). arXiv preprint arXiv:2103.08612. URL: https://arxiv. org/abs/2103.08612, doi:10.48550/arXiv.2103.08612

    2021 doi arXiv

  19. [27]

    Zx-calculus for the working quantum computer scientist

    John van de Wetering. Zx-calculus for the working quantum computer scientist. arXiv preprint arXiv:2012.13966, 2020

    2012 arXiv

  20. [28]

    Pyzx: Large scale automated dia- grammatic reasoning

    Aleks Kissinger and John van de Wetering. Pyzx: Large scale automated dia- grammatic reasoning. arXiv preprint arXiv:1904.04735, 2019. 12 OneAdapt: Adaptive Compilation for Resource-Constrained Photonic One-Way Quantum Computing

    1904 arXiv

  21. [29]

    Linear optical quantum computing with photonic qubits

    Pieter Kok, William J Munro, Kae Nemoto, Timothy C Ralph, Jonathan P Dowling, and Gerard J Milburn. Linear optical quantum computing with photonic qubits. Reviews of modern physics , 79(1):135, 2007. URL: https://journals.aps.org/rmp/ abstract/10.1103/RevModPhys.79.135, doi:10...

    2007 doi

  22. [30]

    Fusion of deterministically generated photonic graph states

    Philip Thomas, Leonardo Ruscio, Olivier Morin, and Gerhard Rempe. Fusion of deterministically generated photonic graph states. Nature, 629(8012):567–572, 2024

    2024

  23. [31]

    Deterministic generation of multidimensional photonic cluster states with a single quantum emitter

    Vinicius S Ferreira, Gihwan Kim, Andreas Butler, Hannes Pichler, and Oskar Painter. Deterministic generation of multidimensional photonic cluster states with a single quantum emitter. Nature Physics, 20(5):865–870, 2024

    2024

  24. [32]

    High-rate entanglement between a semiconductor spin and indistinguishable photons

    N Coste, DA Fioretto, N Belabas, SC Wein, P Hilaire, R Frantzeskakis, M Gundin, B Goes, N Somaschi, M Morassi, et al. High-rate entanglement between a semiconductor spin and indistinguishable photons. Nature Photonics, 17(7):582– 587, 2023

    2023

  25. [33]

    Deterministic gener- ation of indistinguishable photons in a cluster state

    Dan Cogan, Zu-En Su, Oded Kenneth, and David Gershoni. Deterministic gener- ation of indistinguishable photons in a cluster state. Nature Photonics, 17(4):324– 329, 2023

    2023

  26. [34]

    Efficient generation of entangled multiphoton graph states from a single atom

    Philip Thomas, Leonardo Ruscio, Olivier Morin, and Gerhard Rempe. Efficient generation of entangled multiphoton graph states from a single atom. Nature, 608(7924):677–681, 2022

    2022

  27. [35]

    Sequential generation of multiphoton entanglement with a rydberg superatom

    Chao-Wei Yang, Yong Yu, Jun Li, Bo Jing, Xiao-Hui Bao, and Jian-Wei Pan. Sequential generation of multiphoton entanglement with a rydberg superatom. Nature Photonics, 16(9):658–661, 2022

    2022

  28. [36]

    Realizing a deterministic source of multipartite-entangled photonic qubits

    Jean-Claude Besse, Kevin Reuer, Michele C Collodo, Arne Wulff, Lucien Wernli, Adrian Copetudo, Daniel Malz, Paul Magnard, Abdulkadir Akin, Mihai Gabureac, et al. Realizing a deterministic source of multipartite-entangled photonic qubits. Nature communications, 11(1):4877, 2020

    2020

  29. [37]

    Sequential generation of linear cluster states from a single photon emitter

    D Istrati, Y Pilnyak, JC Loredo, C Antón, N Somaschi, P Hilaire, H Ollivier, M Esmann, L Cohen, L Vidro, et al. Sequential generation of linear cluster states from a single photon emitter. Nature communications, 11(1):5501, 2020

    2020

  30. [38]

    Deterministic generation of a cluster state of entangled photons

    Ido Schwartz, Dan Cogan, Emma R Schmidgall, Yaroslav Don, Liron Gantz, Oded Kenneth, Netanel H Lindner, and David Gershoni. Deterministic generation of a cluster state of entangled photons. Science, 354(6311):434–437, 2016

    2016

  31. [39]

    Advances in low-loss, large-area, and multicore fibers

    Ming-Jun Li and Tetsuya Hayashi. Advances in low-loss, large-area, and multicore fibers. In Optical Fiber Telecommunications VII , pages 3–50. El- sevier, 2020. URL: https://www.sciencedirect.com/science/article/abs/pii/ B9780128165027000014, doi:10.1016/B978-0-12-816502-7.00001-4

    2020 doi

  32. [40]

    Experi- mental one-way quantum computing

    Philip Walther, Kevin J Resch, Terry Rudolph, Emmanuel Schenck, Harald We- infurter, Vlatko Vedral, Markus Aspelmeyer, and Anton Zeilinger. Experi- mental one-way quantum computing. Nature, 434(7030):169–176, 2005. URL: https://www.nature.com/articles/nature03347, doi:10.1038/...

    2005 doi

  33. [41]

    Experimental realization of the deutsch-jozsa algorithm with a six-qubit cluster state

    Giuseppe Vallone, Gaia Donati, Natalia Bruno, Andrea Chiuri, and Paolo Mataloni. Experimental realization of the deutsch-jozsa algorithm with a six-qubit cluster state. Physical Review A, 81(5):050302, 2010. URL: https://journals.aps.org/pra/ abstract/10.1103/PhysRevA.81.05030...

    2010 doi

  34. [42]

    Experimental realization of a one-way quantum computer algorithm solving simon’s problem

    Mark S Tame, Bryn A Bell, Carlo Di Franco, William J Wadsworth, and John G Rarity. Experimental realization of a one-way quantum computer algorithm solving simon’s problem. Physical Review Letters , 113(20):200501, 2014. URL: https://journals.aps.org/prl/abstract/10.1103/PhysR...

    2014 doi

  35. [43]

    Oneq: A compilation framework for photonic one-way quantum computation

    Hezi Zhang, Anbang Wu, Yuke Wang, Gushu Li, Hassan Shapourian, Alireza Shabani, and Yufei Ding. Oneq: A compilation framework for photonic one-way quantum computation. In Proceedings of the 50th Annual International Symposium on Computer Architecture, pages 1–14, 2023. URL: ht...

    2023

  36. [44]

    The critical probability of bond percolation on the square lattice equals 1/2

    Harry Kesten et al. The critical probability of bond percolation on the square lattice equals 1/2. Communications in mathematical physics , 74(1):41–59,

  37. [45]

    Percolation thresholds for photonic quantum computing

    Mihir Pant, Don Towsley, Dirk Englund, and Saikat Guha. Percolation thresholds for photonic quantum computing. Nature communications, 10(1):1070, 2019. URL: https://www.nature.com/articles/s41467-019-08948-x, doi:10.48550/arXiv. 1701.03775

    2019 doi arXiv

  38. [46]

    Phase transition of computational power in the resource states for one-way quantum computation

    Daniel E Browne, Matthew B Elliott, Steven T Flammia, Seth T Merkel, Akimasa Miyake, and Anthony J Short. Phase transition of computational power in the resource states for one-way quantum computation. New Journal of Physics , 10(2):023010, 2008. URL: https://iopscience.iop.or...

    2008 doi

  39. [47]

    Physical-depth architectural requirements for generating universal photonic cluster states

    Sam Morley-Short, Sara Bartolucci, Mercedes Gimeno-Segovia, Pete Shadbolt, Hugo Cable, and Terry Rudolph. Physical-depth architectural requirements for generating universal photonic cluster states. Quantum Science and Technology, 3(1):015005, 2017

    2017

  40. [48]

    Quantum computation and quantum information

    Michael A Nielsen and Isaac L Chuang. Quantum computation and quantum information. Phys. Today, 54(2):60, 2001. URL: https://cds.cern.ch/record/465953/ files/0521635039_TOC.pdf

    2001

  41. [49]

    Foliated quantum error- correcting codes

    A Bolt, G Duclos-Cianci, D Poulin, and TM Stace. Foliated quantum error- correcting codes. Physical review letters, 117(7):070501, 2016

    2016

  42. [50]

    Surface codes: Towards practical large-scale quantum computation.Physical Review A, 86, 08 2012

    Austin Fowler, Matteo Mariantoni, John Martinis, and Andrew Cleland. Surface codes: Towards practical large-scale quantum computation.Physical Review A, 86, 08 2012. URL: https://journals.aps.org/pra/abstract/10.1103/PhysRevA.86.032324, doi:10.1103/PhysRevA.86.032324

    2012 doi

  43. [51]

    A fault-tolerant one-way quantum computer

    Robert Raussendorf, Jim Harrington, and Kovid Goyal. A fault-tolerant one-way quantum computer. Annals of physics, 321(9):2242–2270, 2006

    2006

  44. [52]

    Lattice surgery on the raussendorf lattice

    Daniel Herr, Alexandru Paler, Simon J Devitt, and Franco Nori. Lattice surgery on the raussendorf lattice. Quantum Science and Technology, 3(3):035011, 2018

    2018

  45. [53]

    Logical blocks for fault-tolerant topological quan- tum computation

    Hector Bombin, Chris Dawson, Ryan V Mishmash, Naomi Nickerson, Fernando Pastawski, and Sam Roberts. Logical blocks for fault-tolerant topological quan- tum computation. PRX Quantum, 4(2):020303, 2023

    2023

  46. [54]

    Surface code quantum computing by lattice surgery

    Dominic Horsman, Austin G Fowler, Simon Devitt, and Rodney Van Meter. Surface code quantum computing by lattice surgery. New Journal of Physics , 14(12):123011, 2012

    2012

  47. [55]

    A game of surface codes: Large-scale quantum computing with lattice surgery

    Daniel Litinski. A game of surface codes: Large-scale quantum computing with lattice surgery. Quantum, 3:128, 2019

    2019

  48. [56]

    A high performance compiler for very large scale surface code computations

    George Watkins, Hoang Minh Nguyen, Keelan Watkins, Steven Pearce, Hoi- Kwan Lau, and Alexandru Paler. A high performance compiler for very large scale surface code computations. Quantum, 8:1354, 2024

    2024

  49. [57]

    Low overhead quantum computation using lattice surgery

    Austin G Fowler and Craig Gidney. Low overhead quantum computation using lattice surgery. arXiv preprint arXiv:1808.06709, 2018

    2018 arXiv

  50. [58]

    Surface code compi- lation via edge-disjoint paths

    Michael Beverland, Vadym Kliuchnikov, and Eddie Schoute. Surface code compi- lation via edge-disjoint paths. PRX Quantum, 3(2):020342, 2022

    2022

  51. [59]

    The measurement calculus

    Vincent Danos, Elham Kashefi, and Prakash Panangaden. The measurement calculus. Journal of the ACM (JACM) , 54(2):8–es, 2007

    2007

  52. [60]

    A new quantum ripple-carry addition circuit

    Steven A Cuccaro, Thomas G Draper, Samuel A Kutin, and David Petrie Moul- ton. A new quantum ripple-carry addition circuit. arXiv preprint quant- ph/0410184, 2004. URL: https://arxiv.org/abs/quant-ph/0410184, doi:10.48550/ arXiv.quant-ph/0410184

    2004

  53. [61]

    Study of adaptative derivative-assemble pseudo-trotter ansatzes in vqe through qiskit api

    Max Alteg, Baptiste Chevalier, Octave Mestoudjian, and Johan-Luca Rossi. Study of adaptative derivative-assemble pseudo-trotter ansatzes in vqe through qiskit api. 2022. arXiv:2210.15438

    2022 arXiv

  54. [62]

    Exploring variational quantum eigensolver ansatzes for the long-range xy model

    Jia-Bin You, Dax Enshan Koh, Jian Feng Kong, Wen-Jun Ding, Ching Eng Png, and Lin Wu. Exploring variational quantum eigensolver ansatzes for the long-range xy model. 2021. arXiv:2109.00288

    2021 arXiv

  55. [63]

    A fast quantum mechanical algorithm for database search

    Lov K Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , pages 212–219, 1996

    1996

  56. [64]

    Supermarq: A scalable quantum benchmark suite

    Teague Tomesh, Pranav Gokhale, Victory Omole, Gokul Subramanian Ravi, Kaitlin N Smith, Joshua Viszlai, Xin-Chuan Wu, Nikos Hardavellas, Margaret R Martonosi, and Frederic T Chong. Supermarq: A scalable quantum benchmark suite. In 2022 IEEE International Symposium on High-Perfo...

    2022

  57. [65]

    Qasmbench: A low-level quantum benchmark suite for nisq evaluation and simulation

    Ang Li, Samuel Stein, Sriram Krishnamoorthy, and James Ang. Qasmbench: A low-level quantum benchmark suite for nisq evaluation and simulation. ACM Transactions on Quantum Computing , 4(2):1–26, 2023

    2023

  58. [66]

    Qiskit: An open-source framework for quantum com- puting, 2023

    Qiskit contributors. Qiskit: An open-source framework for quantum com- puting, 2023. URL: https://zenodo.org/records/2562111, doi:10.5281/zenodo. 2573505. 13

    2023

  59. [1980]

    URL: https://link.springer.com/article/10.1007/BF01197577, doi:10.1007/ BF01197577

    doi

  60. [2003]

    URL: https://journals.aps.org/pra/abstract/10.1103/PhysRevA.68.022312, doi:10.1103/PhysRevA.68.022312

    doi

  61. [2014]

    URL: https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.113.140403, doi:10.1103/PhysRevLett.113.140403

    doi

Pith tools

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