Related Experiment Video
Updated: Jul 18, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Efficient solvability of Hamiltonians and limits on the power of some quantum computational models
Rolando Somma1, Howard Barnum, Gerardo Ortiz
1Los Alamos National Laboratory, Los Alamos, NM 87545, USA.
Abstract:
One way to specify a model of quantum computing is to give a set of control Hamiltonians acting on a quantum state space whose initial state and final measurement are specified in terms of the Hamiltonians. We formalize such models and show that they can be simulated classically in a time polynomial in the dimension of the Lie algebra generated by the Hamiltonians and logarithmic in the dimension of the state space. This leads to a definition of Lie-algebraic "generalized mean-field Hamiltonians." We show that they are efficiently (exactly) solvable. Our results generalize the known weakness of fermionic linear optics computation and give conditions on control needed to exploit the full power of quantum computing.
Related Concept Videos
Ampere-Maxwell's Law: Problem-Solving
To solve the problem, we can use the equations from the analysis of an RC circuit and Maxwell's version of Ampère's law.
For the first part of the problem,...
Limits of the First Law of Thermodynamics
The Quantum-Mechanical Model of an Atom
The Uncertainty Principle
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Ampere's Law: Problem-Solving
Specific steps need to be considered while calculating the symmetric magnetic field distribution using...
