相关论文: Reply to: Comment on "Quantum Optimization for Com…
Critical comments on the recent papers supporting the idea of resilient quantum computations are presented.
I comment on GianCarlo Ghirardi's criticism of my claim that quantum computation has no measurement problem.
We address the problem of checking query containment, a foundational problem in database research. Although extensively studied in theory research, optimization opportunities arising from query containment are not fully leveraged in…
We make remarks on the paper of Du et al (quant-ph/0011078) by pointing out that the quantum strategy proposed by the paper is trivial to the card game and proposing a simple classical strategy to make the game in classical sense fair too.
We observe that fault-tolerant quantum computers have an optimal advantage over classical computers in approximating solutions to many NP optimization problems. This observation however gives nothing in practice.
This paper presents methodological improvements to variational quantum algorithms (VQAs) for solving multicriteria optimization problems. We introduce two key contributions. First, we reformulate the parameter optimization task of VQAs as a…
This brief note in response to Wojciech Zurek's article "Quantum Darwinism, classical reality, and the randomness of quantum jumps" (Physics Today, October 2014, page 44) points out extant rebuttals in the literature to some of the author's…
This essay is a response to the (March 2000) Physics Today Opinion article "Quantum Theory Needs No Interpretation" by Fuchs and Peres. It was written several years ago and has been collecting electronic dust ever since Physics Today said…
In their Letter, Garnerone et al. claim that an adiabatic quantum algorithm can extract information about a PageRank vector with either a polynomial or exponential reduction in time resources over the classical algorithm with comparable…
We present a quantum algorithm for combinatorial optimization using the cost structure of the search states. Its behavior is illustrated for overconstrained satisfiability and asymmetric traveling salesman problems. Simulations with…
This is a review of the basic theoretical ideas of quantum criticality, and of their connection to numerous experiments on correlated electron compounds. A shortened, modified, and edited version appeared in Physics Today. This arxiv…
Optimisation plays a central role in a wide range of scientific and industrial applications, and quantum computing has been widely proposed as a means to achieve computational advantages in this domain. To date, research into the design of…
A recent Comment [arXiv:0811.2790] on the Letter 'Quantum Bounce and Cosmic Recall' by the authors is shown to arise from an incorrect understanding of the issues at hand and of our analysis. The conclusions of Bojowald's Comment are shown…
Quantum optimisation is emerging as a promising approach alongside classical heuristics and specialised hardware, yet its performance is often difficult to assess fairly. Traditional benchmarking methods, rooted in digital complexity…
This comment on the recently published article "Why Einstein, Podolsky and Rosen did not prove that quantum mechanics is 'incomplete'" (arXiv:0805.0217) by J.H.Field shows that some conclusions, made in the referred-to article, result from…
Many recent investigations conclude, based on asymptotic complexity analyses, that quantum computers could accelerate combinatorial optimization (CO) tasks relative to a purely classical computer. However, asymptotic analysis alone cannot…
We address the three points raised by the authors of the above Comment.
We present a quantum algorithmic routine that extends the realm of Grover-based heuristics for tackling combinatorial optimization problems with arbitrary efficiently computable objective and constraint functions. Building on previously…
We explain why the main conclusion of Bender et al, hep-th/0511229 [J. Phys. A 39 (2006) 1657] regarding the practical superiority of the non-Hermitian description of PT-symmetric quantum systems over their Hermitian description is not…
Quantum computation appears to offer significant advantages over classical computation and this has generated a tremendous interest in the field. In this thesis we consider the application of quantum computers to scientific computing and…