default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAshley Montanaro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Ashley Montanaro
, Changpeng Shao:
Quantum Communication Complexity of Linear Regression. ACM Trans. Comput. Theory 16(1): 1:1-1:30 (2024)- [c15]Ashley Montanaro, Changpeng Shao:
Quantum and Classical Query Complexities of Functions of Matrices. STOC 2024: 573-584 - [i31]Ashley Montanaro, Changpeng Shao, Dominic Verdon:
Low-degree approximation of QAC0 circuits. CoRR abs/2411.00976 (2024) - [i30]Ashley Montanaro, Leo Zhou:
Quantum speedups in solving near-symmetric optimization problems by low-depth QAOA. CoRR abs/2411.04979 (2024) - [i29]Benjamin D. M. Jones, Lana Mineh, Ashley Montanaro:
Benchmarking a wide range of optimisers for solving the Fermi-Hubbard model using the variational quantum eigensolver. CoRR abs/2411.13742 (2024) - [i28]Sheila M. Perez-Garcia, Ashley Montanaro:
Quantum-enhanced belief propagation for LDPC decoding. CoRR abs/2412.08596 (2024) - 2023
- [c14]Harry Buhrman, Noah Linden, Laura Mancinska, Ashley Montanaro, Maris Ozols:
Quantum Majority Vote. ITCS 2023: 29:1-29:1 - [i27]Ashley Montanaro, Changpeng Shao:
Quantum and classical query complexities of functions of matrices. CoRR abs/2311.06999 (2023) - 2022
- [c13]Ashley Montanaro, Changpeng Shao:
Quantum Algorithms for Learning a Hidden Graph. TQC 2022: 1:1-1:22 - [i26]Ashley Montanaro, Changpeng Shao:
Quantum communication complexity of linear regression. CoRR abs/2210.01601 (2022) - 2021
- [j25]João F. Doriguello, Ashley Montanaro:
Quantum Random Access Codes for Boolean Functions. Quantum 5: 402 (2021) - [j24]Dong An, Noah Linden, Jin-Peng Liu, Ashley Montanaro, Changpeng Shao, Jiasu Wang:
Quantum-accelerated multilevel Monte Carlo methods for stochastic differential equations in mathematical finance. Quantum 5: 481 (2021) - [i25]Changpeng Shao, Ashley Montanaro:
Faster quantum-inspired algorithms for solving linear systems. CoRR abs/2103.10309 (2021) - [i24]Sami Boulebnane, Ashley Montanaro:
Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit. CoRR abs/2110.10685 (2021) - 2020
- [c12]João F. Doriguello, Ashley Montanaro:
Exponential Quantum Communication Reductions from Generalizations of the Boolean Hidden Matching Problem. TQC 2020: 1:1-1:16 - [i23]João F. Doriguello, Ashley Montanaro:
Exponential quantum communication reductions from generalizations of the Boolean Hidden Matching problem. CoRR abs/2001.05553 (2020) - [i22]Cezar-Mihail Alexandru, Ella Bridgett-Tomkinson, Noah Linden, Joseph MacManus, Ashley Montanaro, Hannah Morris:
Quantum speedups of some general-purpose numerical optimisation algorithms. CoRR abs/2004.06521 (2020) - [i21]João F. Doriguello, Ashley Montanaro:
Quantum Random Access Codes for Boolean Functions. CoRR abs/2011.06535 (2020) - [i20]Ashley Montanaro, Changpeng Shao:
Quantum algorithms for learning graphs and beyond. CoRR abs/2011.08611 (2020) - [i19]Dong An, Noah Linden, Jin-Peng Liu, Ashley Montanaro, Changpeng Shao, Jiasu Wang:
Quantum-accelerated multilevel Monte Carlo methods for stochastic differential equations in mathematical finance. CoRR abs/2012.06283 (2020)
2010 – 2019
- 2019
- [i18]Ashley Montanaro:
Quantum speedup of branch-and-bound algorithms. CoRR abs/1906.10375 (2019) - 2018
- [j23]Chris Cade, Ashley Montanaro, Aleksandrs Belovs:
Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness. Quantum Inf. Comput. 18(1&2): 18-50 (2018) - [j22]Ashley Montanaro:
Quantum-Walk Speedup of Backtracking Algorithms. Theory Comput. 14(1): 1-24 (2018) - [c11]Chris Cade, Ashley Montanaro:
The Quantum Complexity of Computing Schatten p-norms. TQC 2018: 4:1-4:20 - 2017
- [j21]Ashley Montanaro:
Quantum Pattern Matching Fast on Average. Algorithmica 77(1): 16-39 (2017) - [j20]Aram W. Harrow, Ashley Montanaro:
Quantum computational supremacy. Nat. 549(7671): 203-209 (2017) - [j19]Stephen Piddock, Ashley Montanaro:
The complexity of antiferromagnetic interactions and 2D lattices. Quantum Inf. Comput. 17(7&8): 636-672 (2017) - [c10]Daniel P. Martin, Ashley Montanaro, Elisabeth Oswald, Daniel James Shepherd:
Quantum Key Search with Side Channel Advice. SAC 2017: 407-422 - [c9]Aram W. Harrow, Cedric Yen-Yu Lin, Ashley Montanaro:
Sequential measurements, disturbance and property testing. SODA 2017: 1598-1611 - [i17]Chris Cade, Ashley Montanaro:
The Quantum Complexity of Computing Schatten $p$-norms. CoRR abs/1706.09279 (2017) - [i16]Daniel P. Martin, Ashley Montanaro, Elisabeth Oswald, Dan J. Shepherd:
Quantum Key Search with Side Channel Advice. IACR Cryptol. ePrint Arch. 2017: 171 (2017) - 2016
- [j18]Ashley Montanaro:
The quantum complexity of approximating the frequency moments. Quantum Inf. Comput. 16(13&14): 1169-1190 (2016) - [j17]Toby S. Cubitt, Ashley Montanaro:
Complexity Classification of Local Hamiltonian Problems. SIAM J. Comput. 45(2): 268-316 (2016) - [j16]Ashley Montanaro, Ronald de Wolf:
A Survey of Quantum Property Testing. Theory Comput. 7: 1-81 (2016) - [r1]Ashley Montanaro:
Exact Quantum Algorithms. Encyclopedia of Algorithms 2016: 695-698 - [i15]Chris Cade, Ashley Montanaro, Aleksandrs Belovs:
Time and Space Efficient Quantum Algorithms for Detecting Cycles and Testing Bipartiteness. CoRR abs/1610.00581 (2016) - [i14]Dominic J. Moylett, Noah Linden, Ashley Montanaro:
Quantum speedup of the Travelling Salesman Problem for bounded-degree graphs. CoRR abs/1612.06203 (2016) - [i13]Ashley Montanaro:
Quantum states cannot be transmitted efficiently classically. CoRR abs/1612.06546 (2016) - 2015
- [j15]Ashley Montanaro, Richard Jozsa, Graeme Mitchison:
On Exact Quantum Query Complexity. Algorithmica 71(4): 775-796 (2015) - [i12]Michael J. Bremner, Ashley Montanaro, Dan J. Shepherd:
Average-case complexity versus approximate simulation of commuting quantum computations. CoRR abs/1504.07999 (2015) - [i11]Ashley Montanaro:
The quantum complexity of approximating the frequency moments. CoRR abs/1505.00113 (2015) - [i10]Stephen Piddock, Ashley Montanaro:
The complexity of antiferromagnetic interactions and 2D lattices. CoRR abs/1506.04014 (2015) - [i9]Aram W. Harrow, Ashley Montanaro:
Extremal eigenvalues of local Hamiltonians. CoRR abs/1507.00739 (2015) - [i8]Ashley Montanaro:
Quantum walk speedup of backtracking algorithms. CoRR abs/1509.02374 (2015) - 2014
- [j14]Ashley Montanaro:
A composition theorem for decision tree complexity. Chic. J. Theor. Comput. Sci. 2014 (2014) - [j13]Andris Ambainis, Ashley Montanaro:
Quantum algorithms for search with wildcards and combinatorial group testing. Quantum Inf. Comput. 14(5-6): 439-453 (2014) - [c8]Toby S. Cubitt, Ashley Montanaro:
Complexity Classification of Local Hamiltonian Problems. FOCS 2014: 120-129 - [i7]Ashley Montanaro:
Quantum pattern matching fast on average. CoRR abs/1408.1816 (2014) - 2013
- [j12]Aram W. Harrow, Ashley Montanaro:
Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization. J. ACM 60(1): 3:1-3:43 (2013) - [i6]Ashley Montanaro:
A composition theorem for decision tree complexity. CoRR abs/1302.4207 (2013) - 2012
- [j11]Ashley Montanaro:
Almost all decision trees do not allow significant quantum speed-up. Chic. J. Theor. Comput. Sci. 2012 (2012) - [j10]Ashley Montanaro:
The quantum query complexity of learning multilinear polynomials. Inf. Process. Lett. 112(11): 438-442 (2012) - [j9]Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach:
The Complexity of Flood Filling Games. Theory Comput. Syst. 50(1): 72-92 (2012) - 2011
- [j8]Ashley Montanaro:
A new exponential separation between quantum and classical one-way communication complexity. Quantum Inf. Comput. 11(7&8): 574-591 (2011) - [j7]Ashley Montanaro, Harumichi Nishimura, Rudy Raymond:
Unbounded-error quantum query complexity. Theor. Comput. Sci. 412(35): 4619-4628 (2011) - [c7]Aram W. Harrow, Ashley Montanaro, Anthony J. Short:
Limitations on Quantum Dimensionality Reduction. ICALP (1) 2011: 86-97 - [i5]Ashley Montanaro:
Unentangled Quantum Proofs and their Applications. ERCIM News 2011(85): 15 (2011) - 2010
- [j6]Ashley Montanaro, Tobias Osborne:
Quantum boolean functions. Chic. J. Theor. Comput. Sci. 2010 (2010) - [j5]Ashley Montanaro:
Nonadaptive quantum query complexity. Inf. Process. Lett. 110(24): 1110-1113 (2010) - [c6]Aram W. Harrow, Ashley Montanaro:
An Efficient Test for Product States with Applications to Quantum Merlin-Arthur Games. FOCS 2010: 633-642 - [c5]David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach:
The Complexity of Flood Filling Games. FUN 2010: 307-318 - [c4]Ashley Montanaro:
Quantum Search with Advice. TQC 2010: 77-93 - [i4]Ashley Montanaro:
Nonadaptive quantum query complexity. CoRR abs/1001.0018 (2010) - [i3]David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach:
The Complexity of Flood Filling Games. CoRR abs/1001.4420 (2010) - [i2]Ashley Montanaro:
A new exponential separation between quantum and classical one-way communication complexity. CoRR abs/1007.3587 (2010)
2000 – 2009
- 2009
- [j4]Ashley Montanaro:
Quantum algorithms for shifted subset problems. Quantum Inf. Comput. 9(5&6): 500-512 (2009) - [j3]Ashley Montanaro:
Quantum search of partially ordered sets. Quantum Inf. Comput. 9(7&8): 628-647 (2009) - [i1]Ashley Montanaro, Tobias Osborne:
On the communication complexity of XOR functions. CoRR abs/0909.3392 (2009) - 2008
- [c3]Ashley Montanaro, Harumichi Nishimura, Rudy Raymond:
Unbounded-Error Quantum Query Complexity. ISAAC 2008: 919-930 - [c2]Ashley Montanaro:
A lower bound on the probability of error in quantum state discrimination. ITW 2008: 378-380 - 2007
- [b1]Ashley Montanaro:
Structure, randomness and complexity in quantum computation. University of Bristol, UK, 2007 - [j2]Peter J. Cameron, Ashley Montanaro, Michael W. Newman, Simone Severini, Andreas J. Winter:
On the Quantum Chromatic Number of a Graph. Electron. J. Comb. 14(1) (2007) - [j1]Ashley Montanaro:
Quantum walks on directed graphs. Quantum Inf. Comput. 7(1): 93-102 (2007) - [c1]Ashley Montanaro, Andreas J. Winter:
A Lower Bound on Entanglement-Assisted Quantum Communication Complexity. ICALP 2007: 122-133
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-27 21:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
