pith. machine review for the scientific record. sign in

arxiv: cond-mat/0012334 · v1 · submitted 2000-12-18 · ❄️ cond-mat · hep-th· quant-ph

Recognition: unknown

Quantum Algorithms for Fermionic Simulations

Authors on Pith no claims yet
classification ❄️ cond-mat hep-thquant-ph
keywords quantumproblemcomplexitycomputerfermionicsimulationssystemsalgebraic
0
0 comments X
read the original abstract

We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to be of exponential complexity into one of polynomial complexity. The key to our demonstration is the spin-particle connection (or generalized Jordan-Wigner transformation) that allows exact algebraic invertible mappings of operators with different statistical properties. We give an explicit implementation of a simple problem using a quantum computer based on standard qubits.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum Simulation of the Real-time Dynamics in the multi-flavor Gross-Neveu Model at the utility scale using Superconducting Quantum Computers

    quant-ph 2026-05 unverdicted novelty 6.0

    A scalable Trotterization and Localized Diagonal Operator Approximation enable real-time quantum simulation of the multi-flavor Gross-Neveu model on utility-scale superconducting hardware.