Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Recent Progress in Many-Body Theories

LIMITS ON THE POWER OF SOME MODELS OF QUANTUM COMPUTATION

Gerardo Ortíz, Rolando D. Somma, Howard Barnum, Emanuel H. Knill

Published Sep 1, 2006• 0 citations
Publisher
DOI
10.1142/9789812772787_0018

Related papers

OVERVIEW OF QUANTUM COMPUTATION

H.E. Caicedo-Ortiz, Elizabeth Santiago-Cortes

Apple Academic Press eBooks•Oct 22, 2014•1 citation

QUANTUM COMPUTATION AND INFORMATION

A. Carlini

The Ninth Marcel Grossmann Meeting•Dec 1, 2002•92 citations

QUANTUM COMPUTATION: AN INTRODUCTION

Adriano Barenco

WORLD SCIENTIFIC eBooks•Oct 1, 1998•13 citations

LIMITS ON THE POWER OF SOME MODELS OF QUANTUM COMPUTATION

Gerardo Ortíz, Rolando D. Somma, Howard Barnum +1 more

We consider quantum computational models defined via a Lie-algebraic theory. In these models, specified initial states are acted on by Lie-algebraic quantum gates and the expectation values of Lie algebra elements are measured at the end. We show that these models can be efficiently simulated on a classical computer in time polynomial in the dimension of the algebra, regardless of the dimension of the Hilbert space where the algebra acts. Similar results hold for the computation of the expectation value of operators implemented by a gate-sequence. We introduce a Lie-algebraic notion of generalized mean-field Hamiltonians and show that they are efficiently (exactly) solvable by means of a Jacobi-like diagonalization method. Our results generalize earlier ones on fermionic linear optics computation and provide insight into the source of the power of the conventional model of quantum computation.

International Journal of Modern Physics B•Dec 15, 2006•0 citations

The Limits of Quantum Computers

Scott Aaronson

Lecture notes in computer science•Aug 21, 2007•51 citations

The Limits of Quantum Computers

Scott Aaronson

Scientific American•Mar 1, 2008•146 citations
We consider quantum computational models defined via a Lie-algebraic theory. In these models, specified initial states are acted on by Lie-algebraic quantum gates and the expectation values of Lie algebra elements are measured at the end. We show that these models can be efficiently simulated on a classical computer in time polynomial in the dimension of the algebra, regardless of the dimension of the Hilbert space where the algebra acts. Similar results hold for the computation of the expectation value of operators implemented by a gate-sequence. We introduce a Lie-algebraic notion of generalized mean-field Hamiltonians and show that they are efficiently (exactly) solvable by means of a Jacobi-like diagonalization method. Our results generalize earlier ones on fermionic linear optics computation and provide insight into the source of the power of the conventional model of quantum computation.