Related papers: Open Problems Related to Quantum Query Complexity
Relativistic quantum chemistry has evolved into a fertile and large field and is now becoming an integrated part of mainstream chemistry. Yet, given the much-involved physics and mathematics (as compared with nonrelativistic quantum…
Some formulas and speculations are presented relative to integrable systems and quantum mechanics.
The notion of quantum information related to the two different perspectives of the global and local states is examined. There is circularity in the definition of quantum information because we can speak only of the information of systems…
Given a large dataset of many tuples, it is hard for users to pick out their preferred tuples. Thus, the preference query problem, which is to find the most preferred tuples from a dataset, is widely discussed in the database area. In this…
I use an instrumental approach to investigate some commonly made claims about interpretations of quantum mechanics, especially those that pertain questions of locality. The here presented investigation builds on a recently proposed taxonomy…
In this paper, we consider first-order logic over unary functions and study the complexity of the evaluation problem for conjunctive queries described by such kind of formulas. A natural notion of query acyclicity for this language is…
The idea that quantum gravity manifestations would be associated with a violation of Lorentz invariance is very strongly bounded and faces serious theoretical challenges. Other related ideas seem to be drowning in interpretational…
A generalized algebra of quantum observables, depending on extra dimensional constants, is considered. Some limiting forms of the algebra are investigated and their possible applications to the descriptions of interactions of fundamental…
We comment on the present status, the concepts and their limitations, and the successes and open problems of the various approaches to a relativistic quantum theory of elementary particles, with a hindsight to questions concerning quantum…
Quantum capacities are fundamental quantities that are notoriously hard to compute and can exhibit surprising properties such as superadditivity. Thus, a vast amount of literature is devoted to finding tight and computable bounds on these…
The phenomenon of quantum entanglement is thoroughly investigated, focussing especially on geometrical aspects and on bipartite systems. After introducing the formalism and discussing general aspects, some of the most important separability…
While extensive research on query evaluation has achieved consistent improvements in the time complexity of algorithms, the space complexity of query evaluation has been largely ignored. This is a particular challenge in settings with…
A common understanding of quantum mechanics (QM) among students and practical users is often plagued by a number of "myths", that is, widely accepted claims on which there is not really a general consensus among experts in foundations of…
Quantum computing involving physical systems with continuous degrees of freedom, such as the quantum states of light, has recently attracted significant interest. However, a well-defined quantum complexity theory for these bosonic…
Quantum algorithms are demonstrated to outperform classical algorithms for certain problems and thus are promising candidates for efficient information processing. Herein we aim to provide a brief and popular introduction to quantum…
Reverse engineering problems for conjunctive queries (CQs), such as query by example (QBE) or definability, take a set of user examples and convert them into an explanatory CQ. Despite their importance, the complexity of these problems is…
Whereas quantum complexity theory has traditionally been concerned with problems arising from classical complexity theory (such as computing boolean functions), it also makes sense to study the complexity of inherently quantum operations…
As time passes, once simple quantum states tend to become more complex. For strongly coupled k-local Hamiltonians, this growth of computational complexity has been conjectured to follow a distinctive and universal pattern. In this paper we…
Programming for today's quantum computers is making significant strides toward modern workflows compatible with high performance computing (HPC), but fundamental challenges still remain in the integration of these vastly different…
Is there a general theorem that tells us when we can hope for exponential speedups from quantum algorithms, and when we cannot? In this paper, we make two advances toward such a theorem, in the black-box model where most quantum algorithms…