QUANTUM PHASE ESTIMATION WITH AN ARBITRARY NUMBER OF QUBITS

DOI10.1142/S0219749913500081zbMath1269.81032arXiv1306.2713MaRDI QIDQ5300685

Chen-Fu Chiang

Publication date: 27 June 2013

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

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

zbMATH Keywords

Diophantine approximationquantum Fourier transformquantum circuitquantum phase estimation

Mathematics Subject Classification ID

Quantum computation (81P68) Numerical methods for discrete and fast Fourier transforms (65T50) Diophantine approximation in probabilistic number theory (11K60) Quantum state estimation, approximate cloning (81P50) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Quantum context-aware recommendation systems based on tensor singular value decomposition

Cites Work

• Fast multiplication of large numbers
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

This page was built for publication: QUANTUM PHASE ESTIMATION WITH AN ARBITRARY NUMBER OF QUBITS