Matchgates are a well studied class of quantum circuits tied to the time dynamics of Free Fermion Hamiltonians. It is important to note however that Matchgates specifically come from representing Free Fermions with the Jordan-Wigner encoding. When we represent our fermionic systems with other encodings besides Jordan-Wigner, we still are considering the time dynamics of Free Fermion solvable Hamiltonians, but we can introduce complexity in how we encode our fermionic information. This gives us a test ground for clarifying what physical properties make time dynamics hard to simulate, even when Hamiltonians can be exactly diagonalized. In this talk I will discuss the theory behind matchgates, fermionic encodings, and recent results in the simulability of Clifford/matchgate hybrid circuits (arxiv:2312.08447, arxiv:2410.10068). These results clarify resources for Free Fermions represented beyond the Jordan-Wigner encoding, as well as an overall perspective of what it means for a state to be Gaussian.
Continuous variable (CV) systems play an important role in quantum foundations and quantum information processing, especially because of their quantum optical realization. Gaussian states of CV systems, on the one hand have non-trivial quantum properties, and on the other hand, can be realized in the laboratory. There are non-Gaussian states which can be obtained from Gaussian states via physically realizable operations and these too can be useful in enhancing non-classicality and improving the performance of quantum information processing protocols. In the talk, I will introduce CV systems and their Gaussian and non-Gaussian states. The violation of Bell-type inequalities using CV systems will be discussed. Quantum key distribution protocols and quantum teleportation schemes using Gaussian and non-Gaussian states will also be taken up.
We present a tensor-network-based classical algorithm (equipped with guarantees) for simulating $n$-qubit quantum circuits with arbitrary single-qubit noise. Our algorithm represents the state of a noisy quantum system by a particular ensemble of matrix product states from which we stochastically sample a pure quantum state. Each single qubit noise process acting on a pure state is then represented by the ensemble of states that achieve the minimal average entanglement (the entanglement of formation) between the noisy qubit and the rest of the system. This approach provides a connection between the entanglement of formation and the accuracy of the simulation algorithm. For a given maximum bond dimension $\chi$ and circuit, our algorithm comes with an upper bound on the simulation error (in total variation distance), runs in $poly(n,\chi)$-time and improves upon related prior work (1) in scope: by extending from the three commonly considered noise models to general single qubit noise (2) in performance: by employing a state-dependent locally-entanglement-optimal unraveling and (3) in conceptual contribution: by showing that the fixed unraveling used in prior work becomes equivalent to our choice of unraveling in the special case of depolarizing and dephasing noise acting on a maximally entangled state. This is joint work with Simon Cichy, Paul K. Faehrmann, Lennart Bittel and Jens Eisert.