Compilation flow for classically defined quantum operations

We present a flow for synthesizing quantum operations that are defined by classical combinational functions. The discussion will focus on out-of-place computation, i.e., U_{f} : \vert x\rangle\vert y\rangle\vert 0\rangle^{k}\rightarrow\vert x\rangle\vert y\oplus f(x)\rangle\vert 0\rangle^{k} . Our f...

Full description

Saved in:
Bibliographic Details
Published in2021 Design, Automation & Test in Europe Conference & Exhibition (DATE) pp. 964 - 967
Main Authors Schmitt, Bruno, Javadi-Abhari, Ali, De Micheli, Giovanni
Format Conference Proceeding
LanguageEnglish
Published EDAA 01.02.2021
Subjects
compilation
design automation
Logic gates
quantum
Qubit
synthesis
Online AccessGet full text

Cover

More Information
Summary:We present a flow for synthesizing quantum operations that are defined by classical combinational functions. The discussion will focus on out-of-place computation, i.e., U_{f} : \vert x\rangle\vert y\rangle\vert 0\rangle^{k}\rightarrow\vert x\rangle\vert y\oplus f(x)\rangle\vert 0\rangle^{k} . Our flow allows users to express this function at a high level of abstraction. At its core, there is an improved version of the current state-of-the-art algorithm for synthesizing oracles [1]. As a result, our synthesized circuits use up to 25 % fewer qubits and up to 43 % fewer Clifford gates. Crucially, these improvements are possible without increasing the number of T gates nor the execution time.
ISSN:1558-1101
DOI:10.23919/DATE51398.2021.9474163