activity
20062014
most citedMeasurement-based quantum computation

1.1k citations · 1.6k across the 23 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…

quant-ph2013★ 2 cited

Ising models and topological codes: classical algorithms and quantum simulation

M. Van den Nest, W. Dür

We present an algorithm to approximate partition functions of 3-body classical Ising models on two-dimensional lattices of arbitrary genus, in the real-temperature regime. Even tho…

cond-mat.str-el2013★ 27 cited

Geometric Entanglement in Topologically Ordered States

Roman Orus, Tzu-Chieh Wei, Oliver Buerschaper +1

Here we investigate the connection between topological order and the geometric entanglement, as measured by the logarithm of the overlap between a given state and its closest produ…

quant-ph2012★ 2 cited

Classical simulations of Abelian-group normalizer circuits with intermediate measurements

Juan Bermejo-Vega, Maarten Van den Nest

Quantum normalizer circuits were recently introduced as generalizations of Clifford circuits [arXiv:1201.4867]: a normalizer circuit over a finite Abelian group is composed of…

quant-ph2012★ 11 cited

Commuting quantum circuits: efficient classical simulations versus hardness results

Xiaotong Ni, Maarten Van den Nest

The study of quantum circuits composed of commuting gates is particularly useful to understand the delicate boundary between quantum and classical computation. Indeed, while being…

quant-ph2012★ 120 cited

Universal quantum computation with little entanglement

Maarten Van den Nest

We show that universal quantum computation can be achieved in the standard pure-state circuit model while, at any time, the entanglement entropy of all bipartitions is small---even…

quant-ph2012

Efficient classical simulations of quantum Fourier transforms and normalizer circuits over Abelian groups

M. Van den Nest

The quantum Fourier transform (QFT) is sometimes said to be the source of various exponential quantum speed-ups. In this paper we introduce a class of quantum circuits which cannot…

quant-ph2011★ 23 cited

A monomial matrix formalism to describe quantum many-body states

Maarten Van den Nest

We propose a framework to describe and simulate a class of many-body quantum states. We do so by considering joint eigenspaces of sets of monomial unitary matrices, called here "M-…

quant-ph2011★ 6 cited

Quantum simulation of classical thermal states

W. Dür, M. Van den Nest

We establish a connection between ground states of local quantum Hamiltonians and thermal states of classical spin systems. For any discrete classical statistical mechanical model…

quant-ph2011★ 32 cited

Quantum algorithms for classical lattice models

G. De las Cuevas, W. Dür, M. Van den Nest +1

We give efficient quantum algorithms to estimate the partition function of (i) the six vertex model on a two-dimensional (2D) square lattice, (ii) the Ising model with magnetic fie…

quant-ph2010★ 14 cited

Quantum matchgate computations and linear threshold gates

M. Van den Nest

The theory of matchgates is of interest in various areas in physics and computer science. Matchgates occur in e.g. the study of fermions and spin chains, in the theory of holograph…

quant-ph2009★ 3 cited

Simulating quantum computers with probabilistic methods

M. Van den Nest

We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are center…

quant-ph2009★ 1.1k cited

Measurement-based quantum computation

H. J. Briegel, D. E. Browne, W. Dür +2

Quantum computation offers a promising new kind of information processing, where the non-classical features of quantum mechanics can be harnessed and exploited. A number of models…

quant-ph2009★ 25 cited

Universal resources for approximate and stochastic measurement-based quantum computation

C. E. Mora, M. Piani, A. Miyake +3

We investigate which quantum states can serve as universal resources for approximate and stochastic measurement-based quantum computation, in the sense that any quantum state can b…

quant-ph2008★ 20 cited

Completeness of classical spin models and universal quantum computation

Gemma De las Cuevas, Wolfgang Dür, Maarten Van den Nest +1

We study mappings between distinct classical spin systems that leave the partition function invariant. As recently shown in [Phys. Rev. Lett. 100, 110501 (2008)], the partition fun…

quant-ph2008★ 30 cited

Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond

M. Van den Nest

We study classical simulation of quantum computation, taking the Gottesman-Knill theorem as a starting point. We show how each Clifford circuit can be reduced to an equivalent, man…

quant-ph2008★ 38 cited

Quantum algorithms for spin models and simulable gate sets for quantum computation

M. Van den Nest, W. Dür, R. Raussendorf +1

We present elementary mappings between classical lattice models and quantum circuits. These mappings provide a general framework to obtain efficiently simulable quantum gate sets f…

quant-ph2006★ 58 cited

Classical spin models and the quantum stabilizer formalism

M. Van den Nest, W. Dür, H. J. Briegel

We relate a large class of classical spin models, including the inhomogeneous Ising, Potts, and clock models of q-state spins on arbitrary graphs, to problems in quantum physics. M…