Quantum advantage for probabilistic one-time programs

Roehsner, Marie-Christine; Kettlewell, Joshua A.; Batalhão, Tiago B.; Fitzsimons, Joseph F.; Walther, Philip

doi:10.1038/s41467-018-07591-2

Cited by 24 publications

(22 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Examples of this type of devices can already be found both in classical and quantum computing, where the security of one-time programs essentially relies on hardware components, i.e. on onetime memories [9,10]. Other potential applications of our finding may be expected to be found in cryptography and hardware security in general.…”

Section: Discussionmentioning

confidence: 77%

Accessing inaccessible information via quantum indistinguishability

Horvat¹,

Dakić²

2022

Preprint

View full text Add to dashboard Cite

Suppose that Alice stumbles upon a box containing some confidential information and wishes to read out the latter. The problem is that the box is practically unbreakable and the information is so encoded as not to leave any physical trace in the environment, thereby leaving Alice with apparently no means of gathering the information. While the information is per assumption inaccessible classically, we show that it can be read out almost perfectly within quantum mechanics. Interestingly, the task can be accomplished only if Alice employs additional boxes, which need to be identical to the initial one in the quantum-mechanical sense. After formalizing the task we show how its solution relies on an interplay between entanglement and quantum indistinguishability. We also discuss the broader merit of our findings, thereby pointing out their relevance for quantum information processing.

show abstract

Section: Discussionmentioning

confidence: 77%

Accessing inaccessible information via quantum indistinguishability

Horvat¹,

Dakić²

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…One way to do so is to follow the reasoning of [27]: take the timeordered decomposition of the distribution P from [53] that violates the guess-your-neighbor's-input (GYNI) inequality and find the λ that best mimic the marginal P a|x,λ -this effectively amounts to a one-time program [54]. The resulting TO-LHS assemblage violates GYNI, hence is not NS-LHS, but it is also supra-quantum, since no quantum state can violate the GYNI inequality.…”

Section: Methodsmentioning

confidence: 99%

Exposure of subtle multipartite quantum nonlocality

Taddei,

Silva,

Nery

et al. 2019

Preprint

View full text Add to dashboard Cite

Quantum systems can exhibit nonlocal behavior, violating Bell's criteria for local causal models. The traditional definition of multipartite Bell nonlocality allowed for a contradictory effect whereby local operations could create nonlocality seemingly from scratch. The inconsistency lied ultimately in that all bilocal hiddenvariable (BHV) models (including those exploiting arbitrary hidden communication) were naively regarded as incompatible with genuinely multipartite nonlocality. This led to a redefinition of the latter, according to which the conflicting BHV models are allocated a subtle form of genuinely multipartite nonlocality, which is exposed -as opposed to created -by the local operations. However, such effect has been neither experimentally confirmed nor theoretically explored for other variants of quantum nonlocality, including the celebrated steering of Schrödinger, Einstein, Podolsky, and Rosen. Here we study both Bell nonlocality and steering exposures as resource-theoretic transformations. We devise protocols that, remarkably, are able to reveal, in seemingly unsteerable systems, not only subtle steering (exposure), but also Bell nonlocality (super-exposure). Surprisingly, one of the protocols produces any set of quantum correlations via a local operation on classical ones admitting a BHV model. To reestablish soundness, we present an operationally consistent redefinition of multipartite steering. Finally, we implement one of the protocols with three photonic qubits deterministically, providing the first experimental demonstration of both exposure and super-exposure of quantum nonlocality. Our findings have fundamental and applied implications for future quantum networks.

show abstract

“…Consequently, the natural choice of the feedback law would be one that replicates the dynamics of Eq. (26). By the mere correspondence of the quantities, this would translate to Ṙ(θ) ∝ n in .…”

Section: F Quantum Reservoir Computingmentioning

confidence: 99%

“…These structures have proven very effective in many relevant tasks, such as speech recognition [21] or image classification [22] and nowadays form the core of the most advanced artificial intelligence algorithms [23]. The second is quantum computation, which harnesses uniquely quantum features such as superposition and entanglement [1] to provide dramatic advantages for classically intractable problems [4,5,24], and enhanced data security for networks and data clouds [25][26][27].…”

Section: Introductionmentioning

confidence: 99%

Experimental quantum memristor

Spagnolo,

Morris,

Piacentini

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

Quantum computer technology harnesses the features of quantum physics for revolutionizing information processing and computing [1]. As such, quantum computers use physical quantum gates that process information unitarily, even though the final computing steps might be measurement-based or non-unitary [2,3]. The applications of quantum computers cover diverse areas, reaching from well-known quantum algorithms [4,5] to quantum machine learning [6,7] and quantum neural networks [8]. The last of these is of particular interest by belonging to the promising field of artificial intelligence. However, quantum neural networks are technologically challenging as the underlying computation requires non-unitary operations for mimicking the behavior of neurons [9]. A landmark development for classical neural networks was the realization of memory-resistors, or "memristors" [10,11]. These are passive circuit elements that keep a memory of their past states in the form of a resistive hysteresis and thus provide access to nonlinear gate operations. The quest for realising a quantum memristor led to a few proposals [12][13][14], all of which face limited technological practicality. Here we introduce and experimentally demonstrate a novel quantum-optical memristor that is based on integrated photonics and acts on single photons. We characterize its memristive behavior and underline the practical potential of our device by numerically simulating instances of quantum reservoir computing [15][16][17], where we predict an advantage in the use of our quantum memristor over classical architectures. Given recent progress in the realization of photonic circuits for neural networks applications [8,18,19], our device could become a building block of immediate and near-term quantum neuromorphic architectures.

show abstract

Quantum advantage for probabilistic one-time programs

Cited by 24 publications

References 32 publications

Accessing inaccessible information via quantum indistinguishability

Accessing inaccessible information via quantum indistinguishability

Exposure of subtle multipartite quantum nonlocality

Experimental quantum memristor

Contact Info

Product

Resources

About