Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices

DOI10.1142/S0219749918400063zbMath1407.81061arXiv1801.02363MaRDI QIDQ4620294

Michele Amoretti, Davide Ferrari

Publication date: 8 February 2019

Published in: International Journal of Quantum Information (Search for Journal in Brave)

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

zbMATH Keywords

quantum compiling; IBM Q; parity learning

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

81P68: Quantum computation

94C05: Analytic circuit theory

81P40: Quantum coherence, entanglement, quantum correlations

Related Items

Deterministic algorithms for compiling quantum circuits with recurrent patterns

Uses Software

• GitHub
• QISKit

Cites Work

• Unnamed Item
• Greedy randomized search for scalable compilation of quantum circuits
• Model checking at IBM
• An improved lower bound on query complexity for quantum PAC learning
• Cryptography from Learning Parity with Noise
• Efficient noise-tolerant learning from statistical queries
• A theory of the learnable
• On Learning Ring-Sum-Expansions
• Learning Integer Lattices
• On the inherent intractability of certain coding problems (Corresp.)
• Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
• Some optimal inapproximability results
• On lattices, learning with errors, random linear codes, and cryptography