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

This document is our reply to the Comment (Miloslav Znojil 2023 J. Phys. A: Math. Theor. 56, 038001) on our recent work titled `The operational foundations of PT-symmetric and quasi-Hermitian quantum theory'. The original Comment consists…

Hornberger and Vacchini [Phys. Rev. A82, 036101 (2010); arxiv:0907.3018] claim that the specific collisional momentum decoherence, pointed out in my recent work [Phys. Rev. A80, 064104 (2009); arXiv:0905.3908], is already described by their…

In this paper I respond to a critique of one of my papers previously published in the Royal Society Open Science entitled "Quantum correlations are weaved by the spinors of the Euclidean primitives." Without engaging with the geometrical…

Elementary review article on quantum cryptography.

Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. The Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing (QA) can potentially demonstrate…

Recently, Andreas de Vries proposed a quantum algorithm that would find an element in an unsorted database exponentially faster than Grover's algorithm. We show that de Vries' algorithm does not work as intended and does not give any clue…

This study systematically benchmarks several non-fault-tolerant quantum computing algorithms across four distinct optimization problems: max-cut, number partitioning, knapsack, and quantum spin glass. Our benchmark includes noisy…

Quantum computing exposes the brilliance of quantum mechanics through computer science and, as such, gives oneself a marvelous and exhilarating journey to go through. This article leads along that journey with a historical and current…

Critical decision-making issues in science, engineering, and industry are based on combinatorial optimization; however, its application is inherently limited by the NP-hard nature of the problem. A specialized paradigm of analogue quantum…

The authors of the recent paper [1] boldly claim to discover a new fully quantum approach to foundation of statistical mechanics: "Our conceptually novel approach is free of mathematically ambiguous notions such as probability, ensemble,…

We show a practical application of an well-known nonequilibrium relation, the Jarzynski equality, in quantum computation. Its implementation may open a way to solve combinatorial optimization problems, minimization of a real single-valued…

In this paper, we review some features of quantum annealing and related topics from viewpoints of statistical physics, condensed matter physics, and computational physics. We can obtain a better solution of optimization problems in many…

In this work, we review quantum approaches to combinatorial optimization, with the aim of bridging theoretical developments and industrial relevance. We first survey the main families of quantum algorithms, including Quantum Annealing, the…

We show that given a quantum measurement, for an overwhelming majority of pure states, no meaningful information is produced. This is independent of the number of outcomes of the quantum measurement. Due to conservation inequalities, such…

This article introduces quantum computation by analogy with probabilistic computation. A basic description of the quantum search algorithm is given by representing the algorithm as a C program in a novel way.

This is a reply to the comment by M. Kastner and M. Promberger [cond-mat/0011516] on the paper published in J. Stat. Phys. 99, 691 (2000) and also in cond-mat/0002176. We show that all their criticisms do not apply.

The optimal allocation of resources is a crucial task for their efficient use in a wide range of practical applications in science and engineering. This paper investigates the optimal allocation of resources in multipartite quantum systems.…

This is a chapter in a book \emph{Quantum Error Correction} edited by D. A. Lidar and T. A. Brun, and published by Cambridge University Press (2013)\\…

The Quantum Approximate Optimization Algorithm (QAOA) constitutes one of the often mentioned candidates expected to yield a quantum boost in the era of near-term quantum computing. In practice, quantum optimization will have to compete with…

In non-relativistic as well as in special relativistic quantum theory, {\em mass} and {\em charge} are {\em pure numbers} appearing in various (quantum) operators and admit {\em any values}, {\it ie}, values for these quantities are to be…