D. B. Horoshko, S. Ya. Kilin
We perform a comparison of two protocols for generating a cryptographic key composed from d-valued symbols: one exploiting a string of independent qubits and another one utilizing d-level systems prepared in states belonging to d+1 mutually unbiased bases. We show that the protocol based on qubits is optimal for quantum cryptography, since it provides higher security and higher key generation rate.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We study optimal eavesdropping in quantum cryptography with three-dimensional systems, and show that this scheme is more secure than protocols using two-dimensional states. We generalize the according eavesdropping transformation to arbitrary dimensions, and discuss the connection with optimal quantum cloning.
A setup for discriminating between arbitrary two coherent states of a single light mode with the highest success rate allowed by quantum mechanics is presented. Its application to time-multiplexed quantum key distribution is discussed.
We find a resonance behavior in the disturbance when an eavesdropper chooses a near-optimal strategy intentionally or unintentionally when the usual Bennett-Brassard cryptographic scheme is performed between two trusted parties. This phenomenon tends to disappear when eavesdropping strategy moves far from the optimal one. Therefore, we conjecture that this resonant effect is a characteristic for the eavesdropping strategy near to optimal one. We argue that this effect makes the quantum cryptography more secure against the eavesdropper's attack.
We analyze the asymptotic security of the family of Gaussian modulated Quantum Key Distribution protocols for Continuous Variables systems. We prove that the Gaussian unitary attack is optimal for all the considered bounds on the key rate when the first and second momenta of the canonical variables involved are known by the honest parties.
It is shown that the optimum strategy of the eavesdropper, as described in the preceding paper, can be expressed in terms of a quantum circuit in a way which makes it obvious why certain parameters take on particular values, and why obtaining information in one basis gives rise to noise in the conjugate basis.
A generalization of the quantum cryptographic protocol by Bennett and Brassard is discussed, using three conjugate bases, i.e. six states. By calculating the optimal mutual information between sender and eavesdropper it is shown that this scheme is safer against eavesdropping on single qubits than the one based on two conjugate bases. We also address the question for a connection between the maximal classical correlation in a generalized Bell inequality and the intersection of mutual informations between sender/receiver and sender/eavesdropper.
We examine a situation that $n$ eavesdroppers attack the Bennett-Brassard cryptographic protocol via their own optimal and symmetric strategies. Information gain and mutual information with sender for each eavesdropper are explicitly derived. The receiver's error rate for the case of arbitrary $n$ eavesdroppers can be derived using a recursive relation. Although first eavesdropper can get mutual information without disturbance arising due to other eavesdroppers, subsequent eavesdropping generally increases the receiver's error rate. Other eavesdroppers cannot gain information on the input sign…
We consider the Bennett-Brassard cryptographic scheme, which uses two conjugate quantum bases. An eavesdropper who attempts to obtain information on qubits sent in one of the bases causes a disturbance to qubits sent in the other basis. We derive an upper bound to the accessible information in one basis, for a given error rate in the conjugate basis. Independently fixing the error rate in the conjugate bases, we show that both bounds can be attained simultaneously by an optimal eavesdropping probe, consisting of two qubits. The qubits' interaction and their subsequent measurement are described…
Intermediate states are known from intercept/resend eavesdropping in the BB84 quantum cryptographic protocol. But they also play fundamental roles in the optimal eavesdropping strategy on BB84 and in the CHSH inequality. We generalize the intermediate states to arbitrary dimension and consider intercept/resend eavesdropping, optimal eavesdropping on the generalized BB84 protocol and present a generalized CHSH inequality for two entangled quNits based on these states.
Fuchs et al. [Phys. Rev. A, 1997] suggested an optimal attack on the BB84 protocol, where the necessary and sufficient condition for optimality involves the joint Hilbert space of the sender and the attacker. In this work, we propose a refined optimality criteria involving the Hilbert space of the attacker only. It reveals that the optimal (non-zero) overlaps between the attackers post-interactions states must be equal and numerically same as the difference between the fidelity and the disturbance at the receiving end. That amount turns out to be same as the reduction (factor) in Bell violatio…
We find that the generally accepted security criteria are flawed for a whole class of protocols for quantum cryptography. This is so because a standard assumption of the security analysis, namely that the so-called square-root measurement is optimal for eavesdropping purposes, is not true in general. There are rather large parameter regimes in which the optimal measurement extracts substantially more information than the square-root measurement.
The optimal mean photon number (mu) for quantum cryptography is the average photon number per transmitted pulse that results in the highest delivery rate of distilled cryptographic key bits, given a specific system scenario and set of assumptions about Eve's capabilities. Although many experimental systems have employed a mean photon number (mu) of 0.1 in practice, several research teams have pointed out that this value is somewhat arbitrary. In fact, various optimal values for mu have been described in the literature. In this paper we offer a detailed analytic model for an experimental, fiber…
We analyze the security of the two-way continuous-variable quantum key distribution protocol in reverse reconciliation against general two-mode attacks, which represent all accessible attacks at fixed channel parameters. Rather than against one specific attack model, the expression of secret key rates of the two-way protocol are derived against all accessible attack models. It is found that there is an optimal two-mode attack to minimize the performance of the protocol in terms of both secret key rates and maximal transmission distances. We identify the optimal two-mode attack, give the specif…
High-dimensional encoding schemes have emerged as a novel way to perform quantum information tasks. For high dimensionality, temporal and transverse spatial modes of photons are the two paradigmatic degrees of freedom commonly used in such experiments. Nevertheless, general devices for multi-outcome measurements are still needed to take full advantage of the high-dimensional nature of encoding schemes. We propose a general full-field mode sorting scheme consisting only of up to two optimized phase elements based on evolutionary algorithms that allows for joint sorting of azimuthal and radial m…
A general framework of optimal eavesdropping on BB84 protocol was provided by Fuchs et al. [Phys. Rev. A, 1997]. An upper bound on mutual information was derived, which could be achieved by a specific type of interaction and the corresponding measurement. However, uniqueness of optimal interaction was posed as an unsolved problem there and it has remained open for almost two decades now. In this paper, we solve this open problem and establish the uniqueness of optimal interaction up to rotation. The specific choice of optimal interaction by Fuchs et al. is shown to be a special case of the for…
Lossy-and-Constrained Extended Non-Local Games with Applications to Quantum Cryptography
本文证明在考虑约束和损耗（由实验误差和量子通信损耗激发）时，扩展非局部博弈的SDP层级仍收敛于最优值，并应用于相对论比特承诺、量子密钥分发和量子位置验证，获得更紧的安全性证明。
We present strong attacks against quantum key distribution schemes which use quantum memories and quantum gates to attack directly the final key. We analyze a specific attack of this type, for which we find the density matrices available to the eavesdropper and the optimal information which can be extracted from them. We prove security against this attack and discuss security against any attack allowed by the rules of quantum mechanics.
An $n$-bit string is encoded as a sequence of non-orthogonal quantum states. The parity bit of that $n$-bit string is described by one of two density matrices, $ρ_0^{(n)}$ and $ρ_1^{(n)}$, both in a Hilbert space of dimension $2^n$. In order to derive the parity bit the receiver must distinguish between the two density matrices, e.g., in terms of optimal mutual information. In this paper we find the measurement which provides the optimal mutual information about the parity bit and calculate that information. We prove that this information decreases exponentially with the length of the string i…
We present the optimal collective attack on a Quantum Key Distribution (QKD) protocol in the "device-independent" security scenario, where no assumptions are made about the way the QKD devices work or on what quantum system they operate. Our main result is a tight bound on the Holevo information between one of the authorized parties and the eavesdropper, as a function of the amount of violation of a Bell-type inequality.
A general study of arbitrary finite-size coherent attacks against continuous-variable quantum cryptographic schemes is presented. It is shown that, if the size of the blocks that can be coherently attacked by an eavesdropper is fixed and much smaller than the key size, then the optimal attack for a given signal-to-noise ratio in the transmission line is an individual gaussian attack. Consequently, non-gaussian coherent attacks do not need to be considered in the security analysis of such quantum cryptosystems.
We describe a nuclear magnetic resonance (NMR) experiment which implements an efficient one-to-two qubit phase-covariant cloning machine(QPCCM). In the experiment we have achieved remarkably high fidelities of cloning, 0.848 and 0.844 respectively for the original and the blank qubit. This experimental value is close to the optimal theoretical value of 0.854. We have also demonstrated how to use our phase-covariant cloning machine for quantum simulations of bit by bit eavesdropping in the four-state quantum key distribution protocol.
We consider the two-way quantum cryptographic protocol with coherent states assuming direct reconciliation. A detailed security analysis is performed considering a two-mode coherent attack, that represents the residual eavesdropping once the parties have reduced the general attack by applying symmetric random permutations. In this context we provide a general analytical expression for the keyrate, discussing the impact of the residual two-mode correlations on the security of the scheme. In particular we identify the optimal eavesdropping against two-way quantum communication, which is given by…
The unconditional security of a quantum key distribution protocol is often defined in terms of the accessible information, that is, the maximum mutual information between the distributed key S and the outcome of an optimal measurement on the adversary's (quantum) system. We show that, even if this quantity is small, certain parts of the key S might still be completely insecure when S is used in applications, such as for one-time pad encryption. This flaw is due to a locking property of the accessible information: one additional (physical) bit of information might increase the accessible inform…
All incoherent as well as 2- and 3-qubit coherent eavesdropping strategies on the 6 state protocol of quantum cryptography are classified. For a disturbance of 1/6, the optimal incoherent eavesdropping strategy reduces to the universal quantum cloning machine. Coherent eavesdropping cannot increase Eve's Shannon information, neither on the entire string of bits, nor on the set of bits received undisturbed by Bob. However, coherent eavesdropping can increase as well Eve's Renyi information as her probability of guessing correctly all bits. The case that Eve delays the measurement of her probe u…
The impossibility of perfectly copying (or cloning) an arbitrary quantum state is one of the basic rules governing the physics of quantum systems. The processes that perform the optimal approximate cloning have been found in many cases. These "quantum cloning machines" are important tools for studying a wide variety of tasks, e.g. state estimation and eavesdropping on quantum cryptography. This paper provides a comprehensive review of quantum cloning machines (both for discrete-dimensional and for continuous-variable quantum systems); in addition, it presents the role of cloning in quantum cry…
Entangled quantum systems have properties that have fundamentally overthrown the classical worldview. Increasing the complexity of entangled states by expanding their dimensionality allows the implementation of novel fundamental tests of nature, and moreover also enables genuinely new protocols for quantum information processing. Here we present the creation of a (100x100)-dimensional entangled quantum system, using spatial modes of photons. For its verification we develop a novel nonlinear criterion which infers entanglement dimensionality of a global state by using only information about its…
Encoding information in quantum systems can offer surprising advantages but at the same time there are limitations that arise from the fact that measuring an observable may disturb the state of the quantum system. In our work, we provide an in-depth analysis of a simple question: What happens when we perform two measurements sequentially on the same quantum system? This question touches upon some fundamental properties of quantum mechanics, namely the uncertainty principle and the complementarity of quantum measurements. Our results have interesting consequences, for example they can provide a…
We consider a game in which two separate laboratories collaborate to prepare a quantum system and are then asked to guess the outcome of a measurement performed by a third party in a random basis on that system. Intuitively, by the uncertainty principle and the monogamy of entanglement, the probability that both players simultaneously succeed in guessing the outcome correctly is bounded. We are interested in the question of how the success probability scales when many such games are performed in parallel. We show that any strategy that maximizes the probability to win every game individually i…
The cloning of quantum variables with continuous spectra is investigated. We define a Gaussian 1-to-2 cloning machine, which copies equally well two conjugate variables such as position and momentum or the two quadrature components of a light mode. The resulting cloning fidelity for coherent states, namely $F=2/3$, is shown to be optimal. An asymmetric version of this Gaussian cloner is then used to assess the security of a continuous-variable quantum key distribution scheme that allows two remote parties to share a Gaussian key. The information versus disturbance tradeoff underlying this cont…
The application in cryptography of quantum algorithms for prime factorization fostered the interest in quantum computing. However, quantum computers, and particularly quantum annealers, can also be helpful to construct secure cryptographic keys. Indeed, finding robust Boolean functions for cryptography is an important problem in sequence ciphers, block ciphers, and hash functions, among others. Due to the super-exponential size $\mathcal{O}(2^{2^n})$ of the associated space, finding $n$-variable Boolean functions with global cryptographic constraints is computationally hard. This problem has a…
Learning low dimensional representation is a crucial issue for many machine learning tasks such as pattern recognition and image retrieval. In this article, we present a quantum algorithm and a quantum circuit to efficiently perform A-Optimal Projection for dimensionality reduction. Compared with the best-know classical algorithms, the quantum A-Optimal Projection (QAOP) algorithm shows an exponential speedup in both the original feature space dimension $n$ and the reduced feature space dimension $k$. We show that the space and time complexity of the QAOP circuit are $O\left[ {{{\log }_2}\left…
In this paper we discuss the Hidden Subgroup Problem (HSP) in relation to post-quantum group-based cryptography. We review the relationship between HSP and other computational problems discuss an optimal solution method, and review the known results about the quantum complexity of HSP. We also overview some platforms for group-based cryptosystems. Notably, efficient algorithms for solving HSP in such infinite group platforms are not yet known.
We discuss several methods for unambiguous state discrimination of N symmetric coherent states using linear optics and photodetectors. One type of measurements is shown to be optimal in the limit of small photon numbers for any N. For the special case of N=4 this measurement can be fruitfully used by the receiving end (Bob) in an implementation of the BB84 quantum key distribution protocol using faint laser pulses. In particular, if Bob detects only a single photon the procedure is equivalent to the standard measurement that he would have to perform in a single-photon implementation of BB84, i…
The goal of two-party cryptography is to enable two parties, Alice and Bob, to solve common tasks without the need for mutual trust. Examples of such tasks are private access to a database, and secure identification. Quantum communication enables security for all of these problems in the noisy-storage model by sending more signals than the adversary can store in a certain time frame. Here, we initiate the study of device-independent protocols for two-party cryptography in the noisy-storage model. Specifically, we present a relatively easy to implement protocol for a cryptographic building bloc…
High-rate and computationally-efficient seedless extractors for device-independent quantum cryptography
提出一种基于截断方法的无种子提取器新证明技术，以渐近消失的轮次比例估计协议参数，实现每单重态一个密钥比特的最优速率。
We consider two remote parties connected to a relay by two quantum channels. To generate a secret key, they transmit coherent states to the relay, where the states are subject to a continuous-variable (CV) Bell detection. We study the ideal case where Alice's channel is lossless, i.e., the relay is locally situated in her lab and the Bell detection is performed with unit efficiency. This configuration allows us to explore the optimal performances achievable by CV measurement-device-independent (MDI) quantum key distribution (QKD). This corresponds to the limit of a trusted local relay, where t…
Tomography of the two qubit density matrix shared by Alice and Bob is an essential ingredient for guaranteeing an acceptable margin of confidentiality during the establishment of a secure fresh key through the Quantum Key Distribution (QKD) scheme. We show how the Singapore protocol for key distribution is optimal from this point of view, due to the fact that it is based on so called SIC POVM qubit tomography which allows the most accurate full tomographic reconstruction of an unknown density matrix on the basis of a restricted set of experimental data. We illustrate with the help of experimen…
In practical quantum cryptography, the source sometimes produces multi-photon pulses, thus enabling the eavesdropper Eve to perform the powerful photon-number-splitting (PNS) attack. Recently, it was shown by Curty and Lutkenhaus [Phys. Rev. A 69, 042321 (2004)] that the PNS attack is not always the optimal attack when two photons are present: if errors are present in the correlations Alice-Bob and if Eve cannot modify Bob's detection efficiency, Eve gains a larger amount of information using another attack based on a 2->3 cloning machine. In this work, we extend this analysis to all distances…
Continuous time quantum walks provide an important framework for designing new algorithms and modelling quantum transport and state transfer problems. Often, the graph representing the structure of a problem contains certain symmetries that confine the dynamics to a smaller subspace of the full Hilbert space. In this work, we use invariant subspace methods, that can be computed systematically using Lanczos algorithm, to obtain the reduced set of states that encompass the dynamics of the problem at hand without the specific knowledge of underlying symmetries. First, we apply this method to obta…
Consecutive Measurement Tradeoffs in Quantum Cryptography
本文研究了量子密码学中连续测量对信息提取的影响，提出连续测量定理框架，改进了成功概率的界限，并为多种密码原语提供了更强的安全保证。
It was shown in [WST08] that cryptographic primitives can be implemented based on the assumption that quantum storage of qubits is noisy. In this work we analyze a protocol for the universal task of oblivious transfer that can be implemented using quantum-key-distribution (QKD) hardware in the practical setting where honest participants are unable to perform noise-free operations. We derive trade-offs between the amount of storage noise, the amount of noise in the operations performed by the honest participants and the security of oblivious transfer which are greatly improved compared to the r…
In a previous paper certain measurable criteria have been derived, that are sufficient to demonstrate the existence of Einstein-Podolsky-Rosen (EPR) correlations for measurements with continuous variable outcomes. Here it is shown how such EPR criteria, which do not demand perfect EPR correlations, can be used to prove the extent of security for continuous variable quantum cryptographic schemes (in analogy to that proposed by Ekert) where Alice and Bob hope to construct a secure sequence of values from measurements performed on continuous-variable EPR-correlated fields sent from a distant sour…
The quantum cloner machine maps an unknown arbitrary input qubit into two optimal clones and one optimal flipped qubit. By combining linear and non-linear optical methods we experimentally implement a scheme that, after the cloning transformation, restores the original input qubit in one of the output channels, by using local measurements, classical communication and feedforward. This significant teleportation-like method demonstrates how the information is preserved during the cloning process. The realization of the reversion process is expected to find useful applications in the field of mod…
In quantum cryptography the optimal eavesdropping strategy requires that the eavesdropper uses quantum memories in order to optimize her information. What happens if the eavesdropper has no quantum memory? It is shown that the best strategy is actually to adopt the simple intercept/resend strategy.
Dimensionality reduction (DR) algorithms, which reduce the dimensionality of a given data set while preserving the information of the original data set as well as possible, play an important role in machine learning and data mining. Duan \emph{et al}. proposed a quantum version of the A-optimal projection algorithm (AOP) for dimensionality reduction [Phys. Rev. A 99, 032311 (2019)] and claimed that the algorithm has exponential speedups on the dimensionality of the original feature space $n$ and the dimensionality of the reduced feature space $k$ over the classical algorithm. In this paper, we…
We identify the families of states that maximise some recently proposed quantifiers of Einstein-Podolsky-Rosen (EPR) steering and the volume of the Quantum Steering Ellipsoid (QSE). The optimal measurements which maximise genuine EPR steering measures are discussed and we develop a novel way to find them using the QSE. We thus explore the links between genuine EPR steering and the QSE and introduce states that can be the most useful for one-sided device-independent quantum cryptography for a given amount of noise.
Local simultaneous state discrimination
本研究提出量子态区分新变体局部同时态区分（LSSD），刻画其性质并证明三方经典LSSD最优策略求解为NP难。
Quantum cryptography harnesses quantum light, in particular single photons, to provide security guarantees that cannot be reached by classical means. For each cryptographic task, the security feature of interest is directly related to the photons' non-classical properties. Quantum dot-based single-photon sources are remarkable candidates, as they can in principle emit deterministically, with high brightness and low multiphoton contribution. Here, we show that these sources provide additional security benefits, thanks to the tunability of coherence in the emitted photon-number states. We identi…
Thermodynamic Limits of Quantum Search
研究探讨了量子搜索算法的热力学极限，推导出工作与运行时间的权衡关系，并通过定制量子协议验证了该下限的紧性，表明在暗能量主导的宇宙中，831位密钥无法在星系形成停止前被确定性恢复。
We consider the continuous-variable protocol of Pirandola et al. [Nature Photonics 9, 397-402 (2015), see also arXiv.1312.4104] where the secret-key is established by the measurement of an untrusted relay. In this network protocol, two authorized parties are connected to an untrusted relay by insecure quantum links. Secret correlations are generated by a continuous-variable Bell detection performed on incoming coherent states. In the present work we provide a detailed study of the symmetric configuration, where the relay is midway between the parties. We analyze symmetric eavesdropping strateg…
A quantum copying machine producing two (in general non-identical) copies of an arbitrary input state of a two-dimensional Hilbert space (qubit) is studied using a quality measure based on distinguishability of states, rather than fidelity. The problem of producing optimal copies is investigated with the help of a Bloch sphere representation, and shown to have a well-defined solution, including cases in which the two copies have unequal quality, or the quality depends upon the input state (is ``anisotropic'' in Bloch sphere language), or both. A simple quantum circuit yields the optimal copyin…
Absolute dimensionality of quantum ensembles
提出与基无关的量子系综绝对维度概念，开发解析见证和半定规划准则以确定绝对维度，构建受白噪声影响的纯态系综模拟模型，并探讨其在高维量子信息处理中的作用。
We report a scheme for generation of high-order vortex states using two-mode photon-number squeezed states, generated via the non-linear process of Spontaneous Parametric Down Conversion. By applying a parametric rotation in quadrature space $(X,Y)$, using a $ϕ$ converter, the Gaussian quadrature profile of the photon-number squeezed input state can be mapped into a superposition of Laguerre-Gauss modes with $N$ vortices or singularities, for an input state containing $N$ photons, thus mapping photon-number fluctuations to interference effects in quadrature space. Our scheme has the potential …
Unclonable Cryptography in Linear Quantum Memory
研究一次性签名等量子签名令牌，此前相关协议量子存储器需求大，本文开发新技术，显著减小量子密钥大小，在某些情况达渐近最优，为不可克隆密码学发展助力。
Optimal representation of quantum channels
本研究提出通过寻找半正定矩阵锥的基来降低量子信道矩阵表示的维数，并在Julia语言的QuantumInformation.jl包中实现了该方法。
We derive laws for the distribution of quantum steering among different parties in multipartite Gaussian states under Gaussian measurements. We prove that a monogamy relation akin to the generalized Coffman-Kundu-Wootters inequality holds quantitatively for a recently introduced measure of Gaussian steering. We then define the residual Gaussian steering, stemming from the monogamy inequality, as an indicator of collective steering-type correlations. For pure three-mode Gaussian states, the residual acts a quantifier of genuine multipartite steering, and is interpreted operationally in terms of…
Although many of works have been done in multivalued quantum logic synthesis, the question whether multivalued quantum circuits are more efficient than the conventional binary quantum circuits is still open. In this article we devote to the optimization of generic multivalued quantum circuits. The multivalued quantum Shannon decompositions (QSD) are improved so that the circuits obtained are asymptotically optimal for all dimensionality d. The syntheses of uniformly multifold controlled $R_y$ rotations are also optimized to make the circuits further simplified. Moreover, the theoretical lower …
Section headings: 1 Qubits, gates and networks 2 Quantum arithmetic and function evaluations 3 Algorithms and their complexity 4 From interferometers to computers 5 The first quantum algorithms 6 Quantum search 7 Optimal phase estimation 8 Periodicity and quantum factoring 9 Cryptography 10 Conditional quantum dynamics 11 Decoherence and recoherence 12 Concluding remarks
Coin dimensionality as a resource in quantum metrology involving discrete-time quantum walks
针对参数编码于离散时间量子行走者硬币自由度的计量问题，本文证明硬币维度可提升QFI，给出最优初态与仅测位置的精度边界，并比较类Grover编码与旋转编码。
Lower Bounds for Preprocessing Attacks on Quantum Cryptography
本文在随机预言机模型中证明了破解量子密码学的时间-空间下界接近最优，显示量子密码学在抵御预处理攻击方面优于经典密码学，并简化推广了现有方法。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。