Compiling Permutations for Superconducting QPUs

Soeken, Mathias; Mozafari, Fereshte; Schmitt, Bruno; Micheli, Giovanni De

doi:10.23919/date.2019.8715275

Cited by 9 publications

(7 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that this method makes use of some helper qubits in order to reduce the number of elementary quantum gates. To avoid using helper qubits, we can use [21].…”

Section: Quantum Gate Realizationmentioning

confidence: 99%

Automatic Uniform Quantum State Preparation Using Decision Diagrams

Mozafari

Soeken

Riener

et al. 2020

2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL)

Self Cite

View full text Add to dashboard Cite

“…Note that this method makes use of some helper qubits in order to reduce the number of elementary quantum gates. To avoid using helper qubits, we can use [21].…”

Section: Quantum Gate Realizationmentioning

confidence: 99%

Automatic Uniform Quantum State Preparation Using Decision Diagrams

Mozafari

Soeken

Riener

et al. 2020

2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL)

Self Cite

View full text Add to dashboard Cite

“…The construction has been rediscovered by Welch et al [4], and improved by using less CNOT gates by exploiting Gray codes. An explicit construction for functionally controlled NOT gates is described in [13]. Constructions that exploit the fact that the target qubit is in state |0 or |f (x) and aim at finding a good trade-off between number of Toffoli gates and the number of auxiliary qubits ℓ is presented in [14].…”

Section: Background and Motivationmentioning

confidence: 99%

“…, g 2 n+1 ) T be the function values in {1, −1}-coding as in (2). We use the following Lemma from [13].…”

Section: A Relationship Between Spectral Coefficients and Anglesmentioning

confidence: 99%

Quantum Circuits for Functionally Controlled NOT Gates

Soeken

Roetteler

2020

2020 IEEE International Conference on Quantum Computing and Engineering (QCE)

Self Cite

View full text Add to dashboard Cite

We generalize quantum circuits for the Toffoli gate presented by Selinger [1] and Jones [2] for functionally controlled NOT gates, i.e., X gates controlled by arbitrary nvariable Boolean functions. Our constructions target the gate set consisting of Clifford gates and single qubit rotations by arbitrary angles. Our constructions use the Walsh-Hadamard spectrum of Boolean functions and build on the work by Schuch and Siewert [3] and Welch et al [4]. We present quantum circuits for the case where the target qubit is in an arbitrary state as well as the special case where the target is in a known state. Additionally, we present constructions that require no auxiliary qubits and constructions that have a rotation depth of 1.

show abstract

“…Recent attempts in the field of automatic quantum compilation include LUTbased Hierarchical Reversible Logic Synthesis (LHRS ) [25] and Decomposition Based Synthesis (DBS ) [23]. The former framework, LHRS, uses a hierarchical method to synthesize quantum circuits from specifications provided in form of combinational logic designs.…”

Section: Introductionmentioning

confidence: 99%

Evaluating ESOP Optimization Methods in Quantum Compilation Flows

Meuli

Schmitt

Ehlers

et al. 2019

Reversible Computation

Self Cite

View full text Add to dashboard Cite

Exclusive-or sum-of-products (ESOP) expressions are used as intermediate representations in quantum circuit synthesis flows, and their complexity impacts the number of gates of the resulting circuits. Many state-of-the-art techniques focus on minimizing the number of product terms in a ESOP expression, either exactly or in a heuristic fashion. In this paper, we investigate into ESOP optimization considering two recent quantum compilation flows with opposite requirements. The first flow generates Boolean functions with a small number of Boolean variables, which enables the usage of methods from exact synthesis; the second flow generates Boolean functions with many Boolean variables, such that heuristics are more effective. We focus on the reduction of the number of T gates, which are expensive in fault-tolerant quantum computing and integrate ESOP optimization methods into both flows. We show an average reductions of 36.32% in T-count for the first flow, while in the second flow an average reduction of 28.23% is achieved.

show abstract

Compiling Permutations for Superconducting QPUs

Cited by 9 publications

References 12 publications

Automatic Uniform Quantum State Preparation Using Decision Diagrams

Automatic Uniform Quantum State Preparation Using Decision Diagrams

Quantum Circuits for Functionally Controlled NOT Gates

Evaluating ESOP Optimization Methods in Quantum Compilation Flows

Contact Info

Product

Resources

About