Kevin J. Sung

TL;DR: Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.

TL;DR: The application of the Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems with the quantum approximate optimization algorithm (QAOA) is demonstrated and an approximation ratio is obtained that is independent of problem size and for the first time, that performance increases with circuit depth.

TL;DR: OpenFermion as mentioned in this paper is an open-source software library written largely in Python under an Apache 2.0 license, aimed at enabling the simulation of fermionic and bosonic models and quantum chemistry problems on quantum hardware.

TL;DR: In this paper, a quantum algorithm is designed to enable the study of strongly interacting fermionic systems on a digitized quantum computer, and the algorithm is shown to work well on a large number of Fermionic Systems.