1. Quantum Applications - Fachbeitrag: Vielversprechend: Monte-Carlo-ähnliche Methoden auf dem Quantencomputer

2021/09/20 by Carsten Blank, Francesco Petruccione · 1 citation
Computer Science · #Computability, Logic, AI Algorithms #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography

paper · doi:10.1007/s42354-021-0403-z

crossref issued 2021/09/20 · crossref published 2021/09/20 · crossref published-online 2021/09/20 · openalex publication_date 2021/09/20 · crossref created 2021/09/20 · crossref deposited 2021/09/20 · crossref published-print 2021/10/01 · crossref indexed 2022/04/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Citations

• Quantum-state preparation with universal gate decompositions
• Synthesis of Quantum Logic Circuits
• Algorithms for quantum computation: discrete logarithms and factoring
• Quantum Computing in the NISQ era and beyond
• Quantum Generative Adversarial Networks for learning and loading random distributions
• Quantum Computation and Quantum Information
• A Variational Quantum Algorithm for Preparing Quantum Gibbs States
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Cited by

• Francesco Petruccione [wikipedia]