pith. sign in

arxiv: 2605.07518 · v1 · submitted 2026-05-08 · 🪐 quant-ph · cs.DS

Loop Composition in Quantum Algorithms

Stacey Jeffery , Manideep Mamindlapally , Alex Baudoin Nguetsa Tankeu This is my paper

Pith reviewed 2026-05-11 02:04 UTC · model grok-4.3

classification 🪐 quant-ph cs.DS
keywords quantum algorithmsGrover's algorithmquantum walksvariable-time searchbranching compositionloopingcontrol flowalgorithm composition
0
0 comments X

The pith

Extending quantum walk branching to include loops matches prior variable-time search complexities

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

The paper argues that the standard quantum circuit model assumes straight-line programs, which fails to handle subroutines of varying lengths run in superposition. Earlier work modeled branching via quantum walks but produced suboptimal results when applied to Grover's algorithm for variable-time search. By extending the same formalism to also capture looping, the authors recover the complexity bounds from previous specialized constructions. This shows that accurate modeling of control flow structures is necessary for efficient composition of quantum algorithms.

Core claim

The quantum circuit model treats every quantum algorithm as a straight-line program. While this view is universal, it is inconvenient for using different-length quantum subroutines in superposition. Using the quantum walk formalism it is possible to model branching behaviour and obtain better composition. Applying this branching composition to Grover's algorithm yields a variable-time quantum search algorithm that is worse than previous work. Modifying the composition to also include looping produces a complexity that matches previous work, highlighting the importance of properly modeling program control flow when designing quantum algorithms.

What carries the argument

The modified branching composition that incorporates looping within the quantum walk formalism

Load-bearing premise

The quantum walk formalism can be extended to include looping while preserving superposition and without introducing unaccounted overheads that change the claimed complexity.

What would settle it

An analysis or explicit construction of the looped composition applied to variable-time Grover search that produces strictly worse asymptotic complexity than prior work would falsify the claim.

Figures

Figures reproduced from arXiv: 2605.07518 by Alex Baudoin Nguetsa Tankeu, Manideep Mamindlapally, Stacey Jeffery.

Figure 1
Figure 1. Figure 1: Visualization of a straight-line program. [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Visualization of superposition branching, and a subroutine whose behaviour differs per [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Overlap graph for the simpler phase estimation algorithm (no inner transition spaces). [PITH_FULL_IMAGE:figures/full_fig_p016_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: The overlap graph of just the spaces defined by the spans of Ψ [PITH_FULL_IMAGE:figures/full_fig_p019_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Overlap graph of subspaces for subroutine [PITH_FULL_IMAGE:figures/full_fig_p019_5.png] view at source ↗
read the original abstract

The quantum circuit model essentially treats every quantum algorithm as a straight-line program. While this view is universal, recent work has shown that it is inconvenient for using different-length quantum subroutines in superposition. Using the quantum walk formalism of quantum algorithms, it is possible to model such branching behaviour, and get better composition in this setting. We apply the above branching composition to Grover's algorithm, which gives a variable-time quantum search algorithm that is worse than previous work. The reason it is worse is because branching composition does not take into account another deviation from straight-line programs: looping. We show that by modifying branching composition to also include looping, we can get a complexity that matches previous work. This highlights the importance of properly modeling the program control flow when designing quantum algorithms.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 2 minor

Summary. The paper claims that the quantum circuit model is inconvenient for quantum algorithms involving variable-length subroutines in superposition. It uses the quantum walk formalism to model branching behavior for improved composition. Applying branching composition to Grover's algorithm produces a variable-time quantum search whose complexity is worse than prior work. The authors argue this is because branching composition omits looping, and show that modifying the model to include looping yields a complexity matching previous results on variable-time search. This is presented as evidence that proper modeling of program control flow (branching and looping) is essential when designing quantum algorithms.

Significance. If the looped composition construction is correct and introduces no unaccounted overhead in the quantum walk's spectral properties or hitting time, the result would usefully extend prior work on branching composition and variable-time Grover search. It would provide a more complete control-flow model within the quantum walk framework, potentially aiding composition of algorithms with both branches and loops while preserving optimal complexity. The paper does not ship machine-checked proofs or reproducible code, but the central claim is a falsifiable complexity comparison that could be tested against existing variable-time search bounds.

major comments (2)
  1. [Abstract] Abstract: The central claim states that 'by modifying branching composition to also include looping, we can get a complexity that matches previous work,' yet the abstract (and the provided manuscript text) contains no explicit construction of the looped quantum walk operator, no definition of how the coin or position space encodes loop control, no derivation of the modified transition matrix, and no error analysis or direct comparison of the resulting complexity expression to prior variable-time search bounds. This directly impacts the load-bearing claim that the modification preserves superposition without extra factors in spectral gap or mixing time.
  2. [Abstract] Abstract: The stress-test concern about unaccounted overhead in hitting time or effective dimension is not addressed; without an explicit walk construction or spectral analysis, it remains possible that the looped model adds logarithmic or constant factors that would make the final complexity strictly worse than claimed, undermining the assertion that it 'matches previous work.'
minor comments (2)
  1. [Abstract] The abstract refers to 'previous work' on variable-time search without citing specific references or equations from those works, making the complexity comparison difficult to verify.
  2. Notation for the branching and looping modifications is not introduced or defined in the provided text, which hinders readability of the composition rules.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive feedback on the manuscript. We address the major comments point by point below. Where the comments correctly identify areas needing greater explicitness, we have revised the manuscript accordingly.

read point-by-point responses

  1. Referee: [Abstract] Abstract: The central claim states that 'by modifying branching composition to also include looping, we can get a complexity that matches previous work,' yet the abstract (and the provided manuscript text) contains no explicit construction of the looped quantum walk operator, no definition of how the coin or position space encodes loop control, no derivation of the modified transition matrix, and no error analysis or direct comparison of the resulting complexity expression to prior variable-time search bounds. This directly impacts the load-bearing claim that the modification preserves superposition without extra factors in spectral gap or mixing time.

    Authors: We agree that the abstract and main text would benefit from a more explicit outline of the looped construction to support the central claim. The original manuscript presents the modification at a conceptual level, showing how loop control states can be incorporated into the branching walk framework to recover the optimal variable-time search complexity. In the revision, we have expanded the abstract with a brief description of the looped operator and added a dedicated subsection deriving the position/coin encoding for loop iteration, the updated transition matrix, and the hitting-time analysis that matches prior bounds without additional spectral-gap factors. revision: yes

  2. Referee: [Abstract] Abstract: The stress-test concern about unaccounted overhead in hitting time or effective dimension is not addressed; without an explicit walk construction or spectral analysis, it remains possible that the looped model adds logarithmic or constant factors that would make the final complexity strictly worse than claimed, undermining the assertion that it 'matches previous work.'

    Authors: We acknowledge that the original text does not include a self-contained spectral analysis addressing potential overhead. The manuscript argues at a high level that loop composition can be realized by extending the existing coin space without enlarging the effective search dimension asymptotically. To directly address the concern, the revised version now contains an explicit analysis of the modified walk's spectrum, confirming that any constant-factor increase in dimension from loop-control states does not affect the asymptotic hitting time or introduce extra logarithmic terms, thereby preserving the claimed complexity match. revision: yes

Circularity Check

0 steps flagged

Minor self-citation of prior branching model; central looping extension remains independent of fitted inputs

full rationale

The paper's core derivation modifies an existing branching composition (from prior external or self-cited quantum walk work) to incorporate looping, then shows the resulting variable-time search complexity matches known prior results on Grover search. This match is obtained by explicit construction of the looped walk rather than by redefining the target complexity in terms of itself or by fitting parameters to the output data. The only potential circularity is a minor self-citation load for the base branching formalism, but that formalism is not load-bearing for the new looping claim and does not reduce the final complexity bound to a tautology. No equations are shown to be equivalent by construction, no fitted parameters are relabeled as predictions, and no uniqueness theorem is imported from the authors' own prior work to forbid alternatives. The derivation is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the quantum walk formalism from prior work and on the authors' proposed extension for loops; no free parameters or new entities are visible in the abstract.

axioms (2)
  • domain assumption Quantum walk formalism can model branching behavior in superposition
    Invoked when applying branching composition to Grover's algorithm
  • ad hoc to paper Branching composition can be modified to include looping while preserving the model
    The modification is introduced to achieve matching complexity

pith-pipeline@v0.9.0 · 5427 in / 1213 out tokens · 38377 ms · 2026-05-11T02:04:55.799451+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

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

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

Reference graph

Works this paper leans on

300 extracted references · 300 canonical work pages

  1. [1]

    , volume=

    Quantum lower bounds for the collision and the element distinctness problems , author=. , volume=. 2004 , doi =

    work page 2004

  2. [2]

    2006 , note =

    Scott Aaronson , title =. 2006 , note =

    work page 2006

  3. [3]

    2009 , doi =

    Scott Aaronson , title =. 2009 , doi =

    work page 2009

  4. [4]

    Vazirani and Thomas Vidick , Booktitle =

    Aaronson, Scott and Christiano, Paul , title =. 2012 , pages =. doi:10.1145/2213977.2213983 , note =

    work page doi:10.1145/2213977.2213983 2012

  5. [5]

    , volume=

    The Need for Structure in Quantum Speedups , author=. , volume=. 2014 , doi =

    work page 2014

  6. [6]

    Aaronson

    Aaronson, Scott , title =. 2015 , journal =. doi:10.1038/nphys3272 , url =

    work page doi:10.1038/nphys3272 2015

  7. [7]

    Shadow tomography of quantum states (2018)

    Aaronson, Scott , title =. 2018 , pages =. doi:10.1145/3188745.3188802 , note =

    work page doi:10.1145/3188745.3188802 2018

  8. [8]

    Stegun , title =

    Abramowitz, Milton and Irene A. Stegun , title =. 1974 , isbn =

    work page 1974

  9. [9]

    2015 , note=

    Optimal testing for properties of distributions , author=. 2015 , note=

    work page 2015

  10. [10]

    2017 , url =

    A unified maximum likelihood approach for estimating symmetric properties of discrete distributions , author=. 2017 , url =

    work page 2017

  11. [11]

    and Wagner, Aaron B

    Acharya, Jayadev and Issa, Ibrahim and Shende, Nirmal V. and Wagner, Aaron B. , title=. 2019 , pages=. doi:10.1109/ISIT.2019.8849572 , note=

    work page doi:10.1109/isit.2019.8849572 2019

  12. [12]

    Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation , journal =

    Aharonov, Dorit and. Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation , journal =. 2007 , volume =. doi:10.1137/S0097539705447323 , pages =

    work page doi:10.1137/s0097539705447323 2007

  13. [13]

    , volume =

    Aharonov, Dorit and Ta‐Shma, Amnon , title =. , volume =. 2007 , doi =

    work page 2007

  14. [14]

    Annals of Mathematics , volume=

    Quadratic forms permitting composition , author=. Annals of Mathematics , volume=. 1942 , doi =

    work page 1942

  15. [15]

    Reversible

    Aldous, David and Fill, Jim , year=. Reversible

    work page

  16. [16]

    Aleksandrov and Vladimir V

    Alexei B. Aleksandrov and Vladimir V. Peller , title =. Advances in Mathematics , year =. doi:10.1016/j.aim.2009.12.018 , note=

    work page doi:10.1016/j.aim.2009.12.018 2009

  17. [17]

    Aleksandrov and Vladimir V

    Alexei B. Aleksandrov and Vladimir V. Peller , title =. Journal of Functional Analysis , year =. doi:10.1016/j.jfa.2011.07.009 , note=

    work page doi:10.1016/j.jfa.2011.07.009 2011

  18. [18]

    Aleksandrov and Vladimir V

    Alexei B. Aleksandrov and Vladimir V. Peller , title=. , volume=. 2016 , doi=

    work page 2016

  19. [19]

    Spencer , TITLE =

    Noga Alon and Joel H. Spencer , TITLE =. 2008 , ISBN =

    work page 2008

  20. [20]

    1999 , doi =

    Andris Ambainis , title =. 1999 , doi =

    work page 1999

  21. [21]

    2000 , pages =

    Ambainis, Andris , title =. 2000 , pages =. doi:10.1145/335305.335394 , note =

    work page doi:10.1145/335305.335394 2000

  22. [22]

    Ambainis , title =

    A. Ambainis , title =. , volume =. 2002 , note =

    work page 2002

  23. [23]

    2004 , pages =

    Ambainis, Andris , title =. 2004 , pages =. doi:10.1109/FOCS.2004.54 , note =

    work page doi:10.1109/focs.2004.54 2004

  24. [24]

    , year =

    Ambainis, Andris , title =. , year =. doi:10.1137/S0097539705447311 , note =

    work page doi:10.1137/s0097539705447311

  25. [25]

    2005 , note=

    Coins make quantum walks faster , author=. 2005 , note=

    work page 2005

  26. [26]

    2004 , note =

    Ambainis, Andris and Regev, Oded , title =. 2004 , note =

    work page 2004

  27. [27]

    Quantum Algorithms for Matching and Network Flows , booktitle=

    Ambainis, Andris and. Quantum Algorithms for Matching and Network Flows , booktitle=. 2006 , doi=

    work page 2006

  28. [28]

    Childs and Ben W

    Andris Ambainis and Andrew M. Childs and Ben W. Reichardt and Robert. Any. , volume =. 2010 , doi =

    work page 2010

  29. [29]

    , volume =

    Andris Ambainis and Julia Kempe and Or Sattath , title =. , volume =. 2012 , pages =. doi:10.1145/2371656.2371659 , note =

    work page doi:10.1145/2371656.2371659 2012

  30. [30]

    2012 , doi =

    Andris Ambainis , title =. 2012 , doi =

    work page 2012

  31. [31]

    , volume =

    Andris Ambainis , title =. , volume =. 2010 , doi =

    work page 2010

  32. [32]

    2017 , booktitle =

    Ambainis, Andris and Kokainis, Martins , title =. 2017 , booktitle =. doi:10.1145/3055399.3055444 , note =

    work page doi:10.1145/3055399.3055444 2017

  33. [33]

    A ND testing and robust judgement aggregation

    Ambainis, Andris and Gily\'. Quadratic Speedup for Finding Marked Vertices by Quantum Walks , year =. doi:10.1145/3357713.3384252 , note=

    work page doi:10.1145/3357713.3384252

  34. [34]

    Improved

    Ambainis, Andris and Kokainis, Martins and Vihrovs, Jevg. Improved. 2023 , booktitle =

    work page 2023

  35. [35]

    and Andriyash, Evgeny and Rolfe, Jason and Kulchytskyy, Bohdan and Melko, Roger , journal=

    Amin, Mohammad H. and Andriyash, Evgeny and Rolfe, Jason and Kulchytskyy, Bohdan and Melko, Roger , journal=. Quantum. 2018 , doi =

    work page 2018

  36. [36]

    2017 , pages =

    Quantum. 2017 , pages =. doi:10.1109/FOCS.2017.44 , url =

    work page doi:10.1109/focs.2017.44 2017

  37. [37]

    2019 , doi =

    Improvements in Quantum. 2019 , doi =

    work page 2019

  38. [38]

    2020 , volume =

    Convex optimization using quantum oracles , journal =. 2020 , volume =. doi:10.22331/q-2020-01-13-220 , note =

    work page doi:10.22331/q-2020-01-13-220 2020

  39. [39]

    2019 , note =

    Quantum algorithms for zero-sum games , author =. 2019 , note =

    work page 2019

  40. [40]

    , pages =

    Apers, Simon and Sarlette, Alain , title =. , pages =. 2019 , volume =. doi:10.26421/QIC19.3-4 , note =

    work page doi:10.26421/qic19.3-4 2019

  41. [41]

    2020 , booktitle =

    A Unified Framework of Quantum Walk Search , author =. 2020 , booktitle =. doi:10.4230/LIPIcs.STACS.2021.6 , note =

    work page doi:10.4230/lipics.stacs.2021.6 2020

  42. [42]

    Quantum Walks for

    Apers, Simon and Jeffery, Stacey and Pass, Galina and Walter, Michael , year =. Quantum Walks for

    work page

  43. [43]

    , year =

    Arora, Sanjeev and Hazan, Elad and Kale, Satyen , title =. , year =

    work page

  44. [44]

    , volume =

    Arora, Sanjeev and Kale, Satyen , title =. , volume =. 2016 , pages =. doi:10.1145/2837020 , acmid =

    work page doi:10.1145/2837020 2016

  45. [45]

    2014 , URL =

    Srinivasan Arunachalam , TITLE =. 2014 , URL =

    work page 2014

  46. [46]

    , year =

    Srinivasan Arunachalam and Vlad Gheorghiu and Tomas Jochym-O'Connor and Michele Mosca and Priyaa Varshinee Srinivasan , title =. , year =. doi:10.1088/1367-2630/17/12/123010 , note =

    work page doi:10.1088/1367-2630/17/12/123010

  47. [47]

    Optimal Quantum Sample Complexity of Learning Algorithms , booktitle =

    Srinivasan Arunachalam and. Optimal Quantum Sample Complexity of Learning Algorithms , booktitle =. 2017 , doi =

    work page 2017

  48. [48]

    Quantum Query Algorithms are Completely Bounded Forms , booktitle =

    Srinivasan Arunachalam and Jop Bri. Quantum Query Algorithms are Completely Bounded Forms , booktitle =. 2018 , pages =. doi:10.4230/LIPIcs.ITCS.2018.3 , note =

    work page doi:10.4230/lipics.itcs.2018.3 2018

  49. [49]

    Two new results about quantum exact learnings , booktitle =

    Srinivasan Arunachalam and Sourav Chakraborty and Troy Lee and Manaswi Paraashar and. Two new results about quantum exact learnings , booktitle =. 2019 , pages =. doi:10.4230/LIPIcs.ICALP.2019.16 , note =

    work page doi:10.4230/lipics.icalp.2019.16 2019

  50. [50]

    2020 , journal =

    Quantum-inspired algorithms in practice , author=. 2020 , journal =. doi:10.22331/q-2020-08-13-307 , note=

    work page doi:10.22331/q-2020-08-13-307 2020

  51. [51]

    2021 , journal =

    Improved Upper Bounds for the Hitting Times of Quantum Walks , author =. 2021 , journal =. doi:10.1103/PhysRevA.104.032215 , note =

    work page doi:10.1103/physreva.104.032215 2021

  52. [52]

    Michael , title =

    Azoff, E. Michael , title =. 1994 , isbn =

    work page 1994

  53. [53]

    Unsupervised and Transfer Learning - Workshop held at

    Autoencoders, Unsupervised Learning, and Deep Architectures , author =. Unsupervised and Transfer Learning - Workshop held at. 2012 , url =

    work page 2012

  54. [54]

    Quantum State Certification , booktitle =

    B. Quantum State Certification , booktitle =. 2019 , pages =. doi:10.1145/3313276.3316344 , note=

    work page doi:10.1145/3313276.3316344 2019

  55. [55]

    The Interaction Light Cone of the

    Tom Bannink and Harry Buhrman and András Gilyén and M\'. The Interaction Light Cone of the. , year =. doi:10.1007/s10955-019-02351-y , note =

    work page doi:10.1007/s10955-019-02351-y

  56. [56]

    2001 , doi =

    Testing random variables for independence and identity , author=. 2001 , doi =

    work page 2001

  57. [57]

    , volume=

    The complexity of approximating the entropy , author=. , volume=. 2005 , doi =

    work page 2005

  58. [58]

    , volume=

    Testing closeness of discrete distributions , author=. , volume=. 2013 , doi =

    work page 2013

  59. [59]

    Theoretical Computer Science , volume =

    The complexity of partial derivatives , author =. Theoretical Computer Science , volume =. 1983 , doi =

    work page 1983

  60. [60]

    Quantum Lower Bounds by Polynomials , JOURNAL =

    Robert Beals and Harry Buhrman and Richard Cleve and Michele Mosca and. Quantum Lower Bounds by Polynomials , JOURNAL =. 2001 , NOTE =

    work page 2001

  61. [61]

    SIAM Journal on Imaging Sciences , volume =

    Beck, Amir and Teboulle, Marc , title =. SIAM Journal on Imaging Sciences , volume =. 2009 , pages =

    work page 2009

  62. [62]

    2012 , pages =

    Belovs, Aleksandrs , title =. 2012 , pages =

    work page 2012

  63. [63]

    Learning-graph-based quantum algorithm for k -distinctness , Year =

    Belovs, Aleksandrs , Booktitle =. Learning-graph-based quantum algorithm for k -distinctness , Year =. doi:10.1109/FOCS.2012.18 , note =

    work page doi:10.1109/focs.2012.18 2012

  64. [64]

    and Jeffery, Stacey and Kothari, Robin and Magniez, Fr\'

    Belovs, Aleksandrs and Childs, Andrew M. and Jeffery, Stacey and Kothari, Robin and Magniez, Fr\'. Time-Efficient Quantum Walks for 3-Distinctness , booktitle =. 2013 , pages =

    work page 2013

  65. [65]

    2013 , note =

    Belovs, Aleksandrs , title =. 2013 , note =

    work page 2013

  66. [66]

    2015 , note =

    Belovs, Aleksandrs , title =. 2015 , note =

    work page 2015

  67. [67]

    2019 , sseries =

    Belovs, Aleksandrs , title =. 2019 , sseries =. doi:10.4230/LIPIcs.ESA.2019.16 , note =

    work page doi:10.4230/lipics.esa.2019.16 2019

  68. [68]

    2023 , note =

    Belovs, Aleksandrs and Yolcu, Duyal , title =. 2023 , note =

    work page 2023

  69. [69]

    Quantum , vol =

    Belovs, Aleksandrs and Jeffery, Stacey and Yolcu, Duyal , title =. Quantum , vol =. 2024 , doi =

    work page 2024

  70. [70]

    Quantum , vol =

    Belovs, Aleksandrs and Jeffery, Stacey , title =. Quantum , vol =. 2025 , doi =

    work page 2025

  71. [71]

    Childs and András Gilyén and William Kretschmer and Supartha Podder and Daochen Wang , title =

    Shalev Ben-David and Andrew M. Childs and András Gilyén and William Kretschmer and Supartha Podder and Daochen Wang , title =. 2020 , note =

    work page 2020

  72. [72]

    and Bernstein, Ethan and Brassard, Gilles and Vazirani, Umesh , title =

    Bennett, Charles H. and Bernstein, Ethan and Brassard, Gilles and Vazirani, Umesh , title =. , volume =. 1997 , pages =. doi:10.1137/S0097539796300933 , note =

    work page doi:10.1137/s0097539796300933 1997

  73. [73]

    2013 , booktitle =

    Quantum Algorithms for the Subset-Sum Problem , author =. 2013 , booktitle =

    work page 2013

  74. [74]

    and Ahokas, Graeme and Cleve, Richard and Sanders, Barry C

    Berry, Dominic W. and Ahokas, Graeme and Cleve, Richard and Sanders, Barry C. , title=. , year=. doi:10.1007/s00220-006-0150-x , note=

    work page doi:10.1007/s00220-006-0150-x

  75. [75]

    Berry and Andrew M

    Dominic W. Berry and Andrew M. Childs , journal=. Black-box. 2012 , doi =

    work page 2012

  76. [76]

    Berry and Andrew M

    Dominic W. Berry and Andrew M. Childs and Richard Cleve and Robin Kothari and Rolando D. Somma , title =. 2014 , doi =

    work page 2014

  77. [77]

    Forum of Mathematics, Sigma5, 8 (2017) https://doi.org/10.1017/fms.2017.2

    Dominic W. Berry and Andrew M. Childs and Richard Cleve and Robin Kothari and Rolando D. Somma , title =. Forum of Mathematics, Sigma , volume =. 2017 , pages =. doi:10.1017/fms.2017.2 , note =

    work page doi:10.1017/fms.2017.2 2017

  78. [78]

    and Childs, Andrew M

    Berry, Dominic W. and Childs, Andrew M. and Cleve, Richard and Kothari, Robin and Somma, Rolando D. , journal =. Simulating. 2015 , doi =

    work page 2015

  79. [79]

    Berry and Andrew M

    Dominic W. Berry and Andrew M. Childs and Robin Kothari , title =. 2015 , doi =

    work page 2015

  80. [80]

    and Childs, Andrew M

    Berry, Dominic W. and Childs, Andrew M. and Su, Yuan and Wang, Xin and Wiebe, Nathan , journal =. Time-dependent. 2020 , doi =

    work page 2020

Showing first 80 references.