Diego García-Martín
@dgarciamartin.bsky.social
Postdoc at Los Alamos National Laboratory, working on quantum algorithms and quantum computation | Editor at @quantum-journal.bsky.social
We also find random Clifford FLO circuits (which are a FLO 3-design), with a provably-optimal number of gates
June 3, 2025 at 6:01 PM
We also find random Clifford FLO circuits (which are a FLO 3-design), with a provably-optimal number of gates
I.e. we provide appropriate distributions for the gates of n-qubit parametrized circuits with an optimal down-to-the-constant factor depth, gate count, and classical computation overhead
In contrast, previous approaches incur unnecessary O(n^3) classical compilation costs, or have suboptimal depths
In contrast, previous approaches incur unnecessary O(n^3) classical compilation costs, or have suboptimal depths
June 3, 2025 at 6:01 PM
I.e. we provide appropriate distributions for the gates of n-qubit parametrized circuits with an optimal down-to-the-constant factor depth, gate count, and classical computation overhead
In contrast, previous approaches incur unnecessary O(n^3) classical compilation costs, or have suboptimal depths
In contrast, previous approaches incur unnecessary O(n^3) classical compilation costs, or have suboptimal depths
In our paper, we provide quantum circuits to *optimally* sample both active and passive Haar random FLO directly on quantum hardware.
(The angles are sampled according to sine powers, indicated by the circled numbers in the picture)
(The angles are sampled according to sine powers, indicated by the circled numbers in the picture)
June 3, 2025 at 6:01 PM
In our paper, we provide quantum circuits to *optimally* sample both active and passive Haar random FLO directly on quantum hardware.
(The angles are sampled according to sine powers, indicated by the circled numbers in the picture)
(The angles are sampled according to sine powers, indicated by the circled numbers in the picture)