Deterministic algorithms for compiling quantum circuits with recurrent patterns

DOI10.1007/s11128-021-03150-9OpenAlexW3174296785MaRDI QIDQ2690498

Davide Ferrari, Michele Amoretti, Ivano Tavernelli

Publication date: 17 March 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.08765

zbMATH Keywords

quantum compilationrecurrent patternsRyRz circuits

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

XIRAC-Q: a near-real-time quantum operating system scheduling structure based on Shannon information theorem

Uses Software

• Quipper
• RevLib
• ScaffCC
• QISKit
• openQASM

Cites Work

• Unnamed Item
• Unnamed Item
• An Introduction to Quantum Programming in Quipper
• Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits
• Quantum cryptography based on Bell’s theorem
• Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices
• Boolean satisfiability in quantum compilation
• Quantum Circuit Design of a T-count Optimized Integer Multiplier

This page was built for publication: Deterministic algorithms for compiling quantum circuits with recurrent patterns