#### Filter Results:

- Full text PDF available (58)

#### Publication Year

1970

2017

- This year (9)
- Last 5 years (39)
- Last 10 years (60)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

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 Computer Science, University of Bristol, Bristol BS8 1UB, U.K. Department of Mathematics, University of York, York YO10 5DD, U.K. Department of Mathematics,… (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 optimal quantum algorithms for these functions cannot be obtained by simply computing parities of pairs of bits. We also characterise the model of nonadaptive… (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 protocols, we completely characterise one-way communication complexity for all f . We also show that, when f is monotone, g’s quantum and classical… (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. One way of making the problem more physically meaningful is to restrict the Hamiltonian in question by picking its terms from a fixed set S. Examples of such… (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 that, if either of two plausible average-case hardness conjectures holds, then IQP computations are hard to simulate classically up to constant additive error.… (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, and a bound based on the eigenvalues of their Gram matrix. We use the latter to lower bound the asymptotic distinguishability of ensembles of n random quantum… (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 is 1 − ǫ, the test passes with probability 1 − Θ(ǫ), regardless of n or the local dimensions of the individual systems. The test uses two copies of |ψ〉. We… (More)

- 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 is to make the colours of all tiles equal via the shortest possible sequence of flooding operations. In the standard version, a flooding operation consists of… (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 2-local interaction, with differing weights, is applied across each pair of qubits. First we consider antiferromagnetic/ferromagnetic interactions, where the… (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 query string, the goal is to output x. We give an optimal O( √ n) quantum query algorithm for search with wildcards. Rather than using amplitude amplification… (More)