Related papers: The Entangled Quantum Polynomial Hierarchy Collaps…
In this paper, we study the phenomenon of Hopf or more specifically quantum double symmetry breaking. We devise a criterion for this type of symmetry breaking which is more general than the one existing in the literature, and therefore…
A quantum key distribution and identification protocol is proposed, which is based on entanglement swapping. Through choosing particles by twos from the sequence and performing Bell measurements, two communicators can detect eavesdropping,…
During the past decade, nine papers have obtained increasingly strong consequences from the assumption that boolean or bounded-query hierarchies collapse. The final four papers of this nine-paper progression actually achieve downward…
Quantum entanglement is known to provide a strong advantage in many two-party distributed tasks. We investigate the question of how much entanglement is needed to reach optimal performance. For the first time we show that there exists a…
We propose a new formalism for quantum entanglement (QE), and study its generic searches at the colliders. For a general quantum system with $N$ particles, we show that the quantum space (the total spin polarization parameter space) is…
One of the most surprising consequences of quantum mechanics is the entanglement of two or more distant particles. In an entangled EPR two-particle system, the value of the momentum (position) for neither single subsystem is determined.…
Entanglement is a cornerstone in quantum information science, yet detecting it efficiently remains a challenging task. Focusing on non-positive partially transposed (NPT) states, we establish a hierarchy among entropy-based, majorization,…
This letter is a proof of concept for quantum power flow (QPF) algorithms which underpin various unprecedentedly efficient power system analytics exploiting quantum computing. Our contributions are three-fold: 1) Establish a…
We give new quantum algorithms for evaluating composed functions whose inputs may be shared between bottom-level gates. Let $f$ be an $m$-bit Boolean function and consider an $n$-bit function $F$ obtained by applying $f$ to conjunctions of…
In this review article, we discuss connections between the physics of disordered systems, phase transitions in inference problems, and computational hardness. We introduce two models representing the behavior of glassy systems, the spiked…
We establish the first general connection between the design of quantum algorithms and circuit lower bounds. Specifically, let $\mathfrak{C}$ be a class of polynomial-size concepts, and suppose that $\mathfrak{C}$ can be PAC-learned with…
Quantum entanglement, after playing a significant role in the development of the foundations of quantum mechanics, has been recently rediscovered as a new physical resource with potential commercial applications such as, for example,…
Numerous scientific and engineering applications require numerically solving systems of equations. Classically solving a general set of polynomial equations requires iterative solvers, while linear equations may be solved either by direct…
In this paper we consider quantum interactive proof systems, i.e., interactive proof systems in which the prover and verifier may perform quantum computations and exchange quantum messages. It is proved that every language in PSPACE has a…
The phenomenon of quantum entanglement is explained in a way which is fully consistent with Einstein's Special Theory of Relativity. A subtle flaw is identified in the logic supporting the view that Bell's Inequality precludes all local…
Few of the known quantum algorithms can be reliably executed on a quantum computer. Therefore, as an extension, we propose a Parallel Quantum Hough transform (PQHT) algorithm that we execute on a quantum computer. We give its implementation…
In finite probability theory, events are subsets of the outcome set. Subsets can be represented by 1-dimensional column vectors. By extending the representation of events to two dimensional matrices, we can introduce "superposition events."…
It is known that $Q$-conditional symmetries of the classical Burgers' equation express in terms of three functions satisfying a coupled system of Burgers-like equations. The search of conditional symmetries of this system leads to a system…
The overlap measurement scheme accomplishes to evaluate the overlap of two input quantum states by only measuring an introduced auxiliary qubit, irrespective of the complexity of the two input states. We find a counterintuitive phenomenon…
Exploring the shareability and distribution of entanglement possesses fundamental significance in quantum information tasks. In this paper, we demonstrate that the square of bipartite entanglement measures $G_q$-concurrence, which is the…