Abdullah Younis

EECS Department, University of California, Berkeley

Technical Report No. UCB/EECS-2020-53

May 21, 2020

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2020/EECS-2020-53.pdf

We present QFAST, a quantum synthesis tool designed to produce short circuits and to scale well in practice. Our contributions are: 1) a novel representation of circuits able to encode placement and topology; 2) a hierarchical approach with an iterative refinement formulation that combines "coarse-grained" fast optimization during circuit structure search with a good, but slower, optimization stage only in the final circuit instantiation stage. When compared against state-of-the-art techniques, although not optimal, QFAST can generate much shorter circuits for "time dependent evolution" algorithms used by domain scientists. We also show the composability and tunability of our formulation in terms of circuit depth and running time. For example, we show how to generate shorter circuits by plugging in the best available third party synthesis algorithm at a given hierarchy level. Composability enables portability across chip architectures, which is missing from the available approaches.

Advisors: Katherine A. Yelick

---

BibTeX citation:

@mastersthesis{Younis:EECS-2020-53,
    Author= {Younis, Abdullah},
    Title= {QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space},
    School= {EECS Department, University of California, Berkeley},
    Year= {2020},
    Month= {May},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2020/EECS-2020-53.html},
    Number= {UCB/EECS-2020-53},
    Abstract= {We present QFAST, a quantum synthesis tool designed to produce short circuits and to scale well in practice. Our contributions are: 1) a novel representation of circuits able to encode placement and topology; 2) a hierarchical approach with an iterative refinement formulation that combines "coarse-grained" fast optimization during circuit structure search with a good, but slower, optimization stage only in the final circuit instantiation stage. When compared against state-of-the-art techniques, although not optimal, QFAST can generate much shorter circuits for "time dependent evolution" algorithms used by domain scientists. We also show the composability and tunability of our formulation in terms of circuit depth and running time. For example, we show how to generate shorter circuits by plugging in the best available third party synthesis algorithm at a given hierarchy level. Composability enables portability across chip architectures, which is missing from the available approaches.},
}

EndNote citation:

%0 Thesis
%A Younis, Abdullah 
%T QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space
%I EECS Department, University of California, Berkeley
%D 2020
%8 May 21
%@ UCB/EECS-2020-53
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2020/EECS-2020-53.html
%F Younis:EECS-2020-53