| ||||
| ||||
![]() Title:A Resource-Efficient Quantum Circuit for Fixed-Point Logarithm Operations with Analytical Error Bounds Conference:ASP-DAC 2027 Tags:circuit design, Clifford+T, error bounds, fixed-point arithmetic, quantum arithmetic, quantum logarithm and resource analysis Abstract: Quantum circuits for logarithm operations are essential building blocks for scientific computing and quantum algorithms. To achieve O(2^-F) bounded error, where F is the decimal point precision in bits, existing quantum circuit designs require complexity of O(F^2 lg(F)) in width and complexity of O(F^3 lg(F)) in depth. There does exist a lower-complexity design with complexity O(F^2) in width and O(F^3) in depth, but it lacks an error bound analysis. This paper proposes a resource-efficient quantum circuit construction for logarithm operations of positive fixed-point inputs. Using a leading-zero counter and a shifter, the proposed circuit construction extracts the integer characteristic and normalizes the remaining computation to approximate the fraction. The circuit construction for the fractional part consists of: (1) M rounds of range reduction based on square root, and (2) an Taylor expansion of N terms in Horner-form. This design enables a tunable trade-off to avoid unnecessary circuit overhead. We further analyze how the values of M and N affect the constructed quantum circuit in terms of resources needed and errors. For F fractional output bits, choosing M=N=Theta(F^0.5), the proposed circuit construction achieves O(2^-F) bounded error with complexity O(F^1.5) in width and O(F^2.5) in depth. Experimental results also validate our theoretical claims. A Resource-Efficient Quantum Circuit for Fixed-Point Logarithm Operations with Analytical Error Bounds ![]() A Resource-Efficient Quantum Circuit for Fixed-Point Logarithm Operations with Analytical Error Bounds | ||||
| Copyright © 2002 – 2026 EasyChair |
