相关论文: Squash Operator and Symmetry
We study the CHSH inequality for a system of two spin $j$ particles, for generic $j$. The CHSH operator is constructed using a set of unitary, Hermitian operators $\left\{ A_{1},A_{2},B_{1},B_{2}\right\} $. The expectation value of the CHSH…
Let $M$ be a closed, connected, orientable topological four-manifold with $H_1(M)$ nontrivial and free abelian, $b_2(M)\ne 0, 2$, and $\chi(M)\ne 0$. We show that if $G$ is a finite group of 2-rank $\le 1$ which admits a homologically…
A bounded linear operator $T$ on a Banach space $X$ is called hypercyclic if there exists a vector $x \in X$ such that $orb{(x,T)}$ is dense in $X$. The Hypercyclicity Criterion is a well-known sufficient condition for an operator to be…
We devise a simple modification that essentially doubles the efficiency of the BB84 quantum key distribution scheme proposed by Bennett and Brassard. We also prove the security of our modified scheme against the most general eavesdropping…
In this article I present a protocol for quantum cryptography which is secure against attacks on individual signals. It is based on the Bennett-Brassard protocol of 1984 (BB84). The security proof is complete as far as the use of single…
The security of quantum key distribution (QKD) has been proven for different protocols, in particular for the BB84 protocol. It has been shown that this scheme is robust against eventual imperfections in the state preparation, and sending…
The field of quantum computation currently lacks a formal proof of experimental feasibility. Qubits are fragile and sophisticated quantum error correction is required to achieve reliable quantum computation. The surface code is a promising…
The idealized Kish-Sethuraman (KS) cipher is theoretically known to offer perfect security through a classical information channel. However, realization of the protocol is hitherto an open problem, as the required mathematical operators…
We give a simple proof of the matrix Spencer conjecture up to poly-logarithmic rank: given symmetric $d \times d$ matrices $A_1,\ldots,A_n$ each with $\|A_i\|_{\mathsf{op}} \leq 1$ and rank at most $n/\log^3 n$, one can efficiently find…
Let $P(h),h\in]0,1]$ be a semiclassical scalar differential operator of order $2$. The existence of a supersymmetric structure given by a matrix $G(x;h)$ was exhibited in \cite{HeHiSj13} under rather general assumptions. In this note we…
We demonstrate that a necessary precondition for unconditionally secure quantum key distribution is that sender and receiver can use the available measurement results to prove the presence of entanglement in a quantum state that is…
Basic techniques to prove the unconditional security of quantum cryptography are described. They are applied to a quantum key distribution protocol proposed by Bennett and Brassard in 1984. The proof considers a practical variation on the…
We initiate a systematic study to provide upper bounds on device-independent key, secure against a non-signaling adversary (NSDI). We employ the idea of "squashing" on the secrecy monotones and show that squashed secrecy monotones are the…
Factorization of quantum mechanical Hamiltonians has been a useful technique for some time. This procedure has been given an elegant description by supersymmetric quantum mechanics, and the subject has become well-developed. We demonstrate…
A two-layer quantum protocol for secure transmission of data using qubits is presented. The protocol is an improvement over the BB84 QKD protocol. BB84, in conjunction with the one-time pad algorithm, has been shown to be unconditionally…
A group of $n$ agents with numerical preferences for each other are to be assigned to the $n$ seats of a dining table. We study two natural topologies:~circular (cycle) tables and panel (path) tables. For a given seating arrangement, an…
This thesis aims to establish notions of symmetry for quantum states and channels as well as describe algorithms to test for these properties on quantum computers. Ideally, the work will serve as a self-contained overview of the subject. We…
We present an extension of the first proof for the unconditional security of the BB84 quantum key distribution protocol which was given by Mayers. We remove the constraint that a perfect BB84 quantum source is required and the proof given…
We investigate two-way and one-way single-photon quantum key distribution (QKD) protocols in the presence of loss introduced by the quantum channel. Our analysis is based on a simple precondition for secure QKD in each case. In particular,…
We consider the three-dimensional stable matching problem with cyclic preferences, a problem originally proposed by Knuth. Despite extensive study of the problem by experts from different areas, the question of whether every instance of…