相关论文: Reply to: Comment on "Quantum Optimization for Com…
In this comment we answer to the recent critique of our article [arXiv:2208.11793] about Relational Quantum Mechanics (RQM) by Aur\'elien Drezet [arXiv:2209.01237]. Here we point out that our critical analysis of RQM was precisely based on…
The comments raised in Ref. [1] by Mishra et al aim at two papers contained in Ref. [2]. We show that those comments on Ref. [2] pointed out by Mishra et al in Ref.[1] are not relevant and the concept used in Ref.[2] is consistent and in…
In this paper, we introduce a new approach to quantum benchmarking inspired by quantum verification motivating new paradigms of quantum benchmarking. Our proposed benchmark not only serves as a robust indicator of computational capability…
Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomial-time computations. This paper expands his framework to a…
In this manuscript we reply to the criticisms of our paper [Eur. Phys. J. A 24, 437 (2005)] raised in a recent preprint by Achasov and Kiselev [hep-ph/0606268] and demonstrate that all their criticisms are completely irrelevant and…
The article presents an introductory review of quantum algorithms for non-relativisitc as well as relativistic four component molecular energy calculations developed in past few years.
Recent experiment by Zhinden et al (Phys. Rev {\bf A} 63 02111, 2001) purports to test compatibility between relativity and quantum mechanics in the classic EPR setting. We argue that relativity has no role in the EPR argument based solely…
In recent years, quantum, quantum-inspired, and hybrid algorithms are increasingly showing promise for solving software engineering optimization problems. However, best-intended practices for conducting empirical studies have not yet well…
The paper has been withdrawn because the research work is still in progress.
The standard presentation of the principles of quantum mechanics is critically reviewed both from the experimental/operational point and with respect to the request of mathematical consistency and logical economy. A simpler and more…
Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization…
We discuss a recent work by J.~Lawrence et al.[arxiv.org/abs/2208.11793] criticizing relational quantum mechanics (RQM) and based on a famous nonlocality theorem Going back to Greenberger Horne and Zeilinger (GHZ). Here, we show that the…
This paper aims to implement and evaluate the performance of quantum computing on solving combinatorial optimization problems arising from the operations of the power grid. To this end, we construct a novel mixed integer conic programming…
We have reviewed the comment in [3], posted on arXiv.org concerning our recent work in [1]. We reply to the comment in this paper.
The paper has been withdrawn
The paper offers an argument against an intuitive reading of the Stone-von Neumann theorem as a categoricity result, thereby pointing out that, against what is usually taken to be the case, this theorem does not entail any model-theoretical…
In this paper, we extend a previously presented Grover-based heuristic to tackle general combinatorial optimization problems with linear constraints. We further describe the introduced method as a framework that enables performance…
This paper has been withdrawn by the author due to an apparent misunderstanding of quantum feedback control.
Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data. Quantum kernels are able to capture relationships in the data that are not…
taking aside the review part, a finite-cardinality's set of new ideas concerning algorithmic information issues in Quantum Mechanics is introduced and analyzed