Related papers: The 7 faces of quantum NP

I assess the potential of quantum computation. Broad and important applications must be found to justify construction of a quantum computer; I review some of the known quantum algorithms and consider the prospects for finding new ones.…

An universal quantum network which can implement a general quantum computing is proposed. In this sense, it can be called the quantum central processing unit (QCPU). For a given quantum computing, its realization of QCPU is just its quantum…

In this brief note, I will consider the following questions: (1) What is QIP? (2) Why QIP is interesting? (3) What QIP can do? (4) What QIP cannot do? (5) What are the major challenges in QIP?

As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available…

The apparent impossibility of extending non-relativistic quantum mechanics to a relativistic quantum theory is shown to be due to the insufficient structural richness of the field of complex numbers over which quantum mechanics is built. A…

Quantum families of maps between quantum spaces are defined and studied. We prove that quantum semigroup (and sometimes quantum group) structures arise naturally on such objects out of more fundamental properties. As particular cases we…

From the philosopher's perspective, the interest in quantum computation stems primarily from the way that it combines fundamental concepts from two distinct sciences: physics (especially quantum mechanics) and computer science, each long a…

This chapter delves into the realm of computational complexity, exploring the world of challenging combinatorial problems and their ties with statistical physics. Our exploration starts by delving deep into the foundations of combinatorial…

Query complexity measures the amount of information an algorithm needs about a problem to compute a solution. On a quantum computer there are different realizations of a query and we will show that these are not always equivalent. Our…

Since its origins, Quantum mechanics has presented problems with the concept of individuality. It is argued that quantum particles do not have individuality, and so, one can speak about "entities without identity". On the contrary, we claim…

Quantum theory is extremely successful in explaining most physical phenomena, and is not contradicted by any experiment. Yet, the theory has many puzzling features : the occurrence of probabilities, the unclear distinction between the…

Quantum machine learning (QML) is rapidly transitioning from theoretical promise to practical relevance across data-intensive scientific domains. In this Review, we provide a structured overview of recent advances that bridge foundational…

The notion of a qubit is ubiquitous in quantum information processing. In spite of the simple abstract definition of qubits as two-state quantum systems, identifying qubits in physical systems is often unexpectedly difficult. There are an…

The relational interpretation of quantum mechanics (RQM) has received a growing interest since its first formulation in 1996. Usually presented as an interpretational layer over the usual quantum mechanics formalism, it appears as a…

I list several strong requirements for what I would consider a sensible interpretation of quantum mechanics and I discuss two simple theorems. One, as far as I know, is new; the other was only noted a few years ago. Both have important…

Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which…

The interpretation of quantum mechanics known as QBism developed out of efforts to understand the probabilities arising in quantum physics as Bayesian in character. But this development was neither easy nor without casualties. Many ideas…

There have been several non-axiomatic approaches taken to define Quantum Cellular Automata (QCA). Partitioned QCA (PQCA) are the most canonical of these non-axiomatic definitions. In this work we first show that any QCA can be put into the…

The question of whether or not quantum computers can efficiently solve NP-complete problems is open, although indications are that BQP does not contain NP. Still, many of these problems are natural candidates for solution on quantum…

Difficulties and discomfort with the interpretation of quantum mechanics are due to differences in language between it and classical physics. Analogies to The Special Theory of Relativity, which also required changes in the basic worldview…