pith. sign in

arxiv: 1112.2184 · v1 · pith:Z45HFVR6new · submitted 2011-12-09 · 🪐 quant-ph

Classical simulation of dissipative fermionic linear optics

classification 🪐 quant-ph
keywords fermionicclassicallineartimecomputationdissipativeefficientlyequation
0
0 comments X
read the original abstract

Fermionic linear optics is a limited form of quantum computation which is known to be efficiently simulable on a classical computer. We revisit and extend this result by enlarging the set of available computational gates: in addition to unitaries and measurements, we allow dissipative evolution governed by a Markovian master equation with linear Lindblad operators. We show that this more general form of fermionic computation is also simulable efficiently by classical means. Given a system of $N$ fermionic modes, our algorithm simulates any such gate in time $O(N^3)$ while a single-mode measurement is simulated in time $O(N^2)$. The steady state of the Lindblad equation can be computed in time $O(N^3)$.

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. Probabilistic quantum algorithm for Lyapunov equations and matrix inversion

    quant-ph 2025-08 unverdicted novelty 7.0

    Probabilistic quantum algorithm prepares mixed states proportional to Lyapunov equation solutions and matrix inverses using oracles for input matrices and a deterministic stopping rule.