相关论文: Reply to: Comment on "Quantum Optimization for Com…

This paper has been withdrawn due to the withdrawal of the related paper.

We criticize speculations to the effect that quantum mechanics is fundamentally about information. We do this by pointing out how unfounded such speculations in fact are. Our analysis focuses on the dubious claims of this kind recently made…

Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average…

This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number i, we are to find a location of a target…

A recent publication by the NSA assessing the usability of quantum cryptography has generated significant attention, concluding that this technology is not recommended for use. Here, we reply to this criticism and argue that some of the…

Through recent progress in hardware development, quantum computers have advanced to the point where benchmarking of (heuristic) quantum algorithms at scale is within reach. Particularly in combinatorial optimization - where most algorithms…

A recent paper by Mucino, Okon and Sudarsky attempts an assessment of the Relational Interpretation of quantum mechanics. The paper presupposes assumptions that are precisely those questioned in the Relational Interpretation, thus…

A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2^n objects that our algorithm runs in polynomial time.

Some formulas and speculations are presented relative to integrable systems and quantum mechanics.

A quantum algorithm for an oracle problem can be understood as a quantum strategy for a player in a two-player zero-sum game in which the other player is constrained to play classically. I formalize this correspondence and give examples of…

This paper has been withdrawn.

We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum…

In this short note we show, providing counterexamples, that the "two important theorems" in the recent paper [Y, Yuan, Global optimization solutions to a class of non-convex quadratic minimization problems with quadratic constraints, in…

This paper has been withdrawn by the authors.

Zeroing neural networks (ZNNs) have demonstrated outstanding performance on time-varying optimization and control problems. Nonetheless, few studies are committed to illustrating the relationship among different ZNNs and the derivation of…

This is the authors response to commentaries on the original article H is for Human and How (Not) to Evaluate Qualitative Research in HCI, https://doi.org/10.1080/07370024.2025.2475743 Commentaries were provided by: Jeffrey Bardzell,…

A Comment on the paper "Conservative Quantum Computing" by M. Ozawa, Phys. Rev. Lett. 89, 057902 (2002). The author replies in Phys. Rev. Lett. 91, 089802 (2003).

Here we provide the contributions' abstracts published in a volume we edited as a special issue in International Journal of Modern Physics B. The volume deals with the recent progress in quantifying quantum correlations beyond the generic…

In this comment we show that the approach presented by Foj\'on et al~\cite{Fojon10} is not as accurate as they claim. A straightforward calculation using the models considered buy those authors clearly shows that the spectral method, which…

This is a set of lecture notes for a graduate-level course on quantum algorithms, with an emphasis on quantum optimization algorithms. It is developed for applied mathematicians and engineers, and requires no previous background in quantum…