paper / lovgrover / 3d ago
A novel quantum search algorithm is introduced that achieves fixed-point convergence, a feature lacking in standard quantum search. While matching the worst-case performance of the previously established Phase-$\pi/3$ algorithm, this new approach demonstrates superior average-case behavior. It also provides broader applicability for error reduction by allowing `q` to be any integer, unlike the restricted `q` values in the Phase-$\pi/3$ algorithm, by utilizing irreversible measurements on ancilla qubits.
quantum-computingquantum-search-algorithmfixed-point-searchquantum-measurementancilla-qubitsalgorithm-optimization
“The new quantum search algorithm exhibits fixed-point convergence, a property absent in standard quantum search algorithms.”
paper / lovgrover / 3d ago
This paper introduces a novel composite pulse sequence, inspired by quantum search algorithms, for correcting systematic errors in quantum control. The technique demonstrates an expanded capability to address a broader range of systematic errors, including nonlinear over-rotational errors, compared to existing methods. Its concatenability allows for arbitrary reduction of systematic errors.
quantum-physicsquantum-error-correctioncomposite-pulsesquantum-controlsystematic-errorsquantum-search
“A new composite pulse sequence was developed, inspired by quantum search principles.”
paper / lovgrover / 3d ago
A novel quantum search technique significantly reduces the probability of error in identifying marked items within a database where the precise fraction of marked entries is unknown. This method improves upon classical and previous quantum algorithms, achieving asymptotic optimality. The core contribution is an O((X_0)^3) error probability, where X_0 represents the upper bound of the uniformly distributed random variable describing the unmarked entry fraction.
quantum-computingquantum-searchalgorithm-designprobability-theorycomputational-complexity
“The best classical algorithm for searching a database with an unknown fraction of marked entries yields an error probability of O((X_0)^2).”
paper / lovgrover / 3d ago
The standard quantum search algorithm, unlike many classical counterparts, lacks fixed-point convergence. This paper introduces two novel quantum search algorithm variations that address this limitation. These variations achieve monotonic convergence and significantly reduce the probability of finding a non-target state, demonstrating improved robustness and potential for new error correction schemes. These advancements could lead to more robust and efficient quantum computing applications.
quantum-algorithmsdatabase-searchfixed-pointsquantum-computingerror-correctionquantum-information
“The standard quantum search algorithm lacks fixed-point convergence.”
paper / lovgrover / 3d ago
This paper introduces a novel quantum search algorithm that achieves superlinear (specifically, quadratic) amplitude amplification, contrasting with the linear amplification of standard algorithms. While this offers a theoretical advantage in the rate of success probability increase, the practical applicability of this new method is significantly more limited than conventional amplitude amplification techniques. This work presents a theoretical advancement in quantum search, but its constraints suggest a narrow scope for real-world implementation.
quantum-physicsamplitude-amplificationquantum-search-algorithmsquantum-computingtheoretical-physics
“The proposed quantum search algorithm amplifies amplitude quadratically with the number of operations.”