activity
20062014
most citedUniversal quantum computation with little entanglement

120 citations · 206 across the 9 of their papers we have counts for

collaborators

23 papers

quant-ph2014★ 8 cited

The computational power of normalizer circuits over black-box groups

Juan Bermejo-Vega, Cedric Yen-Yu Lin, Maarten Van den Nest

This work presents a precise connection between Clifford circuits, Shor's factoring algorithm and several other famous quantum algorithms with exponential quantum speed-ups for sol…

quant-ph2014★ 4 cited

Normalizer circuits and a Gottesman-Knill theorem for infinite-dimensional systems

Juan Bermejo-Vega, Cedric Yen-Yu Lin, Maarten Van den Nest

[1,2] are generalized Clifford circuits that act on arbitrary finite-dimensional systems wit…

quant-ph2014★ 31 cited

A Non-Commuting Stabilizer Formalism

Xiaotong Ni, Oliver Buerschaper, Maarten Van den Nest

We propose a non-commutative extension of the Pauli stabilizer formalism. The aim is to describe a class of many-body quantum states which is richer than the standard Pauli stabili…

quant-ph2013★ 13 cited

Simulating Quantum Circuits with Sparse Output Distributions

Martin Schwarz, Maarten Van den Nest

We show that several quantum circuit families can be simulated efficiently classically if it is promised that their output distribution is approximately sparse i.e. the distributio…

quant-ph2013★ 15 cited

Certifiability criterion for large-scale quantum systems

Florian Fröwis, Maarten van den Nest, Wolfgang Dür

Can one certify the preparation of a coherent, many-body quantum state by measurements with bounded accuracy in the presence of noise and decoherence? Here, we introduce a criterio…

quant-ph2013★ 2 cited

Classical simulation complexity of extended Clifford circuits

Richard Jozsa, Maarten Van den Nest

Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations…