相关论文: Reply to: Comment on "Quantum Optimization for Com…
Unruh has commented upon my recent proof that certain predictions of quantum theory are incompatible with the assertion that no influence of any kind acts backward in time in any Lorentz frame. Unruh fails to make a necessary distinction…
In (da Costa and de Ronde, 2014), Newton da Costa together with the author of this paper argued in favor of the possibility to consider quantum superpositions in terms of a paraconsistent approach. We claimed that, even though most…
The recent literature on near-term applications for quantum computers contains several examples of the applications of hybrid quantum/classical variational approaches. This methodology can be applied to a variety of optimization problems,…
Benchmarking the performance of quantum optimization algorithms is crucial for identifying utility for industry-relevant use cases. Benchmarking processes vary between optimization applications and depend on user-specified goals. The…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
In the field of quantum information, classical optimizers play an important role. From experimentalists optimizing their physical devices to theorists exploring variational quantum algorithms, many aspects of quantum information require the…
This article reviews the 2008 quantum algorithm for linear systems of equations due to Harrow, Hassidim and Lloyd, as well as some of the followup and related work. It was submitted to the Springer Encyclopedia of Algorithms.
This paper explores the use of quantum computing, specifically the use of HHL and VQLS algorithms, to solve optimal power flow problem in electrical grids. We investigate the effectiveness of these quantum algorithms in comparison to…
In Crull (2015) it is argued that, in order to confront outstanding problems in cosmology and quantum gravity, interpretational aspects of quantum theory can by bypassed because decoherence is able to resolve them. As a result, Crull (2015)…
The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen.…
Quantum optimization holds promise for addressing classically intractable combinatorial problems, yet a standardized framework for benchmarking its performance, particularly in terms of solution quality, computational speed, and scalability…
Plastino and Rocca [Physica A 491, 1023 (2018)] recently criticized our work [Phys. Lett. A 381, 207 (2017)] on the ground that one should use functional calculus instead of the ordinary calculus adopted by us in the entropy maximization…
To date, research in quantum computation promises potential for outperforming classical heuristics in combinatorial optimization. However, when aiming at provable optimality, one has to rely on classical exact methods like integer…
Quadratic assignment problem is one of the great challenges in combinatorial optimization. It has many applications in Operations research and Computer Science. In this paper, the author extends the most-used rounding approach to a…
In this paper we motivate and study the possibility of an intuitionistic quantum logic. An explicit investigation of the application of the theory of Bruns and Lakser on distributive hulls on traditional quantum logic (as suggested in…
We review the main findings on the ranking capabilities of the recently proposed Quantum PageRank algorithm (G.D. Paparo et al., Sci. Rep. 2, 444 (2012) and G.D. Paparo et al., Sci. Rep. 3, 2773 (2013)) applied to large complex networks.…
Quantum annealing (QA) has the potential to significantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods. However, due to the limited number of…
Quantum computing is the process of performing calculations using quantum mechanics. This field studies the quantum behavior of certain subatomic particles for subsequent use in performing calculations, as well as for large-scale…
We review both the Einstein, Podolsky, Rosen (EPR) paper about the completeness of quantum theory, and Schrodinger's responses to the EPR paper. We find that both the EPR paper and Schrodinger's responses, including the cat paradox, are not…