On sampling determinantal and Pfaffian point processes on a quantum computer

05/25/2023
by   Rémi Bardenet, et al.
0

DPPs were introduced by Macchi as a model in quantum optics the 1970s. Since then, they have been widely used as models and subsampling tools in statistics and computer science. Most applications require sampling from a DPP, and given their quantum origin, it is natural to wonder whether sampling a DPP on a quantum computer is easier than on a classical one. We focus here on DPPs over a finite state space, which are distributions over the subsets of {1,…,N} parametrized by an N× N Hermitian kernel matrix. Vanilla sampling consists in two steps, of respective costs 𝒪(N^3) and 𝒪(Nr^2) operations on a classical computer, where r is the rank of the kernel matrix. A large first part of the current paper consists in explaining why the state-of-the-art in quantum simulation of fermionic systems already yields quantum DPP sampling algorithms. We then modify existing quantum circuits, and discuss their insertion in a full DPP sampling pipeline that starts from practical kernel specifications. The bottom line is that, with P (classical) parallel processors, we can divide the preprocessing cost by P and build a quantum circuit with 𝒪(Nr) gates that sample a given DPP, with depth varying from 𝒪(N) to 𝒪(rlog N) depending on qubit-communication constraints on the target machine. We also connect existing work on the simulation of superconductors to Pfaffian point processes, which generalize DPPs and would be a natural addition to the machine learner's toolbox. Finally, the circuits are empirically validated on a classical simulator and on 5-qubit machines.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/29/2023

MNISQ: A Large-Scale Quantum Circuit Dataset for Machine Learning on/for Quantum Computers in the NISQ era

We introduce the first large-scale dataset, MNISQ, for both the Quantum ...
research
04/03/2023

Abstraqt: Analysis of Quantum Circuits via Abstract Stabilizer Simulation

Stabilizer simulation can efficiently simulate an important class of qua...
research
08/29/2023

Probing Quantum Telecloning on Superconducting Quantum Processors

Quantum information can not be perfectly cloned, but approximate copies ...
research
07/27/2018

Quantum Supremacy Is Both Closer and Farther than It Appears

As quantum computers improve in the number of qubits and fidelity, the q...
research
08/01/2016

On the Complexity of Constrained Determinantal Point Processes

Determinantal Point Processes (DPPs) are probabilistic models that arise...
research
02/08/2018

The Multiphoton Boson Sampling Machine Doesn't Beat Early Classical Computers for Five-boson Sampling

An ignored algorithm called Store-reuse for calculating the permanent of...

Please sign up or login with your details

Forgot password? Click here to reset