Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAlmost quantum correlations
175
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
There have been a number of attempts to derive the set of quantum non-local correlations from reasonable physical principles. Here we introduce $tilde{Q}$, a set of multipartite supra-quantum correlations that has appeared under different names in fields as diverse as graph theory, quantum gravity and quantum information science. We argue that $tilde{Q}$ may correspond to the set of correlations of a reasonable physical theory, in which case the research program to reconstruct quantum theory from device-independent principles is met with strong obstacles. In support of this conjecture, we prove that $tilde{Q}$ is closed under classical operations and satisfies the physical principles of Non-Trivial Communication Complexity, No Advantage for Nonlocal Computation, Macroscopic Locality and Local Orthogonality. We also review numerical evidence that almost quantum correlations satisfy Information Causality.
rate research
Read More
Quantum discord quantifies non-classical correlations in a quantum system including those not captured by entanglement. Thus, only states with zero discord exhibit strictly classical correlations. We prove that these states are negligible in the whole Hilbert space: typically a state picked out at random has positive discord; and, given a state with zero discord, a generic arbitrarily small perturbation drives it to a positive-discord state. These results hold for any Hilbert-space dimension, and have direct implications on quantum computation and on the foundations of the theory of open systems. In addition, we provide a simple necessary criterion for zero quantum discord. Finally, we show that, for almost all positive-discord states, an arbitrary Markovian evolution cannot lead to a sudden, permanent vanishing of discord.
To identify which principles characterize quantum correlations, it is essential to understand in which sense this set of correlations differs from that of almost quantum correlations. We solve this problem by invoking the so-called no-restriction hypothesis, an explicit and natural axiom in many reconstructions of quantum theory stating that the set of possible measurements is the dual of the set of states. We prove that, contrary to quantum correlations, no generalised probabilistic theory satisfying the no-restriction hypothesis is able to reproduce the set of almost quantum correlations. Therefore, any theory whose correlations are exactly, or very close to, the almost quantum correlations necessarily requires a rule limiting the possible measurements. Our results suggest that the no-restriction hypothesis may play a fundamental role in singling out the set of quantum correlations among other non-signalling ones.
In a quantum money scheme, a bank can issue money that users cannot counterfeit. Similar to bills of paper money, most quantum money schemes assign a unique serial number to each money state, thus potentially compromising the privacy of the users of quantum money. However in a quantum coins scheme, just like the traditional currency coin scheme, all the money states are exact copies of each other, providing a better level of privacy for the users. A quantum money scheme can be private, i.e., only the bank can verify the money states, or public, meaning anyone can verify. In this work, we propose a way to lift any private quantum coin scheme -- which is known to exist based on the existence of one-way functions, due to Ji, Liu, and Song (CRYPTO18) -- to a scheme that closely resembles a public quantum coin scheme. Verification of a new coin is done by comparing it to the coins the user already possesses, by using a projector on to the symmetric subspace. No public coin scheme was known prior to this work. It is also the first construction that is very close to a public quantum money scheme and is provably secure based on standard assumptions. The lifting technique when instantiated with the private quantum coins scheme, due to Mosca and Stebila 2010, gives rise to the first construction that is very close to an inefficient unconditionally secure public quantum money scheme.
The first separation between quantum polynomial time and classical bounded-error polynomial time was due to Bernstein and Vazirani in 1993. They first showed a O(1) vs. Omega(n) quantum-classical oracle separation based on the quantum Hadamard transform, and then showed how to amplify this into a n^{O(1)} time quantum algorithm and a n^{Omega(log n)} classical query lower bound. We generalize both aspects of this speedup. We show that a wide class of unitary circuits (which we call dispersing circuits) can be used in place of Hadamards to obtain a O(1) vs. Omega(n) separation. The class of dispersing circuits includes all quantum Fourier transforms (including over nonabelian groups) as well as nearly all sufficiently long random circuits. Second, we give a general method for amplifying quantum-classical separations that allows us to achieve a n^{O(1)} vs. n^{Omega(log n)} separation from any dispersing circuit.
A proof that almost all quantum systems have trap free (that is, free from local optima) landscapes is presented for a large and physically general class of quantum system. This result offers an explanation for why gradient methods succeed so frequently in quantum control in both theory and practice. The role of singular controls is analyzed using geometric tools in the case of the control of the propagator of closed finite dimension systems. This type of control field has been implicated as a source of landscape traps. The conditions under which singular controls can introduce traps, and thus interrupt the progress of a control optimization, are discussed and a geometrical characterization of the issue is presented. It is shown that a control being singular is not sufficient to cause a control optimization progress to halt and sufficient conditions for a trap free landscape are presented. It is further shown that the local surjectivity axiom of landscape analysis can be refined to the condition that the end-point map is transverse to each of the level sets of the fidelity function. This novel condition is shown to be sufficient for a quantum systems landscape to be trap free. The control landscape for a quantum system is shown to be trap free for all but a null set of Hamiltonians using a novel geometric technique based on the parametric transversality theorem. Numerical evidence confirming this is also presented. This result is the analogue of the work of Altifini, wherein it is shown that controllability holds for all but a null set of quantum systems in the dipole approximation. The presented results indicate that by-and-large limited control resources are the most physically relevant source of landscape traps.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
