Duan, Giedke, Cirac and Zoller (quant-ph/9908056) and, independently, Simon (quant-ph/9909044) have recently found necessary and sufficient conditions for the separability (classical correlation) of the Gaussian two-party (continuous variable) states. Duan et al remark that their criterion is based on a "much stronger bound" on the total variance of a pair of Einstein-Podolsky-Rosen-type operators than is required simply by the uncertainty relation. Here, we seek to formalize and test this particular assertion in both classical and quantum-theoretic frameworks. We first attach to these states the classical a priori probability (Jeffreys' prior), proportional to the volume element of the Fisher information metric on the Riemannian manifold of Gaussian (quadrivariate normal) probability distributions. Then, numerical evidence indicates that more than ninety-nine percent of the Gaussian two-party states do, in fact, meet the more stringent criterion for separability. We collaterally note that the prior probability assigned to the classical states, that is those having positive Glauber-Sudarshan P-representations, is less than one-thousandth of one percent. We, then, seek to attach as a measure to the Gaussian two-party states, the volume element of the associated (quantum-theoretic) Bures (minimal monotone) metric. Our several extensive analyses, then, persistently yield probabilities of separability and classicality that are, to very high orders of accuracy, unity and zero, respectively, so the two apparently quite distinct (classical and quantum-theoretic) forms of analysis are rather remarkably consistent in their findings.
Singularity or negativity of Glauber P-function is a widespread notion of nonclassicality, with important implications in quantum optics and with the character of an irreducible resource. Here we explore how P-nonclassicality may be generated by conditional Gaussian measurements on bipartite Gaussian states. This nonclassical steering may occur in a weak form, which does not imply entanglement, and in a strong form that implies EPR-steerability and thus entanglement. We show that field quadratures are the best measurements to remotely generate nonclassicality, and exploit this result to derive…
In the nonsignaling framework, nonclassicality in correlation arising from two spatially separated input-output devices gets manifested, solely, through its \emph{nonlocal} behavior. Study of correlations based on this said feature is commonly known as local-nonlocal paradigm. While in two-party scenario correlations can be of only two types either local or nonlocal, the situation gets more involved for multi-party scenario, \emph{e.g.,} for tripartite scenario, correlations can be of three types: fully local, two-way local, and genuinely nonlocal. Nonsignaling correlations having quantum real…
Reassessing the boundary between classical and nonclassical for individual quantum processes
Institute for Quantum Computing, University of Waterloo（滑铁卢大学量子计算研究所）；Perimeter Institute for Theoretical Physics（理论物理前沿研究所）；Department of Physics & Astronomy, University of Waterloo（滑铁卢大学物理与天文学系）
A bipartite state is classical with respect to party $A$ if and only if party $A$ can perform nondisruptive local state identification (NDLID) by a projective measurement. Motivated by this we introduce a class of quantum correlation measures for an arbitrary bipartite state. The measures utilize the general Schatten $p$-norm to quantify the amount of departure from the necessary and sufficient condition of classicality of correlations provided by the concept of NDLID. We show that for the case of Hilbert-Schmidt norm, i.e. $p=2$, a closed formula is available for an arbitrary bipartite state.…
Proper time, ideal clocks, and boosts are well understood classically, but subtleties arise in quantum physics. We show that quantum clocks set in motion via momentum boosts do not witness classical time dilation. However, using velocity boosts we find the ideal behaviour in both cases where the quantum clock and classical observer are set in motion. Without internal state dependent forces additional effects arise. As such, we derive observed frequency shifts in ion trap atomic clocks, indicating a small additional shift, and also show the emergence of non-ideal behaviour in a theoretical cloc…
Rutherford scattering is usually described by treating the projectile either classically or as quantum mechanical plane waves. Here we treat them as wave packets and study their head-on collisions with the stationary target nuclei. We simulate the quantum dynamics of this one-dimensional system and study deviations of the average quantum solution from the classical one. These deviations are traced back to the convexity properties of Coulomb potential. Finally, we sketch how these theoretical findings could be tested in experiments looking for the onset of nuclear reactions.
Nonclassicality according to the singularity or negativity of the Glauber P-function is a powerful resource in quantum information, with relevant implications in quantum optics. In a Gaussian setting, and for a system of two modes, we explore how P-nonclassicality may be conditionally generated or influenced on one mode by Gaussian measurements on the other mode. Starting from the class of two-mode squeezed thermal states (TMST), we introduce the notion of nonclassical steering (NS) and the graphical tool of Gaussian triangoloids. In particular, we derive a necessary and sufficient condition f…
Quantum teleportation establishes a correspondence between an entangled state shared by two separate par- ties that can communicate classically and the presence of a quantum channel connecting the two parties. The standard benchmark for quantum teleportation, based on the average fidelity between the input and output states, indicates that some entangled states do not lead to channels which can be certified to be quantum. It was re- cently shown that if one considers a finer-tuned witness, then all entangled states can be certified to produce a non-classical teleportation channel. Here we expe…
We study the effects of quantum entanglement on the performance of two classical zero-error communication tasks among multiple parties. Both tasks are generalizations of the two-party zero-error channel-coding problem, where a sender and a receiver want to perfectly communicate messages through a one-way classical noisy channel. If the two parties are allowed to share entanglement, there are several positive results that show the existence of channels for which they can communicate strictly more than what they could do with classical resources. In the first task, one sender wants to communicat…
The functionality of classically-instructed remotely prepared random secret qubits was introduced in (Cojocaru et al 2018) as a way to enable classical parties to participate in secure quantum computation and communications protocols. The idea is that a classical party (client) instructs a quantum party (server) to generate a qubit to the server's side that is random, unknown to the server but known to the client. Such task is only possible under computational assumptions. In this contribution we define a simpler (basic) primitive consisting of only BB84 states, and give a protocol that realiz…
We investigate sampling procedures that certify that an arbitrary quantum state on $n$ subsystems is close to an ideal mixed state $φ^{\otimes n}$ for a given reference state $φ$, up to errors on a few positions. This task makes no sense classically: it would correspond to certifying that a given bitstring was generated according to some desired probability distribution. However, in the quantum case, this is possible if one has access to a prover who can supply a purification of the mixed state. In this work, we introduce the concept of mixed-state certification, and we show that a natural sam…
We investigate the relationship between no backwards in time signaling and classically causal correlations. We discover that unlike the case for two parties, the no backwards in time signaling paradigm for three parties is not enough to ensure that correlations can be reproduced with a classical causal ordering. We demonstrate this with an explicit example. We also generalise some existing results for linear two-time states to multi-party scenarios.
Discord, originally notable as a signature of bipartite quantum correlation,in fact can be nonzero classically, i.e., arising from noisy measurements by one of the two parties. Here we redefine classical discord to quantify channel distortion,in contrast to the previous restriction of classical discord to a state,and we then show a monotonic relationship between classical (channel) discord and channel distortion. We show that classical discord is equivalent to (doubly stochastic) channel distortion by numerically discovering a monotonic relation between discord and total-variation distance for…
We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to constant accuracy, must transmit at least $Ω(2^n)$ bits. This lower bound is optimal and matches the complexity of a simple protocol based on discretisation using an $ε$-net. The proof is based on a lower bound on the classical communication complexity of a distributed variant of the Fourier sampling problem. We obtain two optimal quantum-classical separation…
A possible notion of nonclassicality for single systems can be defined on the basis of the notion of memory cost of classically simulating probabilities observed in a temporal sequence of measurements. We further explore this idea in a theory-independent framework, namely, from the perspective of general probability theories (GPTs), which includes classical and quantum theory as special examples. Under the assumption that each system has a finite memory capacity, identified with the maximal number of states perfectly distinguishable with a single measurement, we investigate what are the tempor…
Weak coin flipping is among the fundamental cryptographic primitives which ensure the security of modern communication networks. It allows two mistrustful parties to remotely agree on a random bit when they favor opposite outcomes. Unlike other two-party computations, one can achieve information-theoretic security using quantum mechanics only: both parties are prevented from biasing the flip with probability higher than $1/2+ε$, where $ε$ is arbitrarily low. Classically, the dishonest party can always cheat with probability $1$ unless computational assumptions are used. Despite its importance,…
It has long been recognized that certain quantum correlations are incompatible with particular assumption about classical causal structure. Given a causal structure of unknown classicality, the presence of such correlations certifies the nonclassical nature of the causal structure in a device-independent fashion. In structures where all parties share a common resource, these nonclassical correlations are also known as nonlocal correlations. Any constraint satisfied by all correlations which are classically compatible with a given causal structure defines a causal compatibility criterion. Such …
Quantum discord plays a pragmatic role in analyzing nonclassical feature of quantum correlations beyond entanglement. It is used in several information processing protocols which lacks sufficient amount of entanglement to be used as a resource. We have provided with an analytical method of detecting quantum discord of an arbitrary two qubit state. We have formulated a set of necessary and sufficient conditions for any two qubit state to be a both-way non-zero quantum discord state. As quantum discord is asymmetric in nature, we have framed the set of if and only if conditions for a two qubit s…
Quantum mechanical effects have enabled the construction of cryptographic primitives that are impossible classically. For example, quantum copy-protection allows for a program to be encoded in a quantum state in such a way that the program can be evaluated, but not copied. Many of these cryptographic primitives are two-party protocols, where one party, Bob, has full quantum computational capabilities, and the other party, Alice, is only required to send random BB84 states to Bob. In this work, we show how such protocols can generically be converted to ones where Alice is fully classical, assum…
Quantum Advantage for Two-Party Differential Privacy
University of Illinois at Urbana-Champaign（伊利诺伊大学厄巴纳-香槟分校）；Joint Center for Quantum Information and Computer Science, NIST/University of Maryland（量子信息与计算机科学联合中心，美国国家标准与技术研究院/马里兰大学）；Joint Quantum Institute, NIST/University of Maryland（量子研究所，美国国家标准与技术研究院/马里兰大学）
Recently, major progress has been made towards the realisation of quantum internet to enable a broad range of classically intractable applications. These applications such as delegated quantum computation require running a secure identification protocol between a low-resource and a high-resource party to provide secure communication. In this work, we propose two identification protocols based on the emerging hardware secure solutions, the quantum Physical Unclonable Functions (qPUFs). The first protocol allows a low-resource party to prove its identity to a high-resource party and in the secon…
A nonclassical state of light is distributed, via a beam splitter, between two remote parties. One of the parties applies the photon annihilation operator to its portion of the state. Surprisingly, this local intervention removes a photon from the entire initial state, leaving its mode as well as the spatial and temporal structure undisturbed. In this way, nonlocal quantum action-at-a-distance occurs without local state collapse by either party. This leads to curious consequences, such as the absence of a shadow when the annihilation operator is applied to a part of the spatial cross-section o…
Cryptography without Long-Term Quantum Memory and Global Entanglement: Classical Setups for One-Time Programs, Copy Protection, and Stateful Obfuscation
We study the process of assisted work distillation. This scenario arises when two parties share a bipartite quantum state $ρ_{AB}$ and their task is to locally distil the optimal amount of work when one party is restricted to thermal operations whereas the other can perform general quantum operations and they are allowed to communicate classically. We demonstrate that this question is intimately related to the distillation of classical/quantum correlations. In particular, we show that the advantage of one party performing global measurements over many copies of $ρ_{AB}$ is related to the non-a…
Entirely nonlocal quantum magic without entanglement
Yau Mathematical Sciences Center, Tsinghua University（清华大学丘成桐数学科学中心）；Beijing Key Laboratory of Fault-Tolerant Quantum Computing, Beijing Academy of Quantum Information Sciences（北京容错量子计算北京市重点实验室，北京量子信息科学研究院）
For distinguishing quantum states sampled from a fixed ensemble, the gap in bipartite and single-party distinguishability can be interpreted as a nonlocality of the ensemble. In this paper, we consider bipartite state discrimination in a composite system consisting of $N$ subsystems, where each subsystem is shared between two parties and the state of each subsystem is randomly sampled from a particular ensemble comprising the Bell states. We show that the success probability of perfectly identifying the state converges to $1$ as $N\rightarrow\infty$ if the entropy of the probability distributi…
Weak coin flipping (WCF) is a fundamental cryptographic primitive for two-party secure computation, where two distrustful parties need to remotely establish a shared random bit whilst having opposite preferred outcomes. It is the strongest known primitive with arbitrarily close to perfect security quantumly while classically, its security is completely compromised (unless one makes further assumptions, such as computational hardness). A WCF protocol is said to have bias $ε$ if neither party can force their preferred outcome with probability greater than $1/2+ε$. Classical WCF protocols are sho…
We construct the first constant-round protocols for secure quantum computation in the two-party (2PQC) and multi-party (MPQC) settings with security against malicious adversaries. Our protocols are in the common random string (CRS) model. - Assuming two-message oblivious transfer (OT), we obtain (i) three-message 2PQC, and (ii) five-round MPQC with only three rounds of online (input-dependent) communication; such OT is known from quantum-hard Learning with Errors (QLWE). - Assuming sub-exponential hardness of QLWE, we obtain (i) three-round 2PQC with two online rounds and (ii) four-round MPQC …
Two systems whose correlations cannot be classically accounted for display the simplest instance of quantum entanglement. Although this two-party association has caused a revolution in the foundations and uses of quantum mechanics, genuine entanglement among several parties unveils a whole new class of phenomena and applications. In this work we suggest a way to prepare Dicke states from a tunable source of bipartite entanglement to investigate foundational issues. The scheme has the following distinctive features: (i) it relies on controlled information loss and {\it unentangled} measurements…
In spite of their outstanding experimental relevance, Gaussian operations in continuous-variable quantum systems are subjected to fundamental limitations, as it is known that general resources cannot be distilled within the Gaussian paradigm. We show that these limitations can be overcome by considering a collaborative setting where one party increases the amount of local resource with the aid of another party, whose operations are assumed to be Gaussian but are otherwise unrestricted; the two parties can only communicate classically. We show that in single-shot scenarios, unlike in the well-k…
We propose three constructions of classically verifiable non-interactive zero-knowledge proofs and arguments (CV-NIZK) for QMA in various preprocessing models. - We construct a CV-NIZK for QMA in the quantum secret parameter model where a trusted setup sends a quantum proving key to the prover and a classical verification key to the verifier. It is information theoretically sound and zero-knowledge. - Assuming the quantum hardness of the learning with errors problem, we construct a CV-NIZK for QMA in a model where a trusted party generates a CRS and the verifier sends an instance-independent q…
Spekkens has introduced an epistemically restricted classical theory of discrete systems, based on discrete phase space. The theory manifests a number of quantum-like properties but cannot fully imitate quantum theory because it is noncontextual. In this paper we show how, for a certain class of quantum systems, the quantum description of an experiment can be decomposed into classical descriptions that are epistemically restricted, though in a different sense than in Spekkens' work. For each aspect of the experiment -- the preparation, the transformations, and the measurement -- the epistemic …
We describe two procedures which, given access to one copy of a quantum state and a sequence of two-outcome measurements, can distinguish between the case that at least one of the measurements accepts the state with high probability, and the case that all of the measurements have low probability of acceptance. The measurements cannot simply be tried in sequence, because early measurements may disturb the state being tested. One procedure is based on a variant of Marriott-Watrous amplification. The other procedure is based on the use of a test for this disturbance, which is applied with low pro…
Fully-homomorphic encryption (FHE) enables computation on encrypted data while maintaining secrecy. Recent research has shown that such schemes exist even for quantum computation. Given the numerous applications of classical FHE (zero-knowledge proofs, secure two-party computation, obfuscation, etc.) it is reasonable to hope that quantum FHE (or QFHE) will lead to many new results in the quantum setting. However, a crucial ingredient in almost all applications of FHE is circuit verification. Classically, verification is performed by checking a transcript of the homomorphic computation. Quantum…
