A necessary and sufficient condition for the quantum imaginary-time Mpemba effect is that it depends only on the population ratios of excited states to the ground state.
Grover’s algorithm is an approximation of imaginary-time evolution,
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4representative citing papers
Riemannian modified Newton optimization on quantum search achieves quadratic convergence and O(√(N/M) log log(1/ε)) complexity when M/N is known.
All-step fixed-point amplitude amplification on IBM Heron preserves sequential Tiger POMDP posteriors and planner actions across 8–32 step horizons inside a measured operating envelope.
A non-unitary extension of Grover's algorithm achieves O(sqrt(N)) query complexity matching the optimal bound by using a single large rotation via block encoding and Chebyshev approximation, at the cost of one additional qubit.
citing papers explorer
-
Theory of Quantum Imaginary-Time Mpemba Effect
A necessary and sufficient condition for the quantum imaginary-time Mpemba effect is that it depends only on the population ratios of excited states to the ground state.
-
Achieving double-logarithmic precision dependence in optimization-based quantum unstructured search
Riemannian modified Newton optimization on quantum search achieves quadratic convergence and O(√(N/M) log log(1/ε)) complexity when M/N is known.
-
QANTIS: Hardware-Calibrated Sequential POMDP Belief Updates on IBM Heron
All-step fixed-point amplitude amplification on IBM Heron preserves sequential Tiger POMDP posteriors and planner actions across 8–32 step horizons inside a measured operating envelope.
-
Non-unitary extension of Grover's search algorithm
A non-unitary extension of Grover's algorithm achieves O(sqrt(N)) query complexity matching the optimal bound by using a single large rotation via block encoding and Chebyshev approximation, at the cost of one additional qubit.