Quantum circuit to estimate pi using quantum amplitude estimation

Abstract

This study presents a quantum circuit for estimating the pi value using arithmetic circuits and by quantum amplitude estimation. We review two types of quantum multipliers and propose quantum squaring circuits based on the multiplier as basic arithmetic circuits required for performing quantum computations. The squarer realized by a quantum adder with the gate size of $O(n)$ requires $O(n^2)$ gates and at least one ancillary qubits, while that realized by using quantum Fourier transform (QFT) requires $O(n^3)$ gates without ancillary qubit. The proposed quantum circuit to estimate pi is based on the Monte Carlo method, quantum amplitude estimation, and quantum squarer. By applying the quantum squarer using QFT, the circuit was implemented in $4n+1$ qubits at $2^{2n}$ sampling. The proposed method was demonstrated using a quantum computer simulator with $n$ being varied from 2 to 6, and the obtained result was compared with the one obtained by performing a classical calculation.

15 pages, 10 figures. Section 1, 2 and figures have been revised. Reference has been added

References in corpus (5)

• A Quantum Approximate Optimization Algorithm
• Quantum Circuit Learning
• Quantum speedup of Monte Carlo methods
• Amplitude estimation without phase estimation
• Quantum Circuits for Toom-Cook Multiplication