Related papers: Collapses in quantum-classical probabilistically c…
We show that long standing debates on the collapse and the role of the observer in quantum mechanics can be resolved experimentally via a nondistructive continuous monitoring of a single quantum system. An example of such a system, coupled…
It is widely believed that quantum mechanics cannot exhibit chaos, since unitarity of time evolution ensures that distances between quantum states are preserved. However, a parallel argument can be constructed in classical mechanics that…
A proof of quantumness is a method for provably demonstrating (to a classical verifier) that a quantum device can perform computational tasks that a classical device with comparable resources cannot. Providing a proof of quantumness is the…
We investigate entanglement for a composite closed system endowed with a scaling property allowing to keep the dynamics invariant while the effective Planck constant hbar_eff of the system is varied. Entanglement increases as hbar_eff goes…
The recent Google's claim on breakthrough in quantum computing is a gong signal for further analysis of foundational roots of (possible) superiority of some quantum algorithms over the corresponding classical algorithms. This note is a step…
Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep…
We show the following hold, unconditionally unless otherwise stated, relative to a random oracle: - There are NP search problems solvable by quantum polynomial-time machines but not classical probabilistic polynomial-time machines. - There…
The architecture of circuital quantum computers requires computing layers devoted to compiling high-level quantum algorithms into lower-level circuits of quantum gates. The general problem of quantum compiling is to approximate any unitary…
Assuming that Quantum Mechanics is universal and that it can be applied over all scales, then the Universe is allowed to be in a quantum superposition of states, where each of them can correspond to a different space-time geometry. How can…
Deterministic quantum computation with one quantum bit (DQC1) is a restricted model of quantum computing where the input state is the completely mixed state except for a single clean qubit, and only a single output qubit is measured at the…
We construct a unitary oracle relative to which $\mathbf{BQP}=\mathbf{QCMA}$ but quantum-computation-classical-communication (QCCC) commitments and QCCC multiparty non-interactive key exchange exist. We also construct a unitary oracle…
In the last four decades different programs have been carried out aiming at understanding the final fate of gravitational collapse of massive bodies once some prescriptions for the behaviour of gravity in the strong field regime are…
We establish a characterization of multi-qubit entanglement constraints in terms of non-negative power of entanglement measures based on unified-$(q,s)$ entropy. Using the Hamming weight of the binary vector related with the distribution of…
A proof of quantumness (PoQ) allows a classical verifier to efficiently test if a quantum machine is performing a computation that is infeasible for any classical machine. In this work, we propose a new approach for constructing PoQ…
The superposition principle is the cornerstone of quantum mechanics, leading to a variety of genuinely quantum effects. Whether the principle applies also to macroscopic systems or, instead, there is a progressive breakdown when moving to…
The widely held belief that BQP strictly contains BPP raises fundamental questions: if we cannot efficiently compute predictions for the behavior of quantum systems, how can we test their behavior? In other words, is quantum mechanics…
We combine the classical notions and techniques for bounded query classes with those developed in quantum computing. We give strong evidence that quantum queries to an oracle in the class NP does indeed reduce the query complexity of…
We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be…
In pursuit of a deeper understanding of Boolean Promise Constraint Satisfaction Problems (PCSPs), we identify a class of problems with restricted structural complexity, which could serve as a promising candidate for complete…
The detection and estimation of quantum entanglement are the essential issues in the theory of quantum entanglement. We construct matrices based on the realignment of density matrices and the vectorization of the reduced density matrices,…