#### Filter Results:

- Full text PDF available (55)

#### Publication Year

1970

2018

- This year (13)
- Last 5 years (36)
- Last 10 years (55)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Peter J. Cameron, Ashley Montanaro, Michael W. Newman, Simone Severini, Andreas J. Winter
- Electr. J. Comb.
- 2007

Peter J. Cameron, Michael W. Newman, ∗ Ashley Montanaro, Simone Severini, † and Andreas Winter School of Mathematical Sciences, Queen Mary, University of London, London E1 4NS, U.K. Department of… (More)

- Ashley Montanaro, Tobias Osborne
- ArXiv
- 2009

An XOR function is a function of the form g(x, y) = f(x ⊕ y), for some boolean function f on n bits. We study the quantum and classical communication complexity of XOR functions. In the case of exact… (More)

- Ashley Montanaro, Richard Jozsa, Graeme Mitchison
- Algorithmica
- 2013

We present several families of total boolean functions which have exact quantum query complexity which is a constant multiple (between 1/2 and 2/3) of their classical query complexity, and show that… (More)

- Toby S. Cubitt, Ashley Montanaro
- 2014 IEEE 55th Annual Symposium on Foundations of…
- 2014

The calculation of ground-state energies of physical systems can be formalised as the k-local Hamiltonian problem, which is the natural quantum analogue of classical constraint satisfaction problems.… (More)

- Ashley Montanaro
- 1970

We develop two analytic lower bounds on the probability of success p of identifying a state picked from a known ensemble of pure states: a bound based on the pairwise inner products of the states,… (More)

- Michael J. Bremner, Ashley Montanaro, Dan J. Shepherd
- Physical review letters
- 2016

We use the class of commuting quantum computations known as IQP (instantaneous quantum polynomial time) to strengthen the conjecture that quantum computers are hard to simulate classically. We show… (More)

We give a test that can distinguish efficiently between product states of n quantum systems and states which are far from product. If applied to a state |ψ〉 whose maximum overlap with a product state… (More)

- Stephen Piddock, Ashley Montanaro
- Quantum Information & Computation
- 2017

Estimation of the minimum eigenvalue of a quantum Hamiltonian can be formalised as the Local Hamiltonian problem. We study the natural special case of the Local Hamiltonian problem where the same… (More)

- Andris Ambainis, Ashley Montanaro
- Quantum Information & Computation
- 2014

We consider two combinatorial problems. The first we call “search with wildcards”: given an unknown n-bit string x, and the ability to check whether any subset of the bits of x is equal to a provided… (More)

- David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach
- Theory of Computing Systems
- 2010

We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of c colours. The goal… (More)