Related papers: Dequantizing read-once quantum formulas
We present some compact quantum circuits for a deterministic quantum computing on electron-spin qubits assisted by quantum dots inside single-side optical microcavities, including the CNOT, Toffoli, and Fredkin gates. They are constructed…
We demonstrate that a classical emulation of quantum gate operations, here represented by an actual analog electronic device, can be modeled accurately as a quantum operation in terms of a universal set of Pauli operators. This observation…
In this paper we review our current results concerning the computational power of quantum read-once branching programs. First of all, based on the circuit presentation of quantum branching programs and our variant of quantum fingerprinting…
Quantum computers and quantum algorithms have made great strides in the last few years and promise improvements over classical computing for specific tasks. Although the current hardware is not yet ready to make real impacts at the time of…
A unifying principle explaining the numerical bounds of quantum correlations remains elusive despite the efforts devoted to identifying it. Here we show that these bounds are indeed not exclusive to quantum theory: for any abstract…
The paper presents the first nontrivial upper and lower bounds for (non-oblivious) quantum read-once branching programs. It is shown that the computational power of quantum and classical read-once branching programs is incomparable in the…
While it seems possible that quantum computers may allow for algorithms offering a computational speed-up over classical algorithms for some problems, the issue is poorly understood. We explore this computational speed-up by investigating…
A key open question in quantum computing is whether quantum algorithms can potentially offer a significant advantage over classical algorithms for tasks of practical interest. Understanding the limits of classical computing in simulating…
Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…
A single-shot Toffoli, or controlled-controlled-NOT, gate is desirable for classical and quantum information processing. The Toffoli gate alone is universal for reversible computing and, accompanied by the Hadamard gate, forms a universal…
When various observers obtain information in an independent fashion about a classical system, there is a simple rule which allows them to pool their knowledge, and this requires only the states-of-knowledge of the respective observers. Here…
On the basis of introspective analysis, we establish a crucial requirement for the physical computation basis of consciousness: it should allow processing a significant amount of information together at the same time. Classical computation…
In this work we define an universal arithmetical algorithm, by means of the standard quantum mechanical formalism, called universal qm-arithmetical algorithm. By universal qm-arithmetical algorithm any decidable arithmetical formula…
In this paper a didactic approach is described which immediately leads to an understanding of those postulates of quantum mechanics used most frequently in quantum computation. Moreover, an interpretation of quantum mechanics is presented…
Physical Unclonable Functions (PUFs) have been proposed as a way to identify and authenticate electronic devices. Recently, several ideas have been presented that aim to achieve the same for quantum devices. Some of these constructions…
The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here we present an efficient solution to the quantum…
Quantum computing has attracted much attention in recent decades, since it is believed to solve certain problems substantially faster than traditional computing methods. Theoretically, such an advance can be obtained by networks of the…
It is well known that a quantum circuit on $N$ qubits composed of Clifford gates with the addition of $k$ non Clifford gates can be simulated on a classical computer by an algorithm scaling as $\text{poly}(N)\exp(k)$[1]. We show that, for a…
We show that Nechiporuk's method for proving lower bounds for Boolean formulas can be extended to the quantum case. This leads to an $\Omega(n^2 / \log^2 n)$ lower bound for quantum formulas computing an explicit function. The only known…
Although classical mechanics and quantum mechanics are separate disciplines, we live in a world where Planck's constant \hbar>0, meaning that the classical and quantum world views must actually {\it coexist}. Traditionally, canonical…