.png){kind=icon}
.png){kind=icon}
Return
Quantum Algorithm for Numerical Computation Using Post-selection Measurement
.png){kind=icon}
PRE
AI
DOI：10.1007/s40998-025-00910-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Numerical operations, like addition, subtraction, multiplication, and division, are the basics for any large computation. The design of these operations is also essential in quantum computing. Quantum computation is reversible in nature, and for which circuit design is different than the classical operation. In this paper, post-selection measurement, a method of collapsing to a particular stable state from a superposition or an entangled state, is applied to design such numerical operations in a quantum circuit. In the beginning, the addition circuit is designed, and then other operations like subtraction, multiplication, and division are designed using the same addition circuit. Using superposition, the results of all input values are computed in parallel, and then operand qubits are post-selected from the superposition to the desired operands to obtain the desired output. The circuits can be used with both binary and fractional inputs. Parameters such as quantum cost, success probability, circuit depth, and noise resilience are used to assess the performance of the circuits. The proposed generalized circuits are analyzed and compared with the other methods.
Keywords:
Numeric operation
Post-selection
Superposition
Measurement
Entanglement
Journal
I
IF:
1.4
Papers:
153
Citations:
0