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

De Gruyter eBooks

On the Bosonization of the Many Electron Problem

A. Cabo

Published Dec 31, 1986• 0 citations
Publisher
DOI
10.1515/9783112613825-002

Related papers

Bosonization and the many-body problem

A. H. Castro Neto, Antonio Helio

•Jan 1, 1994•0 citations

On the Bosonization of the Many Electron Problem

A. Cabo

Abstract The Garbaczewski bosonization procedure is applied to the many‐electron problem. It leads to a non‐local c‐number path integral representation for the trace of the evolution operator which also depends on a mapping of the lattice points in the natural numbers. This mapping is needed for the implementation of the bosonization. We argue that the non‐local interactions and the dependence on the mapping can be disregarded in the limit of small electron c‐number field. We can then discuss the physics of the saddle point contribution. In the discussion the effects of the Pauli exclusion principle are introduced phenomenologically.

Fortschritte der Physik/Progress of Physics•Jan 1, 1986•1 citation

On Some Open Problems in Many-Electron Theory

Volker Bach, Luigi Delle Site

arXiv:1406.4475•Mathematical physics studies•Jan 1, 2014•3 citations

Interacting boson problems can be QMA-hard

Tzu-Chieh Wei, Michele Mosca, Ashwin Nayak

Computing the ground-state energy of interacting electron problems has recently been shown to be hard for quantum Merlin Arthur (QMA), a quantum analogue of the complexity class NP. Fermionic problems are usually hard, a phenomenon widely attributed to the so-called sign problem. The corresponding bosonic problems are, according to conventional wisdom, tractable. Here, we demonstrate that the complexity of interacting boson problems is also QMA hard. Moreover, the bosonic version of N-representability problem is QMA complete. Consequently, these problems are unlikely to have efficient quantum algorithms.

Bulletin of the American Physical Society•Mar 15, 2010•0 citations

Interacting Boson Problems Can Be QMA Hard

Tzu-Chieh Wei, Michele Mosca, Ashwin Nayak

Computing the ground-state energy of interacting electron problems has recently been shown to be hard for quantum Merlin Arthur (QMA), a quantum analogue of the complexity class NP. Fermionic problems are usually hard, a phenomenon widely attributed to the so-called sign problem. The corresponding bosonic problems are, according to conventional wisdom, tractable. Here, we demonstrate that the complexity of interacting boson problems is also QMA hard. Moreover, the bosonic version of N-representability problem is QMA complete. Consequently, these problems are unlikely to have efficient quantum algorithms.

arXiv:0905.3413•Physical Review Letters•Jan 27, 2010•58 citations

Problems in the Quantum Theory of Many-Particle Boson Systems.

Deok Kyo Lee

•Jan 1, 1967•0 citations
Abstract The Garbaczewski bosonization procedure is applied to the many‐electron problem. It leads to a non‐local c‐number path integral representation for the trace of the evolution operator which also depends on a mapping of the lattice points in the natural numbers. This mapping is needed for the implementation of the bosonization. We argue that the non‐local interactions and the dependence on the mapping can be disregarded in the limit of small electron c‐number field. We can then discuss the physics of the saddle point contribution. In the discussion the effects of the Pauli exclusion principle are introduced phenomenologically.
Computing the ground-state energy of interacting electron problems has recently been shown to be hard for quantum Merlin Arthur (QMA), a quantum analogue of the complexity class NP. Fermionic problems are usually hard, a phenomenon widely attributed to the so-called sign problem. The corresponding bosonic problems are, according to conventional wisdom, tractable. Here, we demonstrate that the complexity of interacting boson problems is also QMA hard. Moreover, the bosonic version of N-representability problem is QMA complete. Consequently, these problems are unlikely to have efficient quantum algorithms.
Computing the ground-state energy of interacting electron problems has recently been shown to be hard for quantum Merlin Arthur (QMA), a quantum analogue of the complexity class NP. Fermionic problems are usually hard, a phenomenon widely attributed to the so-called sign problem. The corresponding bosonic problems are, according to conventional wisdom, tractable. Here, we demonstrate that the complexity of interacting boson problems is also QMA hard. Moreover, the bosonic version of N-representability problem is QMA complete. Consequently, these problems are unlikely to have efficient quantum algorithms.