English
Related papers

Related papers: Bicategorical Semantics for Nondeterministic Compu…

200 papers

Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of…

Quantum Physics · Physics 2024-04-23 Teiko Heinosaari , Oskari Kerppo , Leevi Leppäjärvi , Martin Plávala

Quantum mechanics allows operations to be in indefinite causal order. Recently there have been active discussions on enhanced communication strategies through exotic causal structures. In light of this, through the process matrix formalism,…

Quantum Physics · Physics 2021-04-21 Kaumudibikash Goswami , Fabio Costa

We design a quantum method for classical information compression that exploits the hidden subgroup quantum algorithm. We consider sequence data in a database with a priori unknown symmetries of the hidden subgroup type. We prove that data…

Quantum Physics · Physics 2024-08-14 Feiyang Liu , Kaiming Bian , Fei Meng , Wen Zhang , Oscar Dahlsten

A unitary interaction coupling two parties enables quantum communication in both the forward and backward directions. Each communication capacity can be thought of as a tradeoff between the achievable rates of specific types of forward and…

Quantum Physics · Physics 2007-05-23 Aram W. Harrow , Debbie W. Leung

We prove a regularized formula for the secret key-assisted capacity region of a quantum channel for transmitting private classical information. This result parallels the work of Devetak on entanglement assisted quantum communication…

Quantum Physics · Physics 2010-02-11 Min-Hsiu Hsieh , Zhicheng Luo , Todd Brun

A natural operational paradigm for distributed quantum and classical information processing involves local operations coordinated by multiple rounds of public communication. In this paper we consider the minimum number of communication…

Quantum Physics · Physics 2018-02-07 Eric Chitambar , Min-Hsiu Hsieh

We present a general technique for hiding a classical bit in multipartite quantum states. The hidden bit, encoded in the choice of one of two possible density operators, cannot be recovered by local operations and classical communication…

Quantum Physics · Physics 2009-11-07 T. Eggeling , R. F. Werner

Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components, as well as communications between these components. Moreover, to model concurrent and…

Quantum Physics · Physics 2007-05-23 Marie Lalire

Non-additivity is one of the distinctive traits of Quantum Information Theory: the combined use of quantum objects may be more advantageous than the sum of their individual uses. Non-additivity effects have been proven, for example, for…

Quantum Physics · Physics 2012-03-08 Giuseppe Prettico , Antonio Acin

We give an example of a wide class of problems for which quantum information protocols based on multi-system entanglement can be mapped into much simpler ones involving one system. Secret sharing is a cryptographic primitive which plays a…

Quantum Physics · Physics 2016-03-09 Armin Tavakoli , Isabelle Herbauts , Marek Zukowski , Mohamed Bourennane

Over decades quantum cryptography has been intensively studied for unconditionally secured data transmission in a quantum regime. Due to the quantum loopholes caused by imperfect single photon detectors and/or lossy quantum channels,…

Quantum Physics · Physics 2019-10-08 Byoung S. Ham

We propose a definition for the information theoretic security of a quantum public-key encryption scheme, and present bit-oriented and two-bit-oriented encryption schemes satisfying our security definition via the introduction of a new…

Quantum Physics · Physics 2015-03-17 Jiangyou Pan , Li Yang

Catch 22 of cryptography - "Before two parties can communicate in secret, they must first communicate in secret". The weakness of classical cryptographic communication systems is that secret communication can only take place after a key is…

Cryptography and Security · Computer Science 2010-06-29 Catalin Anghel

We develop semantics and syntax for bicategorical type theory. Bicategorical type theory features contexts, types, terms, and directed reductions between terms. This type theory is naturally interpreted in a class of structured…

Logic in Computer Science · Computer Science 2023-10-13 Benedikt Ahrens , Paige Randall North , Niels van der Weide

In the classical setting, public-key encryption requires randomness in order to be secure against a forward search attack, whereby an adversary compares the encryption of a guess of the secret message with that of the actual secret message.…

Quantum Physics · Physics 2009-05-05 Georgios M. Nikolopoulos , Lawrence M. Ioannou

Entanglement is a fundamental resource for quantum information processing. In its pure form, it allows quantum teleportation and sharing classical secrets. Realistic quantum states are noisy and their usefulness is only partially…

Quantum Physics · Physics 2014-04-15 Maris Ozols , Graeme Smith , John A. Smolin

In this work we introduce a novel QKD protocol capable of smoothly transitioning, via user-tuneable parameter, from classical to semi-quantum in order to help understand the effect of quantum communication resources on secure key…

Quantum Physics · Physics 2019-01-08 Allison Gagliano , Walter O. Krawec , Hasan Iqbal

By analogy to classical cryptography, we develop a "quantum public key" based cryptographic scheme in which the two public and private keys consist in each of two entangled beams of squeezed light. An analog message is encrypted by…

Quantum Physics · Physics 2007-05-23 Patrick Navez , Alessandra Gatti , Luigi A. Lugiato

Quantum theory has found a new field of applications in the realm of information and computation during the recent years. This paper reviews how quantum physics allows information coding in classically unexpected and subtle nonlocal ways,…

Quantum Physics · Physics 2008-11-26 A. Galindo , M. A. Martin-Delgado

We study nondeterministic quantum algorithms for Boolean functions f. Such algorithms have positive acceptance probability on input x iff f(x)=1. In the setting of query complexity, we show that the nondeterministic quantum complexity of a…

Computational Complexity · Computer Science 2007-05-23 Ronald de Wolf