Position-based quantum cryptography over untrusted networks
NASA Astrophysics Data System (ADS)
Nadeem, Muhammad
2014-08-01
In this article, we propose quantum position verification (QPV) schemes where all the channels are untrusted except the position of the prover and distant reference stations of verifiers. We review and analyze the existing QPV schemes containing some pre-shared data between the prover and verifiers. Most of these schemes are based on non-cryptographic assumptions, i.e. quantum/classical channels between the verifiers are secure. It seems impractical in an environment fully controlled by adversaries and would lead to security compromise in practical implementations. However, our proposed formula for QPV is more robust, secure and according to the standard assumptions of cryptography. Furthermore, once the position of the prover is verified, our schemes establish secret keys in parallel and can be used for authentication and secret communication between the prover and verifiers.
Unconditionally secure commitment in position-based quantum cryptography
Nadeem, Muhammad
2014-01-01
A new commitment scheme based on position-verification and non-local quantum correlations is presented here for the first time in literature. The only credential for unconditional security is the position of committer and non-local correlations generated; neither receiver has any pre-shared data with the committer nor does receiver require trusted and authenticated quantum/classical channels between him and the committer. In the proposed scheme, receiver trusts the commitment only if the scheme itself verifies position of the committer and validates her commitment through non-local quantum correlations in a single round. The position-based commitment scheme bounds committer to reveal valid commitment within allocated time and guarantees that the receiver will not be able to get information about commitment unless committer reveals. The scheme works for the commitment of both bits and qubits and is equally secure against committer/receiver as well as against any third party who may have interests in destroying the commitment. Our proposed scheme is unconditionally secure in general and evades Mayers and Lo-Chau attacks in particular. PMID:25346509
Insecurity of position-based quantum-cryptography protocols against entanglement attacks
NASA Astrophysics Data System (ADS)
Lau, Hoi-Kwan; Lo, Hoi-Kwong
2011-01-01
Recently, position-based quantum cryptography has been claimed to be unconditionally secure. On the contrary, here we show that the existing proposals for position-based quantum cryptography are, in fact, insecure if entanglement is shared among two adversaries. Specifically, we demonstrate how the adversaries can incorporate ideas of quantum teleportation and quantum secret sharing to compromise the security with certainty. The common flaw to all current protocols is that the Pauli operators always map a codeword to a codeword (up to an irrelevant overall phase). We propose a modified scheme lacking this property in which the same cheating strategy used to undermine the previous protocols can succeed with a rate of at most 85%. We prove the modified protocol is secure when the shared quantum resource between the adversaries is a two- or three-level system.
Insecurity of position-based quantum-cryptography protocols against entanglement attacks
Lau, Hoi-Kwan; Lo, Hoi-Kwong
2011-01-15
Recently, position-based quantum cryptography has been claimed to be unconditionally secure. On the contrary, here we show that the existing proposals for position-based quantum cryptography are, in fact, insecure if entanglement is shared among two adversaries. Specifically, we demonstrate how the adversaries can incorporate ideas of quantum teleportation and quantum secret sharing to compromise the security with certainty. The common flaw to all current protocols is that the Pauli operators always map a codeword to a codeword (up to an irrelevant overall phase). We propose a modified scheme lacking this property in which the same cheating strategy used to undermine the previous protocols can succeed with a rate of at most 85%. We prove the modified protocol is secure when the shared quantum resource between the adversaries is a two- or three-level system.
Quantum Computational Cryptography
NASA Astrophysics Data System (ADS)
Kawachi, Akinori; Koshiba, Takeshi
As computational approaches to classical cryptography have succeeded in the establishment of the foundation of the network security, computational approaches even to quantum cryptography are promising, since quantum computational cryptography could offer richer applications than the quantum key distribution. Our project focused especially on the quantum one-wayness and quantum public-key cryptosystems. The one-wayness of functions (or permutations) is one of the most important notions in computational cryptography. First, we give an algorithmic characterization of quantum one-way permutations. In other words, we show a necessary and sufficient condition for quantum one-way permutations in terms of reflection operators. Second, we introduce a problem of distinguishing between two quantum states as a new underlying problem that is harder to solve than the graph automorphism problem. The new problem is a natural generalization of the distinguishability problem between two probability distributions, which are commonly used in computational cryptography. We show that the problem has several cryptographic properties and they enable us to construct a quantum publickey cryptosystem, which is likely to withstand any attack of a quantum adversary.
Counterfactual quantum cryptography.
Noh, Tae-Gon
2009-12-04
Quantum cryptography allows one to distribute a secret key between two remote parties using the fundamental principles of quantum mechanics. The well-known established paradigm for the quantum key distribution relies on the actual transmission of signal particle through a quantum channel. In this Letter, we show that the task of a secret key distribution can be accomplished even though a particle carrying secret information is not in fact transmitted through the quantum channel. The proposed protocols can be implemented with current technologies and provide practical security advantages by eliminating the possibility that an eavesdropper can directly access the entire quantum system of each signal particle.
Introduction to optical quantum cryptography
NASA Astrophysics Data System (ADS)
Adamski, Tomasz
2008-01-01
In recent years very fast progress in the domain of Optical Quantum Cryptography is observed both in theoretical and practical aspects. The paper is a short tutorial review of basic concepts of Optical Quantum Cryptography (OQC) and Quantum Key Distribution (QKD).
Composability in quantum cryptography
NASA Astrophysics Data System (ADS)
Müller-Quade, Jörn; Renner, Renato
2009-08-01
If we combine two secure cryptographic systems, is the resulting system still secure? Answering this question is highly nontrivial and has recently sparked a considerable research effort, in particular, in the area of classical cryptography. A central insight was that the answer to the question is yes, but only within a well-specified composability framework and for carefully chosen security definitions. In this article, we review several aspects of composability in the context of quantum cryptography. The first part is devoted to key distribution. We discuss the security criteria that a quantum key distribution (QKD) protocol must fulfill to allow its safe use within a larger security application (e.g. for secure message transmission); and we demonstrate—by an explicit example—what can go wrong if conventional (non-composable) security definitions are used. Finally, to illustrate the practical use of composability, we show how to generate a continuous key stream by sequentially composing rounds of a QKD protocol. In the second part, we take a more general point of view, which is necessary for the study of cryptographic situations involving, for example, mutually distrustful parties. We explain the universal composability (UC) framework and state the composition theorem that guarantees that secure protocols can securely be composed to larger applications. We focus on the secure composition of quantum protocols into unconditionally secure classical protocols. However, the resulting security definition is so strict that some tasks become impossible without additional security assumptions. Quantum bit commitment is impossible in the UC framework even with mere computational security. Similar problems arise in the quantum bounded storage model and we observe a trade-off between the UC and the use of the weakest possible security assumptions.
Relativistic quantum cryptography
Molotkov, S. N.
2011-03-15
A new protocol of quantum key distribution is proposed to transmit keys through free space. Along with quantum-mechanical restrictions on the discernibility of nonorthogonal quantum states, the protocol uses additional restrictions imposed by special relativity theory. Unlike all existing quantum key distribution protocols, this protocol ensures key secrecy for a not strictly one-photon source of quantum states and an arbitrary length of a quantum communication channel.
Secure communications using quantum cryptography
Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.
1997-08-01
The secure distribution of the secret random bit sequences known as {open_quotes}key{close_quotes} material, is an essential precursor to their use for the encryption and decryption of confidential communications. Quantum cryptography is an emerging technology for secure key distribution with single-photon transmissions, nor evade detection (eavesdropping raises the key error rate above a threshold value). We have developed experimental quantum cryptography systems based on the transmission of non-orthogonal single-photon states to generate shared key material over multi-kilometer optical fiber paths and over line-of-sight links. In both cases, key material is built up using the transmission of a single-photon per bit of an initial secret random sequence. A quantum-mechanically random subset of this sequence is identified, becoming the key material after a data reconciliation stage with the sender. In our optical fiber experiment we have performed quantum key distribution over 24-km of underground optical fiber using single-photon interference states, demonstrating that secure, real-time key generation over {open_quotes}open{close_quotes} multi-km node-to-node optical fiber communications links is possible. We have also constructed a quantum key distribution system for free-space, line-of-sight transmission using single-photon polarization states, which is currently undergoing laboratory testing. 7 figs.
Quantum cryptography without switching.
Weedbrook, Christian; Lance, Andrew M; Bowen, Warwick P; Symul, Thomas; Ralph, Timothy C; Lam, Ping Koy
2004-10-22
We propose a new coherent state quantum key distribution protocol that eliminates the need to randomly switch between measurement bases. This protocol provides significantly higher secret key rates with increased bandwidths than previous schemes that only make single quadrature measurements. It also offers the further advantage of simplicity compared to all previous protocols which, to date, have relied on switching.
Cryptography, quantum computation and trapped ions
Hughes, Richard J.
1998-03-01
The significance of quantum computation for cryptography is discussed. Following a brief survey of the requirements for quantum computational hardware, an overview of the ion trap quantum computation project at Los Alamos is presented. The physical limitations to quantum computation with trapped ions are analyzed and an assessment of the computational potential of the technology is made.
Link-layer vulnerabilities of quantum cryptography
NASA Astrophysics Data System (ADS)
Kartalopoulos, Stamatios V.
2005-09-01
The last two decades have witnessed an exciting advanced research field that stems from non-classical atomic theory, quantum mechanics. This field promises an important applicability in secure data communications, known as quantum cryptography. Quantum cryptography takes advantage of the inherent random polarization state of single photons, which is not reproducible by a third party or an eavesdropper located between the source and the destination. Thus, when polarization states of photons are associated with binary logic an algorithm may intelligently developed according to which a cryptographic key is disseminated by the source terminal to the destination. This is a process known as quantum key distribution. However, as photons propagate in a non-linear medium such as fiber, their polarization state does not remain intact and thus the quantum key distribution and quantum cryptography becomes vulnerable to attacks. In this paper we consider the applicability of quantum cryptography in a pragmatic fiber-optic medium and in a popular communication network topology. We identify major weaknesses for each step of the quantum key distribution process, and also potential attacks to incapacitate quantum cryptography in fiber communications, so that better countermeasure strategies can be developed.
Quantum cryptography over underground optical fibers
Hughes, R.J.; Luther, G.G.; Morgan, G.L.; Peterson, C.G.; Simmons, C.
1996-05-01
Quantum cryptography is an emerging technology in which two parties may simultaneously generated shared, secret cryptographic key material using the transmission of quantum states of light whose security is based on the inviolability of the laws of quantum mechanics. An adversary can neither successfully tap the key transmissions, nor evade detection, owing to Heisenberg`s uncertainty principle. In this paper the authors describe the theory of quantum cryptography, and the most recent results from their experimental system with which they are generating key material over 14-km of underground optical fiber. These results show that optical-fiber based quantum cryptography could allow secure, real-time key generation over ``open`` multi-km node-to-node optical fiber communications links between secure ``islands.``
Quantum asymmetric cryptography with symmetric keys
NASA Astrophysics Data System (ADS)
Gao, Fei; Wen, Qiaoyan; Qin, Sujuan; Zhu, Fuchen
2009-12-01
Based on quantum encryption, we present a new idea for quantum public-key cryptography (QPKC) and construct a whole theoretical framework of a QPKC system. We show that the quantum-mechanical nature renders it feasible and reasonable to use symmetric keys in such a scheme, which is quite different from that in conventional public-key cryptography. The security of our scheme is analyzed and some features are discussed. Furthermore, the state-estimation attack to a prior QPKC scheme is demonstrated.
Counterfactual quantum cryptography network with untrusted relay
NASA Astrophysics Data System (ADS)
Chen, Yuanyuan; Gu, Xuemei; Jiang, Dong; Xie, Ling; Chen, Lijun
2015-07-01
Counterfactual quantum cryptography allows two remote parties to share a secret key even though a physical particle is not in fact transmitted through the quantum channel. In order to extend the scope of counterfactual quantum cryptography, we use an untrusted relay to construct a multi-user network. The implementation issues are discussed to show that the scheme can be realized with current technologies. We also prove the practical security advantages of the scheme by eliminating the probability that an eavesdropper can directly access the signal or an untrusted relay can perform false operations.
Partially Blind Signatures Based on Quantum Cryptography
NASA Astrophysics Data System (ADS)
Cai, Xiao-Qiu; Niu, Hui-Fang
2012-12-01
In a partially blind signature scheme, the signer explicitly includes pre-agreed common information in the blind signature, which can improve the availability and performance. We present a new partially blind signature scheme based on fundamental properties of quantum mechanics. In addition, we analyze the security of this scheme, and show it is not possible to forge valid partially blind signatures. Moreover, the comparisons between this scheme and those based on public-key cryptography are also discussed.
Spectral coherent-state quantum cryptography.
Cincotti, Gabriella; Spiekman, Leo; Wada, Naoya; Kitayama, Ken-ichi
2008-11-01
A novel implementation of quantum-noise optical cryptography is proposed, which is based on a simplified architecture that allows long-haul, high-speed transmission in a fiber optical network. By using a single multiport encoder/decoder and 16 phase shifters, this new approach can provide the same confidentiality as other implementations of Yuen's encryption protocol, which use a larger number of phase or polarization coherent states. Data confidentiality and error probability for authorized and unauthorized receivers are carefully analyzed.
Quantum discord as a resource for quantum cryptography
Pirandola, Stefano
2014-01-01
Quantum discord is the minimal bipartite resource which is needed for a secure quantum key distribution, being a cryptographic primitive equivalent to non-orthogonality. Its role becomes crucial in device-dependent quantum cryptography, where the presence of preparation and detection noise (inaccessible to all parties) may be so strong to prevent the distribution and distillation of entanglement. The necessity of entanglement is re-affirmed in the stronger scenario of device-independent quantum cryptography, where all sources of noise are ascribed to the eavesdropper. PMID:25378231
FREE-SPACE QUANTUM CRYPTOGRAPHY IN DAYLIGHT
Hughes, R.J.; Buttler, W.T.
2000-01-01
Quantum cryptography is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light. The security of these transmissions is based on the inviolability of the laws of quantum mechanics and information-theoretically secure post-processing methods. An adversary can neither successfully tap the quantum transmissions, nor evade detection, owing to Heisenberg's uncertainty principle. In this paper we describe the theory of quantum cryptography, and the most recent results from our experimental free-space system with which we have demonstrated for the first time the feasibility of quantum key generation over a point-to-point outdoor atmospheric path in daylight. We achieved a transmission distance of 0.5 km, which was limited only by the length of the test range. Our results provide strong evidence that cryptographic key material could be generated on demand between a ground station and a satellite (or between two satellites), allowing a satellite to be securely re-keyed on orbit. We present a feasibility analysis of surface-to-satellite quantum key generation.
Entanglement-Based Quantum Cryptography and Quantum Communication
NASA Astrophysics Data System (ADS)
Zeilinger, Anton
2007-03-01
Quantum entanglement, to Erwin Schroedinger the essential feature of quantum mechanics, has become a central resource in various quantum communication protocols including quantum cryptography and quantum teleportation. From a fundamental point of view what is exploited in these experiments is the very fact which led Schroedinger to his statement namely that in entangled states joint properties of the entangled systems may be well defined while the individual subsystems may carry no information at all. In entanglement-based quantum cryptography it leads to the most elegant possible solution of the classic key distribution problem. It implies that the key comes into existence at spatially distant location at the same time and does not need to be transported. A number recent developments include for example highly efficient, robust and stable sources of entangled photons with a broad bandwidth of desired features. Also, entanglement-based quantum cryptography is successfully joining other methods in the work towards demonstrating quantum key distribution networks. Along that line recently decoy-state quantum cryptography over a distance of 144 km between two Canary Islands was demonstrated successfully. Such experiments also open up the possibility of quantum communication on a really large scale using LEO satellites. Another important possible future branch of quantum communication involves quantum repeaters in order to cover larger distances with entangled states. Recently the connection of two fully independent lasers in an entanglement swapping experiment did demonstrate that the timing control of such systems on a femtosecond time scale is possible. A related development includes recent demonstrations of all-optical one-way quantum computation schemes with the extremely short cycle time of only 100 nanoseconds.
Security of counterfactual quantum cryptography
Yin Zhenqiang; Li Hongwei; Chen Wei; Han Zhengfu; Guo Guangcan
2010-10-15
Recently, a 'counterfactual' quantum-key-distribution scheme was proposed by T.-G. Noh [Phys. Rev. Lett. 103, 230501 (2009)]. In this scheme, two legitimate distant peers may share secret keys even when the information carriers are not traveled in the quantum channel. We find that this protocol is equivalent to an entanglement distillation protocol. According to this equivalence, a strict security proof and the asymptotic key bit rate are both obtained when a perfect single-photon source is applied and a Trojan horse attack can be detected. We also find that the security of this scheme is strongly related to not only the bit error rate but also the yields of photons. And our security proof may shed light on the security of other two-way protocols.
Quantum teleportation for keyless cryptography
NASA Astrophysics Data System (ADS)
Parakh, Abhishek
2015-05-01
This paper looks at using quantum teleportation for secure message exchange. Although the proposed protocol has parallels with Ekert's protocol for key distribution, we look at the issue of directly teleporting message bits instead of encryption keys. Further, it is the first protocol of it's type where the role of the sender and receiver are flipped around. In other words, unlike traditional protocols, in the proposed protocol the receiver first performs certain measurements thus implicitly determining a stream of bits that she combines with the bit stream received from the sender to determine the secret message. There are no qubits wasted in random measurements.
Free-space quantum cryptography
Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.; Lamoreaux, S.K.; Morgan, G.L.; Nordholt, J.E.; Peterson, C.G.
1998-12-31
An experimental free-space quantum key distribution (QKD) system has been tested over an outdoor optical path of {approximately}1 km under nighttime conditions at Los Alamos National Laboratory. This system employs the Bennett 92 protocol; here the authors give a brief overview of this protocol, and describe the experimental implementation of it. An analysis of the system efficiency is presented, as well as a description of the error detection protocol, which employs a two-dimensional parity check scheme. Finally, the susceptibility of this system to eavesdropping by various techniques is determined. Possible applications include the rekeying of satellites in low earth orbit.
High Data Rate Quantum Cryptography
NASA Astrophysics Data System (ADS)
Kwiat, Paul; Christensen, Bradley; McCusker, Kevin; Kumor, Daniel; Gauthier, Daniel
2015-05-01
While quantum key distribution (QKD) systems are now commercially available, the data rate is a limiting factor for some desired applications (e.g., secure video transmission). Most QKD systems receive at most a single random bit per detection event, causing the data rate to be limited by the saturation of the single-photon detectors. Recent experiments have begun to explore using larger degree of freedoms, i.e., temporal or spatial qubits, to optimize the data rate. Here, we continue this exploration using entanglement in multiple degrees of freedom. That is, we use simultaneous temporal and polarization entanglement to reach up to 8.3 bits of randomness per coincident detection. Due to current technology, we are unable to fully secure the temporal degree of freedom against all possible future attacks; however, by assuming a technologically-limited eavesdropper, we are able to obtain 23.4 MB/s secure key rate across an optical table, after error reconciliation and privacy amplification. In this talk, we will describe our high-rate QKD experiment, with a short discussion on our work towards extending this system to ship-to-ship and ship-to-shore communication, aiming to secure the temporal degree of freedom and to implement a 30-km free-space link over a marine environment.
Twenty Seven Years of Quantum Cryptography!
NASA Astrophysics Data System (ADS)
Hughes, Richard
2011-03-01
One of the fundamental goals of cryptographic research is to minimize the assumptions underlying the protocols that enable secure communications between pairs or groups of users. In 1984, building on earlier research by Stephen Wiesner, Charles Bennett and Gilles Brassard showed how quantum physics could be harnessed to provide information-theoretic security for protocols such as the distribution of cryptographic keys, which enables two parties to secure their conventional communications. Bennett and Brassard and colleagues performed a proof-of-principle quantum key distribution (QKD) experiment with single-photon quantum state transmission over a 32-cm air path in 1991. This seminal experiment led other researchers to explore QKD in optical fibers and over line-of-sight outdoor atmospheric paths (``free-space''), resulting in dramatic increases in range, bit rate and security. These advances have been enabled by improvements in sources and single-photon detectors. Also in 1991 Artur Ekert showed how the security of QKD could be related to quantum entanglement. This insight led to a deeper understanding and proof of QKD security with practical sources and detectors in the presence of transmission loss and channel noise. Today, QKD has been implemented over ranges much greater than 100km in both fiber and free-space, multi-node network testbeds have been demonstrated, and satellite-based QKD is under study in several countries. ``Quantum hacking'' researchers have shown the importance of extending security considerations to the classical devices that produce and detect the photon quantum states. New quantum cryptographic protocols such as secure identification have been proposed, and others such as quantum secret splitting have been demonstrated. It is now possible to envision quantum cryptography providing a more secure alternative to present-day cryptographic methods for many secure communications functions. My talk will survey these remarkable developments.
PREFACE: Quantum Information, Communication, Computation and Cryptography
NASA Astrophysics Data System (ADS)
Benatti, F.; Fannes, M.; Floreanini, R.; Petritis, D.
2007-07-01
The application of quantum mechanics to information related fields such as communication, computation and cryptography is a fast growing line of research that has been witnessing an outburst of theoretical and experimental results, with possible practical applications. On the one hand, quantum cryptography with its impact on secrecy of transmission is having its first important actual implementations; on the other hand, the recent advances in quantum optics, ion trapping, BEC manipulation, spin and quantum dot technologies allow us to put to direct test a great deal of theoretical ideas and results. These achievements have stimulated a reborn interest in various aspects of quantum mechanics, creating a unique interplay between physics, both theoretical and experimental, mathematics, information theory and computer science. In view of all these developments, it appeared timely to organize a meeting where graduate students and young researchers could be exposed to the fundamentals of the theory, while senior experts could exchange their latest results. The activity was structured as a school followed by a workshop, and took place at The Abdus Salam International Center for Theoretical Physics (ICTP) and The International School for Advanced Studies (SISSA) in Trieste, Italy, from 12-23 June 2006. The meeting was part of the activity of the Joint European Master Curriculum Development Programme in Quantum Information, Communication, Cryptography and Computation, involving the Universities of Cergy-Pontoise (France), Chania (Greece), Leuven (Belgium), Rennes1 (France) and Trieste (Italy). This special issue of Journal of Physics A: Mathematical and Theoretical collects 22 contributions from well known experts who took part in the workshop. They summarize the present day status of the research in the manifold aspects of quantum information. The issue is opened by two review articles, the first by G Adesso and F Illuminati discussing entanglement in continuous variable
Strong connections between quantum encodings, nonlocality, and quantum cryptography
NASA Astrophysics Data System (ADS)
Sikora, Jamie; Chailloux, André; Kerenidis, Iordanis
2014-02-01
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 simple proof of the optimal quantum strategy in the famous Clauser-Horne-Shimony-Holt game. Moreover, we show that the way information is encoded in quantum systems can provide a different perspective in understanding other fundamental aspects of quantum information, like nonlocality and quantum cryptography. We prove some strong equivalences between these notions and provide a number of applications in all areas.
On the complexity of search for keys in quantum cryptography
NASA Astrophysics Data System (ADS)
Molotkov, S. N.
2016-03-01
The trace distance is used as a security criterion in proofs of security of keys in quantum cryptography. Some authors doubted that this criterion can be reduced to criteria used in classical cryptography. The following question has been answered in this work. Let a quantum cryptography system provide an ɛ-secure key such that ½‖ρ XE - ρ U ⊗ ρ E ‖1 < ɛ, which will be repeatedly used in classical encryption algorithms. To what extent does the ɛ-secure key reduce the number of search steps (guesswork) as compared to the use of ideal keys? A direct relation has been demonstrated between the complexity of the complete consideration of keys, which is one of the main security criteria in classical systems, and the trace distance used in quantum cryptography. Bounds for the minimum and maximum numbers of search steps for the determination of the actual key have been presented.
Efficient multiuser quantum cryptography network based on entanglement
Xue, Peng; Wang, Kunkun; Wang, Xiaoping
2017-01-01
We present an efficient quantum key distribution protocol with a certain entangled state to solve a special cryptographic task. Also, we provide a proof of security of this protocol by generalizing the proof of modified of Lo-Chau scheme. Based on this two-user scheme, a quantum cryptography network protocol is proposed without any quantum memory. PMID:28374854
NASA Astrophysics Data System (ADS)
Buhari, Abudhahir; Zukarnain, Zuriati Ahmad; Khalid, Roszelinda; Zakir Dato', Wira Jaafar Ahmad
2016-11-01
The applications of quantum information science move towards bigger and better heights for the next generation technology. Especially, in the field of quantum cryptography and quantum computation, the world already witnessed various ground-breaking tangible product and promising results. Quantum cryptography is one of the mature field from quantum mechanics and already available in the markets. The current state of quantum cryptography is still under various researches in order to reach the heights of digital cryptography. The complexity of quantum cryptography is higher due to combination of hardware and software. The lack of effective simulation tool to design and analyze the quantum cryptography experiments delays the reaching distance of the success. In this paper, we propose a framework to achieve an effective non-entanglement based quantum cryptography simulation tool. We applied hybrid simulation technique i.e. discrete event, continuous event and system dynamics. We also highlight the limitations of a commercial photonic simulation tool based experiments. Finally, we discuss ideas for achieving one-stop simulation package for quantum based secure key distribution experiments. All the modules of simulation framework are viewed from the computer science perspective.
Practical Quantum Cryptography for Secure Free-Space Communications
Buttler, W.T.; Hughes, R.J.; Kwiat, P.G.; Lamoreaux, S.K.; Morgan, G.L.; Nordholt, J.E.; Peterson, C.G.
1999-02-01
Quantum cryptography is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light. The security of these transmissions is based on the inviolability of the laws of quantum mechanics and information-theoretically secure post-processing methods. An adversary can neither successfully tap the quantum transmissions, nor evade detection, owing to Heisenberg's uncertainty principle. In this paper we describe the theory of quantum cryptography, and the most recent results from our experimental free-space system with which we have demonstrated for the first time the feasibility of quantum key generation over a point-to-point outdoor atmospheric path in daylight. We achieved a transmission distance of 0.5 km, which was limited only by the length of the test range. Our results provide strong evidence that cryptographic key material could be generated on demand between a ground station and a satellite (or between two satellites), allowing a satellite to be securely re-keyed on orbit. We present a feasibility analysis of surface-to-satellite quantum key generation.
An Online Banking System Based on Quantum Cryptography Communication
NASA Astrophysics Data System (ADS)
Zhou, Ri-gui; Li, Wei; Huan, Tian-tian; Shen, Chen-yi; Li, Hai-sheng
2014-07-01
In this paper, an online banking system has been built. Based on quantum cryptography communication, this system is proved unconditional secure. Two sets of GHZ states are applied, which can ensure the safety of purchase and payment, respectively. In another word, three trading participants in each triplet state group form an interdependent and interactive relationship. In the meantime, trading authorization and blind signature is introduced by means of controllable quantum teleportation. Thus, an effective monitor is practiced on the premise that the privacy of trading partners is guaranteed. If there is a dispute or deceptive behavior, the system will find out the deceiver immediately according to the relationship mentioned above.
Staging quantum cryptography with chocolate ballsa)
NASA Astrophysics Data System (ADS)
Svozil, Karl
2006-09-01
Moderated by a director, laypeople and students assume the role of quanta and enact a quantum cryptographic protocol. The performance is based on a generalized urn model capable of reproducing complementarity even for classical chocolate balls.
Quantum cryptography: Round-robin with photons
NASA Astrophysics Data System (ADS)
Fröhlich, Bernd; Yuan, Zhiliang
2015-12-01
Last year the common notion that signal disturbance has to be monitored in a quantum cryptographic link to guarantee secrecy was challenged by a new protocol. The formidable task of demonstrating it experimentally has now been achieved.
Quantum cryptography for secure free-space communications
Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.; Lamoreaux, S.K.; Luther, G.G.; Morgan, G.L.; Nordholt, J.E.; Peterson, C.G.
1999-03-01
The secure distribution of the secret random bit sequences known as key material, is an essential precursor to their use for the encryption and decryption of confidential communications. Quantum cryptography is a new technique for secure key distribution with single-photon transmissions: Heisenberg`s uncertainty principle ensures that an adversary can neither successfully tap the key transmissions, nor evade detection (eavesdropping raises the key error rate above a threshold value). The authors have developed experimental quantum cryptography systems based on the transmission of non-orthogonal photon polarization states to generate shared key material over line-of-sight optical links. Key material is built up using the transmission of a single-photon per bit of an initial secret random sequence. A quantum-mechanically random subset of this sequence is identified, becoming the key material after a data reconciliation stage with the sender. The authors have developed and tested a free-space quantum key distribution (QKD) system over an outdoor optical path of {approximately}1 km at Los Alamos National Laboratory under nighttime conditions. Results show that free-space QKD can provide secure real-time key distribution between parties who have a need to communicate secretly. Finally, they examine the feasibility of surface to satellite QKD.
Quantum random number generators and their applications in cryptography
NASA Astrophysics Data System (ADS)
Stipcevic, Mario
2012-06-01
Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games, scientific research etc. Because today's computers are deterministic, they can not create random numbers unless complemented with a physical RNG. Randomness of a RNG can be defined and scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG which, at state of the art, seem to be possible only by harvest of randomness inherent to certain (simple) quantum systems and such a generator we call Quantum RNG (QRNG). On the other hand, current industry standards dictate use of RNGs based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which, although quantum in nature, cannot be strictly proven. This approach is currently used in FPGA and ASIC chips. We compare weak and strong aspects of the two approaches for use in cryptography and in general. We also give an alternative definition of randomness, discuss usage of single photon detectors in realization of QRNGs and give several examples where QRNG can significantly improve security of a cryptographic system.
Cryptanalysis of a sessional blind signature based on quantum cryptography
NASA Astrophysics Data System (ADS)
Su, Qi; Li, Wen-Min
2014-09-01
A digital signature is a mathematical scheme for demonstrating the authenticity of a digital message or document. A blind signature is a form of digital signature in which the content of a message is disguised (blinded) before it is signed to protect the privacy of the message from the signatory. For signing quantum messages, some quantum blind signature protocols have been proposed. Recently, Khodambashi et al. (Quantum Inf Process 13:121, 2014) proposed a sessional blind signature based on quantum cryptography. It was claimed that these protocol could guarantee unconditional security. However, after our analysis, we find that the signature protocol will cause the key information leakage in the view of information theory. Taking advantage of loophole, the message sender can succeed in forging the signature without the knowledge of the whole exact key between the verifier and him. To conquer this shortcoming, we construct an improved protocol based on it and the new protocol can resist the key information leakage attacks.
Deterministic and efficient quantum cryptography based on Bell's theorem
Chen Zengbing; Pan Jianwei; Zhang Qiang; Bao Xiaohui; Schmiedmayer, Joerg
2006-05-15
We propose a double-entanglement-based quantum cryptography protocol that is both efficient and deterministic. The proposal uses photon pairs with entanglement both in polarization and in time degrees of freedom; each measurement in which both of the two communicating parties register a photon can establish one and only one perfect correlation, and thus deterministically create a key bit. Eavesdropping can be detected by violation of local realism. A variation of the protocol shows a higher security, similar to the six-state protocol, under individual attacks. Our scheme allows a robust implementation under the current technology.
Measurement-device-independent quantum cryptography
Xu, Feihu; Curty, Marcos; Qi, Bing; Lo, Hoi-Kwong
2014-12-18
In theory, quantum key distribution (QKD) provides information-theoretic security based on the laws of physics. Owing to the imperfections of real-life implementations, however, there is a big gap between the theory and practice of QKD, which has been recently exploited by several quantum hacking activities. To fill this gap, a novel approach, called measurement-device-independent QKD (mdiQKD), has been proposed. In addition, it can remove all side-channels from the measurement unit, arguably the most vulnerable part in QKD systems, thus offering a clear avenue toward secure QKD realisations. In this study, we review the latest developments in the framework of mdiQKD, together with its assumptions, strengths, and weaknesses.
Measurement-device-independent quantum cryptography
Xu, Feihu; Curty, Marcos; Qi, Bing; ...
2014-12-18
In theory, quantum key distribution (QKD) provides information-theoretic security based on the laws of physics. Owing to the imperfections of real-life implementations, however, there is a big gap between the theory and practice of QKD, which has been recently exploited by several quantum hacking activities. To fill this gap, a novel approach, called measurement-device-independent QKD (mdiQKD), has been proposed. In addition, it can remove all side-channels from the measurement unit, arguably the most vulnerable part in QKD systems, thus offering a clear avenue toward secure QKD realisations. In this study, we review the latest developments in the framework of mdiQKD,more » together with its assumptions, strengths, and weaknesses.« less
Teleportation-based continuous variable quantum cryptography
NASA Astrophysics Data System (ADS)
Luiz, F. S.; Rigolin, Gustavo
2017-03-01
We present a continuous variable (CV) quantum key distribution (QKD) scheme based on the CV quantum teleportation of coherent states that yields a raw secret key made up of discrete variables for both Alice and Bob. This protocol preserves the efficient detection schemes of current CV technology (no single-photon detection techniques) and, at the same time, has efficient error correction and privacy amplification schemes due to the binary modulation of the key. We show that for a certain type of incoherent attack, it is secure for almost any value of the transmittance of the optical line used by Alice to share entangled two-mode squeezed states with Bob (no 3 dB or 50% loss limitation characteristic of beam splitting attacks). The present CVQKD protocol works deterministically (no postselection needed) with efficient direct reconciliation techniques (no reverse reconciliation) in order to generate a secure key and beyond the 50% loss case at the incoherent attack level.
NASA Astrophysics Data System (ADS)
Lütkenhaus, N.; Shields, A. J.
2009-04-01
Quantum cryptography, and especially quantum key distribution (QKD), is steadily progressing to become a viable tool for cryptographic services. In recent years we have witnessed a dramatic increase in the secure bit rate of QKD, as well as its extension to ever longer fibre- and air-based links and the emergence of metro-scale trusted networks. In the foreseeable future even global-scale communications may be possible using quantum repeaters or Earth-satellite links. A handful of start-ups and some bigger companies are already active in the field. The launch of an initiative to form industrial standards for QKD, under the auspices of the European Telecommunication Standards Institute, described in the paper by Laenger and Lenhart in this Focus Issue, can be taken as a sign of the growing commercial interest. Recent progress has seen an increase in the secure bit rate of QKD links, by orders of magnitude, to over 1 Mb s-1. This has resulted mainly from an improvement in the detection technology. Here changes in the way conventional semiconductor detectors are gated, as well as the development of novel devices based on non-linear processes and superconducting materials, are leading the way. Additional challenges for QKD at GHz clock rates include the design of high speed electronics, remote synchronization and high rate random number generation. Substantial effort is being devoted to increasing the range of individual links, which is limited by attenuation and other losses in optical fibres and air links. An important advance in the past few years has been the introduction of protocols with the same scaling as an ideal single-photon set-up. The good news is that these schemes use standard optical devices, such as weak laser pulses. Thanks to these new protocols and improvements in the detection technology, the range of a single fibre link can exceed a few hundred km. Outstanding issues include proving the unconditional security of some of the schemes. Much of the
Cloning and cryptography with quantum continuous variables
NASA Astrophysics Data System (ADS)
Cerf, N. J.; Iblisdir, S.; van Assche, G.
2002-02-01
The cloning of quantum variables with continuous spectra is investigated. We define a Gaussian 1-to-2 cloning machine that 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 continuous quantum cryptographic scheme is then analyzed for the optimal individual attack. Methods to convert the resulting Gaussian keys into secret key bits are also studied. Finally, the extension of the Gaussian cloner to optimal N-to-M continuous cloners is discussed, and it is shown how to implement these cloners for light modes using a phase-insensitive optical amplifier and beam splitters. In addition, a phase-conjugate input cloner is defined, yielding M clones and M' anticlones from N replicas of a coherent state and N' replicas of its phase-conjugate (with M'-M=N'-N). This novel kind of cloners is shown to outperform the standard N-to-M cloners in some cases.
Superlinear threshold detectors in quantum cryptography
Lydersen, Lars; Maroey, Oystein; Skaar, Johannes; Makarov, Vadim; Jain, Nitin; Wittmann, Christoffer; Marquardt, Christoph; Leuchs, Gerd
2011-09-15
We introduce the concept of a superlinear threshold detector, a detector that has a higher probability to detect multiple photons if it receives them simultaneously rather than at separate times. Highly superlinear threshold detectors in quantum key distribution systems allow eavesdropping the full secret key without being revealed. Here, we generalize the detector control attack, and analyze how it performs against quantum key distribution systems with moderately superlinear detectors. We quantify the superlinearity in superconducting single-photon detectors based on earlier published data, and gated avalanche photodiode detectors based on our own measurements. The analysis shows that quantum key distribution systems using detector(s) of either type can be vulnerable to eavesdropping. The avalanche photodiode detector becomes superlinear toward the end of the gate. For systems expecting substantial loss, or for systems not monitoring loss, this would allow eavesdropping using trigger pulses containing less than 120 photons per pulse. Such an attack would be virtually impossible to catch with an optical power meter at the receiver entrance.
Security of quantum cryptography against individual attacks
NASA Astrophysics Data System (ADS)
Slutsky, Boris A.; Rao, Ramesh; Sun, Pang-Chen; Fainman, Y.
1998-04-01
An attempt to eavesdrop on a quantum cryptographic channel reveals itself through errors it inevitably introduces into the transmission. We investigate the relationship between the induced error rate and the maximum amount of information the eavesdropper can extract, in both the two-state B92 [B92 refers to the work of C. H. Bennett, Phys. Rev. Lett. 68, 3121 (1992)] and the four-state BB84 [BB84 refers to the work of C. H. Bennett and G. Brassard, in Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India (IEEE, New York, 1984), pp. 175-179] quantum cryptographic protocols. In each case, the optimal eavesdropping method that on average yields the most information for a given error rate is explicitly constructed. Analysis is limited to eavesdropping strategies where each bit of the quantum transmission is attacked individually and independently from other bits. Subject to this restriction, however, we believe that all attacks not forbidden by physical laws are covered. Unlike previous work, the eavesdropper's advantage is measured in terms of Renyi (rather than Shannon) information, and with respect only to bits received error-free by Bob (rather than all bits). This alters both the maximum extractable information and the optimal eavesdropping attack. The result can be used directly at the privacy amplification stage of the protocol to accomplish secure communication over a noisy channel.
Practical free-space quantum cryptography
Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.; Lamoreaux, S.K.; Luther, G.G.; Morgan, G.L.; Nordholt, J.E.; Peterson, C.G.; Simmons, C.M.
1998-12-01
An experimental free-space quantum key distribution (QKD) system has been tested over an outdoor optical path of {approx} 1 km under nighttime conditions at Los Alamos National Laboratory. This system employs the Bennett 92 protocol; here the authors give a brief overview of this protocol, and describe the experimental implementation of it. An analysis of the system efficiency is presented, as well as a description of the error detection protocol, which employs a two-dimensional parity check scheme. Finally, the susceptibility of this system to eavesdropping by various techniques is determined, and the effectiveness of privacy amplification procedures is discussed. The conclusions are that free-space QKD is both effective and secure; possible applications include the rekeying of satellites in low earth orbit.
Free-space quantum cryptography with quantum and telecom communication channels
NASA Astrophysics Data System (ADS)
Toyoshima, Morio; Takayama, Yoshihisa; Klaus, Werner; Kunimori, Hiroo; Fujiwara, Mikio; Sasaki, Masahide
2008-07-01
Quantum cryptography is a new technique that uses the laws of physics to transmit information securely. In such systems, the vehicle to transfer quantum information is a single photon. However, the transmission distance is limited by the absorption of photons in an optical fiber in which the maximum demonstrated range is about 100 km. Free-space quantum cryptography between a ground station and a satellite is a way of sending the quantum information further distances than that with optical fibers since there is no birefringence effect in the atmosphere. At the National Institute of Information and Communications Technology (NICT), the laser communication demonstration between the NICT optical ground station and a low earth orbit satellite was successfully conducted in 2006. For such space communication links, free-space quantum cryptography is considered to be an important application in the future. We have developed a prototype system for free-space quantum cryptography using a weak coherent light and a telecom communication channel. The preliminary results are presented.
Effect of source tampering in the security of quantum cryptography
NASA Astrophysics Data System (ADS)
Sun, Shi-Hai; Xu, Feihu; Jiang, Mu-Sheng; Ma, Xiang-Chun; Lo, Hoi-Kwong; Liang, Lin-Mei
2015-08-01
The security of source has become an increasingly important issue in quantum cryptography. Based on the framework of measurement-device-independent quantum key distribution (MDI-QKD), the source becomes the only region exploitable by a potential eavesdropper (Eve). Phase randomization is a cornerstone assumption in most discrete-variable (DV) quantum communication protocols (e.g., QKD, quantum coin tossing, weak-coherent-state blind quantum computing, and so on), and the violation of such an assumption is thus fatal to the security of those protocols. In this paper, we show a simple quantum hacking strategy, with commercial and homemade pulsed lasers, by Eve that allows her to actively tamper with the source and violate such an assumption, without leaving a trace afterwards. Furthermore, our attack may also be valid for continuous-variable (CV) QKD, which is another main class of QKD protocol, since, excepting the phase random assumption, other parameters (e.g., intensity) could also be changed, which directly determine the security of CV-QKD.
Quantum signal processing-based visual cryptography with unexpanded shares
NASA Astrophysics Data System (ADS)
Das, Surya Sarathi; Sharma, Kaushik Das; Chandra, Jayanta K.; Bera, Jitendra Nath
2015-09-01
This paper proposes a visual cryptography scheme (VCS) based on quantum signal processing (QSP). VCS is an image encryption technique that is very simple in formulation and is secure. In (k,n)-VCS, a secret binary image is encoded into n share images and minimum k shares are needed to decrypt the secret image. The efforts to encrypt a grayscale image are few in number and the majority are related to grayscale to binary conversion. Thus, a generalized approach of encryption for all types of images, i.e., binary, gray, and color is needed. Here, a generic VCS is proposed based on QSP where all types of images can be encrypted without pixel expansion along with a smoothing technique to enhance the quality of the decrypted image. The proposed scheme is tested and compared for benchmark images, and the result shows the effectiveness of the scheme.
Quantum cryptography using coherent states: Randomized encryption and key generation
NASA Astrophysics Data System (ADS)
Corndorf, Eric
With the advent of the global optical-telecommunications infrastructure, an increasing number of individuals, companies, and agencies communicate information with one another over public networks or physically-insecure private networks. While the majority of the traffic flowing through these networks requires little or no assurance of secrecy, the same cannot be said for certain communications between banks, between government agencies, within the military, and between corporations. In these arenas, the need to specify some level of secrecy in communications is a high priority. While the current approaches to securing sensitive information (namely the public-key-cryptography infrastructure and deterministic private-key ciphers like AES and 3DES) seem to be cryptographically strong based on empirical evidence, there exist no mathematical proofs of secrecy for any widely deployed cryptosystem. As an example, the ubiquitous public-key cryptosystems infer all of their secrecy from the assumption that factoring of the product of two large primes is necessarily time consuming---something which has not, and perhaps cannot, be proven. Since the 1980s, the possibility of using quantum-mechanical features of light as a physical mechanism for satisfying particular cryptographic objectives has been explored. This research has been fueled by the hopes that cryptosystems based on quantum systems may provide provable levels of secrecy which are at least as valid as quantum mechanics itself. Unfortunately, the most widely considered quantum-cryptographic protocols (BB84 and the Ekert protocol) have serious implementation problems. Specifically, they require quantum-mechanical states which are not readily available, and they rely on unproven relations between intrusion-level detection and the information available to an attacker. As a result, the secrecy level provided by these experimental implementations is entirely unspecified. In an effort to provably satisfy the cryptographic
Topics in quantum cryptography, quantum error correction, and channel simulation
NASA Astrophysics Data System (ADS)
Luo, Zhicheng
In this thesis, we mainly investigate four different topics: efficiently implementable codes for quantum key expansion [51], quantum error-correcting codes based on privacy amplification [48], private classical capacity of quantum channels [44], and classical channel simulation with quantum side information [49, 50]. For the first topic, we propose an efficiently implementable quantum key expansion protocol, capable of increasing the size of a pre-shared secret key by a constant factor. Previously, the Shor-Preskill proof [64] of the security of the Bennett-Brassard 1984 (BB84) [6] quantum key distribution protocol relied on the theoretical existence of good classical error-correcting codes with the "dual-containing" property. But the explicit and efficiently decodable construction of such codes is unknown. We show that we can lift the dual-containing constraint by employing the non-dual-containing codes with excellent performance and efficient decoding algorithms. For the second topic, we propose a construction of Calderbank-Shor-Steane (CSS) [19, 68] quantum error-correcting codes, which are originally based on pairs of mutually dual-containing classical codes, by combining a classical code with a two-universal hash function. We show, using the results of Renner and Koenig [57], that the communication rates of such codes approach the hashing bound on tensor powers of Pauli channels in the limit of large block-length. For the third topic, 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 capacity. This formula provides a new family protocol, the private father protocol, under the resource inequality framework that includes the private classical communication without the assisted secret keys as a child protocol. For the fourth topic, we study and solve the problem of classical channel
A Secure Key Distribution System of Quantum Cryptography Based on the Coherent State
NASA Technical Reports Server (NTRS)
Guo, Guang-Can; Zhang, Xiao-Yu
1996-01-01
The cryptographic communication has a lot of important applications, particularly in the magnificent prospects of private communication. As one knows, the security of cryptographic channel depends crucially on the secrecy of the key. The Vernam cipher is the only cipher system which has guaranteed security. In that system the key must be as long as the message and most be used only once. Quantum cryptography is a method whereby key secrecy can be guaranteed by a physical law. So it is impossible, even in principle, to eavesdrop on such channels. Quantum cryptography has been developed in recent years. Up to now, many schemes of quantum cryptography have been proposed. Now one of the main problems in this field is how to increase transmission distance. In order to use quantum nature of light, up to now proposed schemes all use very dim light pulses. The average photon number is about 0.1. Because of the loss of the optical fiber, it is difficult for the quantum cryptography based on one photon level or on dim light to realize quantum key-distribution over long distance. A quantum key distribution based on coherent state is introduced in this paper. Here we discuss the feasibility and security of this scheme.
Quantum Cryptography for Secure Communications to Low-Earth Orbit Satellites
Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.; Lamoreaux, S.K.; Morgan, G.L.; Peterson, C.G.; Twyeffort, E.; Simmons, C.M.; Nordholt, J.E.
1999-06-03
This is the final report of a three-year, Laboratory Directed Research and Development (LDRD) project at Los Alamos National Laboratory (LANL). Quantum cryptography is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light. The security of these transmissions is based on the inviolability of the laws of quantum mechanics. An adversary can neither successfully tap the quantum transmissions, nor evade detection. Key material is built up using the transmission of a single-photon per bit. We have developed an experimental quantum cryptography system based on the transmission of non-orthogonal single-photon polarization states to generate shared key material over line-of-sight optical links. Our results provide strong evidence that cryptographic key material could be generated on demand between a ground station and a satellite (or between two satellites), allowing a satellite to be securely re-keyed on in orbit.
One-time pad, complexity of verification of keys, and practical security of quantum cryptography
NASA Astrophysics Data System (ADS)
Molotkov, S. N.
2016-11-01
A direct relation between the complexity of the complete verification of keys, which is one of the main criteria of security in classical systems, and a trace distance used in quantum cryptography is demonstrated. Bounds for the minimum and maximum numbers of verification steps required to determine the actual key are obtained.
On a two-pass scheme without a faraday mirror for free-space relativistic quantum cryptography
Kravtsov, K. S.; Radchenko, I. V.; Korol'kov, A. V.; Kulik, S. P.; Molotkov, S. N.
2013-05-15
The stability of destructive interference independent of the input polarization and the state of a quantum communication channel in fiber optic systems used in quantum cryptography plays a principal role in providing the security of communicated keys. A novel optical scheme is proposed that can be used both in relativistic quantum cryptography for communicating keys in open space and for communicating them over fiber optic lines. The scheme ensures stability of destructive interference and admits simple automatic balancing of a fiber interferometer.
The Structure of Bipartite Quantum States - Insights from Group Theory and Cryptography
NASA Astrophysics Data System (ADS)
Christandl, Matthias
2006-04-01
This thesis presents a study of the structure of bipartite quantum states. In the first part, the representation theory of the unitary and symmetric groups is used to analyse the spectra of quantum states. In particular, it is shown how to derive a one-to-one relation between the spectra of a bipartite quantum state and its reduced states, and the Kronecker coefficients of the symmetric group. In the second part, the focus lies on the entanglement of bipartite quantum states. Drawing on an analogy between entanglement distillation and secret-key agreement in classical cryptography, a new entanglement measure, `squashed entanglement', is introduced.
The Modeling Library of Eavesdropping Methods in Quantum Cryptography Protocols by Model Checking
NASA Astrophysics Data System (ADS)
Yang, Fan; Yang, Guowu; Hao, Yujie
2016-07-01
The most crucial issue of quantum cryptography protocols is its security. There exists many ways to attack the quantum communication process. In this paper, we present a model checking method for modeling the eavesdropping in quantum information protocols. So when the security properties of a certain protocol are needed to be verified, we can directly use the models which are already built. Here we adopt the probabilistic model checking tool—PRISM to model these attack methods. The verification results show that the detection rate of eavesdropping is approximately close to 1 when enough photons are transmitted.
Timofeev, A. V.; Pomozov, D. I.; Makkaveev, A. P.; Molotkov, S. N.
2007-05-15
Quantum cryptography systems combine two communication channels: a quantum and a classical one. (They can be physically implemented in the same fiber-optic link, which is employed as a quantum channel when one-photon states are transmitted and as a classical one when it carries classical data traffic.) Both channels are supposed to be insecure and accessible to an eavesdropper. Error correction in raw keys, interferometer balancing, and other procedures are performed by using the public classical channel. A discussion of the requirements to be met by the classical channel is presented.
Field test of a practical secure communication network with decoy-state quantum cryptography.
Chen, Teng-Yun; Liang, Hao; Liu, Yang; Cai, Wen-Qi; Ju, Lei; Liu, Wei-Yue; Wang, Jian; Yin, Hao; Chen, Kai; Chen, Zeng-Bing; Peng, Cheng-Zhi; Pan, Jian-Wei
2009-04-13
We present a secure network communication system that operated with decoy-state quantum cryptography in a real-world application scenario. The full key exchange and application protocols were performed in real time among three nodes, in which two adjacent nodes were connected by approximate 20 km of commercial telecom optical fiber. The generated quantum keys were immediately employed and demonstrated for communication applications, including unbreakable real-time voice telephone between any two of the three communication nodes, or a broadcast from one node to the other two nodes by using one-time pad encryption.
Cryptography in the Bounded-Quantum-Storage Model
NASA Astrophysics Data System (ADS)
Schaffner, Christian
2007-09-01
This thesis initiates the study of cryptographic protocols in the bounded-quantum-storage model. On the practical side, simple protocols for Rabin Oblivious Transfer, 1-2 Oblivious Transfer and Bit Commitment are presented. No quantum memory is required for honest players, whereas the protocols can only be broken by an adversary controlling a large amount of quantum memory. The protocols are efficient, non-interactive and can be implemented with today's technology. On the theoretical side, new entropic uncertainty relations involving min-entropy are established and used to prove the security of protocols according to new strong security definitions. For instance, in the realistic setting of Quantum Key Distribution (QKD) against quantum-memory-bounded eavesdroppers, the uncertainty relation allows to prove the security of QKD protocols while tolerating considerably higher error rates compared to the standard model with unbounded adversaries.
Multipartite Gaussian steering: Monogamy constraints and quantum cryptography applications
NASA Astrophysics Data System (ADS)
Xiang, Yu; Kogias, Ioannis; Adesso, Gerardo; He, Qiongyi
2017-01-01
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 as a quantifier of genuine multipartite steering, and is interpreted operationally in terms of the guaranteed key rate in the task of secure quantum secret sharing. Optimal resource states for the latter protocol are identified, and their possible experimental implementation discussed. Our results pin down the role of multipartite steering for quantum communication.
Hacking commercial quantum cryptography systems by tailored bright illumination
NASA Astrophysics Data System (ADS)
Lydersen, Lars; Wiechers, Carlos; Wittmann, Christoffer; Elser, Dominique; Skaar, Johannes; Makarov, Vadim
2010-10-01
The peculiar properties of quantum mechanics allow two remote parties to communicate a private, secret key, which is protected from eavesdropping by the laws of physics. So-called quantum key distribution (QKD) implementations always rely on detectors to measure the relevant quantum property of single photons. Here we demonstrate experimentally that the detectors in two commercially available QKD systems can be fully remote-controlled using specially tailored bright illumination. This makes it possible to tracelessly acquire the full secret key; we propose an eavesdropping apparatus built from off-the-shelf components. The loophole is likely to be present in most QKD systems using avalanche photodiodes to detect single photons. We believe that our findings are crucial for strengthening the security of practical QKD, by identifying and patching technological deficiencies.
NASA Astrophysics Data System (ADS)
Jacak, Monika; Jacak, Janusz; Jóźwiak, Piotr; Jóźwiak, Ireneusz
2016-06-01
The overview of the current status of quantum cryptography is given in regard to quantum key distribution (QKD) protocols, implemented both on nonentangled and entangled flying qubits. Two commercial R&D platforms of QKD systems are described (the Clavis II platform by idQuantique implemented on nonentangled photons and the EPR S405 Quelle platform by AIT based on entangled photons) and tested for feasibility of their usage in commercial TELECOM fiber metropolitan networks. The comparison of systems efficiency, stability and resistivity against noise and hacker attacks is given with some suggestion toward system improvement, along with assessment of two models of QKD.
A sessional blind signature based on quantum cryptography
NASA Astrophysics Data System (ADS)
Khodambashi, Siavash; Zakerolhosseini, Ali
2014-01-01
In this paper, we present a sessional blind signature protocol whose security is guaranteed by fundamental principles of quantum physics. It allows a message owner to get his message signed by an authorized signatory. However, the signatory is not capable of reading the message contents and everyone can verify authenticity of the message. For this purpose, we took advantage of a sessional signature as well as quantum entangled pairs which are generated with respect to it in our proposed protocol. We describe our proposed blind signature through an example and briefly discuss about its unconditional security. Due to the feasibility of the protocol, it can be widely employed for e-payment, e-government, e-business and etc.
Manipulating transverse modes of photons for quantum cryptography
NASA Astrophysics Data System (ADS)
Luda, Marcelo Alejandro; Larotonda, Miguel Antonio; Paz, Juan Pablo; Schmiegelow, Christian Tomás
2014-04-01
Several schemes have been proposed to extend quantum key distribution protocols aimed at improving their security or at providing new physical substrates for qubit implementation. We present a toolbox to jointly create, manipulate, and measure qubits stored in polarization and transverse-modes degrees of freedom of single photons. The toolbox includes local operations on single qubits, controlled operations between the two qubits, and projective measurements over a wide variety of nonlocal bases in the four-dimensional space of states. We describe how to implement the toolbox to perform an extended version of the BB84 protocol for this Hilbert space (ideally transmitting two key bits per photon). We present the experimental implementation of the measurement scheme both in the regimes of intense light beams and with single photons. Thus, we show the feasibility of implementing the protocol, providing an interesting example of a method for quantum information processing using the polarization and transverse modes of light as qubits.
Loss-tolerant quantum cryptography with imperfect sources
NASA Astrophysics Data System (ADS)
Tamaki, Kiyoshi; Curty, Marcos; Kato, Go; Lo, Hoi-Kwong; Azuma, Koji
2014-11-01
In principle, quantum key distribution (QKD) offers unconditional security based on the laws of physics. Unfortunately, all previous QKD experiments assume perfect state preparation in their security analysis. Therefore, the generated key is not proven to be secure in the presence of unavoidable modulation errors. The key reason that modulation errors are not considered in previous QKD experiments lies in a crucial weakness of the standard Gottesman-Lo-Lütkenhaus-Preskill (GLLP) model, namely, it is not loss tolerant and Eve may in principle enhance imperfections through losses. Here, we propose a QKD protocol that is loss tolerant to state preparation flaws. Importantly, we show conclusively that the state preparation process in QKD can be much less precise than initially thought. Our method can also be applied to other quantum cryptographic protocols.
Optimal alphabets for noise-resistant quantum cryptography
NASA Astrophysics Data System (ADS)
Sych, Denis V.; Grishanin, Boris A.; Zadkov, Victor N.
2005-06-01
Possibilities of improving critical error rate of quantum key distribution (QKD) protocols for different strategies of eavesdropping are investigated. QKD-protocols with discrete alphabets letters of which form regular polyhedrons on the Bloch sphere (tetrahedron octahedron cube icosahedron and dodecahedron which have 4, 6, 8, 12 and 20 vertexes respectively) and QKD-protocol with continuous alphabet which corresponds to the limiting case of a polyhedron with infinitive number of vortexes are considered. Stability of such QKD-protocols to the noise in a quantum channel which is due to the Eve's interference that apply either intercept-receipt or optimal eavesdropping strategy at the individual attacks is studied in detail. It is shown that in case of optimal eavesdropping strategy after bases reconciliation the QKD-protocol with continuous alphabet surpasses all other protocols in terms of noise-resistance. Without basis reconciliation the highest critical error rate have the protocol with tetrahedron-type alphabet.
Thermal blinding of gated detectors in quantum cryptography.
Lydersen, Lars; Wiechers, Carlos; Wittmann, Christoffer; Elser, Dominique; Skaar, Johannes; Makarov, Vadim
2010-12-20
It has previously been shown that the gated detectors of two commercially available quantum key distribution (QKD) systems are blindable and controllable by an eavesdropper using continuous-wave illumination and short bright trigger pulses, manipulating voltages in the circuit [Nat. Photonics 4, 686 (2010)]. This allows for an attack eavesdropping the full raw and secret key without increasing the quantum bit error rate (QBER). Here we show how thermal effects in detectors under bright illumination can lead to the same outcome. We demonstrate that the detectors in a commercial QKD system Clavis2 can be blinded by heating the avalanche photo diodes (APDs) using bright illumination, so-called thermal blinding. Further, the detectors can be triggered using short bright pulses once they are blind. For systems with pauses between packet transmission such as the plug-and-play systems, thermal inertia enables Eve to apply the bright blinding illumination before eavesdropping, making her more difficult to catch.
High-Rate Strong-Signal Quantum Cryptography
NASA Technical Reports Server (NTRS)
Yuen, Horace P.
1996-01-01
Several quantum cryptosystems utilizing different kinds of nonclassical lights, which can accommodate high intensity fields and high data rate, are described. However, they are all sensitive to loss and both the high rate and the strong-signal character rapidly disappear. A squeezed light homodyne detection scheme is proposed which, with present-day technology, leads to more than two orders of magnitude data rate improvement over other current experimental systems for moderate loss.
On protection against a bright-pulse attack in the two-pass quantum cryptography system
NASA Astrophysics Data System (ADS)
Balygin, K. A.; Klimov, A. N.; Korol'kov, A. V.; Kulik, S. P.; Molotkov, S. N.
2016-06-01
The security of keys in quantum cryptography systems, in contrast to mathematical cryptographic algorithms, is guaranteed by fundamental quantum-mechanical laws. However, the cryptographic resistance of such systems, which are distributed physical devices, fundamentally depends on the method of their implementation and particularly on the calibration and control of critical parameters. The most important parameter is the number of photons in quasi-single-photon information states in a communication channel. The sensitivity to a bright-pulse attack has been demonstrated in an explicit form for a number of systems. A method guaranteeing the resistance to such attacks has been proposed and implemented. Furthermore, the relation of physical observables used and obtained at the control of quantum states to the length of final secret keys has been obtained for the first time.
Full-field implementation of a perfect eavesdropper on a quantum cryptography system.
Gerhardt, Ilja; Liu, Qin; Lamas-Linares, Antía; Skaar, Johannes; Kurtsiefer, Christian; Makarov, Vadim
2011-06-14
Quantum key distribution (QKD) allows two remote parties to grow a shared secret key. Its security is founded on the principles of quantum mechanics, but in reality it significantly relies on the physical implementation. Technological imperfections of QKD systems have been previously explored, but no attack on an established QKD connection has been realized so far. Here we show the first full-field implementation of a complete attack on a running QKD connection. An installed eavesdropper obtains the entire 'secret' key, while none of the parameters monitored by the legitimate parties indicate a security breach. This confirms that non-idealities in physical implementations of QKD can be fully practically exploitable, and must be given increased scrutiny if quantum cryptography is to become highly secure.
NASA Astrophysics Data System (ADS)
Zhang, Yichen; Yu, Song; Guo, Hong
2015-11-01
We propose a modified no-switching continuous-variable quantum key distribution protocol by employing a practical noiseless linear amplifier at the receiver to increase the maximal transmission distance and tolerable excess noise. A security analysis is presented to derive the secure bound of the protocol in presence of a Gaussian noisy lossy channel. Simulation results show that the modified protocol can not only transmit longer distance and tolerate more channel excess noise than the original protocol, but also distribute more secure keys in the enhanced region where we define a critical point to separate the enhanced and degenerative region. This critical point presents the condition of using a practical noiseless linear amplifier in the no-switching continuous-variable quantum cryptography, which is meaningful and instructive to implement a practical experiment.
NASA Astrophysics Data System (ADS)
Renner, R.; Cirac, J. I.
2009-03-01
We show that the quantum de Finetti theorem holds for states on infinite-dimensional systems, provided they satisfy certain experimentally verifiable conditions. This result can be applied to prove the security of quantum key distribution based on weak coherent states or other continuous variable states against general attacks.
Renner, R; Cirac, J I
2009-03-20
We show that the quantum de Finetti theorem holds for states on infinite-dimensional systems, provided they satisfy certain experimentally verifiable conditions. This result can be applied to prove the security of quantum key distribution based on weak coherent states or other continuous variable states against general attacks.
NASA Astrophysics Data System (ADS)
Kato, Kentaro; Hirota, Osamu
2005-08-01
The quadrature amplitude modulation (QAM) signal of coherent state of light is applied to the quantum stream cipher by Y-00 protocol. We first discuss on the performance of the square-root measurement (SRM) for the QAM signals in comparison with the optimum receiver. It is shown that the quantum stream cipher with the QAM signals is designed by using the SRM, taking account of the ciphertext-only attack and the known/chosen plain attack. Furthermore, the modification of the quantum stream cipher with the QAM signals is considered.
Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy Channels
Deutsch, D.; Ekert, A.; Jozsa, R.; Macchiavello, C.; Popescu, S.; Sanpera, A. ||
1996-09-01
Existing quantum cryptographic schemes are not, as they stand, operable in the presence of noise on the quantum communication channel. Although they become operable if they are supplemented by classical privacy-amplification techniques, the resulting schemes are difficult to analyze and have not been proved secure. We introduce the concept of quantum privacy amplification and a cryptographic scheme incorporating it which is provably secure over a noisy channel. The scheme uses an {open_quote}{open_quote}entanglement purification{close_quote}{close_quote} procedure which, because it requires only a few quantum controlled-not and single-qubit operations, could be implemented using technology that is currently being developed. {copyright} {ital 1996 The American Physical Society.}
Research on Electrically Driven Single Photon Emitter by Diamond for Quantum Cryptography
2015-03-24
considered to be an ultimate cryptography which can not be decoded. Recently, some venture companies and big companies in Japan invest in product...nanoparticles embedded in MgO matrix” Date: 2014/4/1 Authors: P. V. Thach, S. Miwa, Do Bang , T. Nozaki, F. Bonell, E. Tamura, N. Mizuochi, T
ERIC Educational Resources Information Center
Wright, Marie A.
1993-01-01
Cryptography is the science that renders data unintelligible to prevent its unauthorized disclosure or modification. Presents an application of matrices used in linear transformations to illustrate a cryptographic system. An example is provided. (17 references) (MDH)
Applications of single-qubit rotations in quantum public-key cryptography
NASA Astrophysics Data System (ADS)
Nikolopoulos, Georgios M.
2008-03-01
We discuss cryptographic applications of single-qubit rotations from the perspective of trapdoor one-way functions and public-key encryption. In particular, we present an asymmetric cryptosystem whose security relies on fundamental principles of quantum physics. A quantum public key is used for the encryption of messages while decryption is possible by means of a classical private key only. The trapdoor one-way function underlying the proposed cryptosystem maps integer numbers to quantum states of a qubit and its inversion can be infeasible by virtue of the Holevo’s theorem.
Quantum cryptography: individual eavesdropping with the knowledge of the error-correcting protocol
Horoshko, D B
2007-12-31
The quantum key distribution protocol BB84 combined with the repetition protocol for error correction is analysed from the point of view of its security against individual eavesdropping relying on quantum memory. It is shown that the mere knowledge of the error-correcting protocol changes the optimal attack and provides the eavesdropper with additional information on the distributed key. (fifth seminar in memory of d.n. klyshko)
NASA Astrophysics Data System (ADS)
Jacak, Monika; Melniczuk, Damian; Jacak, Janusz; Jóźwiak, Ireneusz; Gruber, Jacek; Jóźwiak, Piotr
2015-02-01
In order to assess the susceptibility of the quantum key distribution (QKD) systems to the hacking attack including simultaneous and frequent system self-decalibrations, we analyze the stability of the QKD transmission organized in two commercially available systems. The first one employs non-entangled photons as flying qubits in the dark quantum channel for communication whereas the second one utilizes the entangled photon pairs to secretly share the cryptographic key. Applying standard methods of the statistical data analysis to the characteristic indicators of the quality of the QKD communication (the raw key exchange rate [RKER] and the quantum bit error rate [QBER]), we have estimated the pace of the self-decalibration of both systems and the repeatability rate in the case of controlled worsening of the dark channel quality.
Trojan-horse attacks threaten the security of practical quantum cryptography
NASA Astrophysics Data System (ADS)
Jain, Nitin; Anisimova, Elena; Khan, Imran; Makarov, Vadim; Marquardt, Christoph; Leuchs, Gerd
2014-12-01
A quantum key distribution (QKD) system may be probed by an eavesdropper Eve by sending in bright light from the quantum channel and analyzing the back-reflections. We propose and experimentally demonstrate a setup for mounting such a Trojan-horse attack. We show it in operation against the quantum cryptosystem Clavis2 from ID Quantique, as a proof-of-principle. With just a few back-reflected photons, Eve discerns Bob's (secret) basis choice, and thus the raw key bit in the Scarani-Acín-Ribordy-Gisin 2004 protocol, with higher than 90% probability. This would clearly breach the security of the cryptosystem. Unfortunately, Eve's bright pulses have a side effect of causing a high level of afterpulsing in Bob's single-photon detectors, resulting in a large quantum bit error rate that effectively protects this system from our attack. However, in a Clavis2-like system equipped with detectors with less-noisy but realistic characteristics, an attack strategy with positive leakage of the key would exist. We confirm this by a numerical simulation. Both the eavesdropping setup and strategy can be generalized to attack most of the current QKD systems, especially if they lack proper safeguards. We also propose countermeasures to prevent such attacks.
Advanced techniques for free-space optical quantum cryptography over water
NASA Astrophysics Data System (ADS)
Hill, Alexander D.; Christensen, Bradley; Kwiat, Paul G.
2016-03-01
Free-space quantum key distribution (QKD) over water (e.g., ship to ship) may be limited by ship motion and atmospheric effects, such as mode distortion and beam wander due to turbulence. We report on a technique which reduces noise by excluding spatial modes which are less likely to contain QKD signal photons and experimentally demonstrate an improvement in QKD key generation rates in various noise and turbulence regimes.
Hybrid ququart-encoded quantum cryptography protected by Kochen-Specker contextuality
Cabello, Adan; D'Ambrosio, Vincenzo; Nagali, Eleonora; Sciarrino, Fabio
2011-09-15
Quantum cryptographic protocols based on complementarity are not secure against attacks in which complementarity is imitated with classical resources. The Kochen-Specker (KS) theorem provides protection against these attacks, without requiring entanglement or spatially separated composite systems. We analyze the maximum tolerated noise to guarantee the security of a KS-protected cryptographic scheme against these attacks and describe a photonic realization of this scheme using hybrid ququarts defined by the polarization and orbital angular momentum of single photons.
Quantifying the leakage of quantum protocols for classical two-party cryptography
NASA Astrophysics Data System (ADS)
Salvail, Louis; Schaffner, Christian; Sotáková, Miroslava
2014-12-01
We study quantum protocols among two distrustful parties. By adopting a rather strict definition of correctness — guaranteeing that honest players obtain their correct outcomes only — we can show that every strictly correct quantum protocol implementing a non-trivial classical primitive necessarily leaks information to a dishonest player. This extends known impossibility results to all non-trivial primitives. We provide a framework for quantifying this leakage and argue that leakage is a good measure for the privacy provided to the players by a given protocol. Our framework also covers the case where the two players are helped by a trusted third party. We show that despite the help of a trusted third party, the players cannot amplify the cryptographic power of any primitive. All our results hold even against quantum honest-but-curious adversaries who honestly follow the protocol but purify their actions and apply a different measurement at the end of the protocol. As concrete examples, we establish lower bounds on the leakage of standard universal two-party primitives such as oblivious transfer.
Quantifying the leakage of quantum protocols for classical two-party cryptography
NASA Astrophysics Data System (ADS)
Salvail, Louis; Schaffner, Christian; Sotáková, Miroslava
2015-12-01
We study quantum protocols among two distrustful parties. By adopting a rather strict definition of correctness — guaranteeing that honest players obtain their correct outcomes only — we can show that every strictly correct quantum protocol implementing a non-trivial classical primitive necessarily leaks information to a dishonest player. This extends known impossibility results to all non-trivial primitives. We provide a framework for quantifying this leakage and argue that leakage is a good measure for the privacy provided to the players by a given protocol. Our framework also covers the case where the two players are helped by a trusted third party. We show that despite the help of a trusted third party, the players cannot amplify the cryptographic power of any primitive. All our results hold even against quantum honest-but-curious adversaries who honestly follow the protocol but purify their actions and apply a different measurement at the end of the protocol. As concrete examples, we establish lower bounds on the leakage of standard universal two-party primitives such as oblivious transfer.
Modeling light entangled in polarization and frequency: case study in quantum cryptography
NASA Astrophysics Data System (ADS)
Myers, John M.
2005-08-01
With the recognition of a logical gap between experiments and equations of quantum mechanics comes: (1) a chance to clarify such purely mathematical entities as probabilities, density operators, and partial traces-separated out from the choices and judgments necessary to apply them to describing experiments with devices, and (2) an added freedom to invent equations by which to model devices, stemming from the corresponding freedom in interpreting how these equations connect to experiments. Here I apply a few of these clarifications and freedoms to model polarization-entangled light pulses called for in quantum key distribution (QKD). Available light pulses are entangled not only in polarization but also in frequency. Although absent from the simplified models that initiated QKD, the degree of frequency entanglement of polarization-entangled light pulses is shown to affect the amount of key that can be distilled from raw light signals, in one case by a factor of 4/3. Open questions remain, because QKD brings concepts of quantum decision theory, such as measures of distinguishability, mostly worked out in the context of finite-dimensional vector spaces, into contact with infinite-dimensional Hilbert spaces needed to give expression to optical frequency spectra.
General immunity and superadditivity of two-way Gaussian quantum cryptography
Ottaviani, Carlo; Pirandola, Stefano
2016-01-01
We consider two-way continuous-variable quantum key distribution, studying its security against general eavesdropping strategies. Assuming the asymptotic limit of many signals exchanged, we prove that two-way Gaussian protocols are immune to coherent attacks. More precisely we show the general superadditivity of the two-way security thresholds, which are proven to be higher than the corresponding one-way counterparts in all cases. We perform the security analysis first reducing the general eavesdropping to a two-mode coherent Gaussian attack, and then showing that the superadditivity is achieved by exploiting the random on/off switching of the two-way quantum communication. This allows the parties to choose the appropriate communication instances to prepare the key, accordingly to the tomography of the quantum channel. The random opening and closing of the circuit represents, in fact, an additional degree of freedom allowing the parties to convert, a posteriori, the two-mode correlations of the eavesdropping into noise. The eavesdropper is assumed to have no access to the on/off switching and, indeed, cannot adapt her attack. We explicitly prove that this mechanism enhances the security performance, no matter if the eavesdropper performs collective or coherent attacks. PMID:26928053
Discrete and continuous variables for measurement-device-independent quantum cryptography
Xu, Feihu; Curty, Marcos; Qi, Bing; ...
2015-11-16
In a recent Article in Nature Photonics, Pirandola et al.1 claim that the achievable secret key rates of discrete-variable (DV) measurementdevice- independent (MDI) quantum key distribution (QKD) (refs 2,3) are “typically very low, unsuitable for the demands of a metropolitan network” and introduce a continuous-variable (CV) MDI QKD protocol capable of providing key rates which, they claim, are “three orders of magnitude higher” than those of DV MDI QKD. We believe, however, that the claims regarding low key rates of DV MDI QKD made by Pirandola et al.1 are too pessimistic. Here in this paper, we show that the secretmore » key rate of DV MDI QKD with commercially available high-efficiency single-photon detectors (SPDs) (for example, see http://www.photonspot.com/detectors and http://www.singlequantum.com) and good system alignment is typically rather high and thus highly suitable for not only long-distance communication but also metropolitan networks.« less
Discrete and continuous variables for measurement-device-independent quantum cryptography
Xu, Feihu; Curty, Marcos; Qi, Bing; Qian, Li; Lo, Hoi-Kwong
2015-11-16
In a recent Article in Nature Photonics, Pirandola et al.1 claim that the achievable secret key rates of discrete-variable (DV) measurementdevice- independent (MDI) quantum key distribution (QKD) (refs 2,3) are “typically very low, unsuitable for the demands of a metropolitan network” and introduce a continuous-variable (CV) MDI QKD protocol capable of providing key rates which, they claim, are “three orders of magnitude higher” than those of DV MDI QKD. We believe, however, that the claims regarding low key rates of DV MDI QKD made by Pirandola et al.1 are too pessimistic. Here in this paper, we show that the secret key rate of DV MDI QKD with commercially available high-efficiency single-photon detectors (SPDs) (for example, see http://www.photonspot.com/detectors and http://www.singlequantum.com) and good system alignment is typically rather high and thus highly suitable for not only long-distance communication but also metropolitan networks.
NASA Astrophysics Data System (ADS)
Klimov, A. N.; Kulik, S. P.; Molotkov, S. N.; Potapova, T. A.
2017-03-01
In the paper by Gleim et al (2016 Opt. Express 24 2619), it was declared that the system of quantum cryptography, exploiting quantum key distribution (QKD) protocol BB84 with the additional reference state and encoding in a sub-carrier, is able to distribute secret keys at a distance of 210 km. The following shows that a simple attack realized with a beam splitter results in a loss of privacy of the keys over substantially smaller distances. It turns out that the actual length of the secret key transmission for the QKD system encoding in the sub-carrier frequency is ten times less than that declared in Gleim et al (2016 Opt. Express 24 2619). Therefore it is impossible to safely use the keys when distributed at a larger length of the communication channel than shown below. The maximum communication distance does not exceed 22 km, even in the most optimistic scenario.
ERIC Educational Resources Information Center
Bachman, Dale J.; Brown, Ezra A.; Norton, Anderson H.
2010-01-01
Cryptography is the science of hidden or secret writing. More generally, cryptography refers to the science of safeguarding information. Cryptography allows people to use a public medium such as the Internet to transmit private information securely, thus enabling a whole range of conveniences, from online shopping to personally printed movie…
Advanced Quantum Communication Protocols
2005-12-17
theoretically optimal configuration, and compared hyperentangled and multi-pair encoding. Table of Contents: Summary 2 Relativistic Quantum Cryptography ( RQC ...error rates, for 4- and 6-state RQC 4. Intensity pulses to generate uniform time-interval probability distributions 5. Schematic of photon-arrival...Protocols: Scientific Progress and Accomplishments “Relativistic” Quantum Cryptography We have implemented relativistic quantum cryptography ( RQC ) using
Physical Cryptography: A New Approach to Key Generation and Direct Encryption
2009-11-18
Std Z39-18 P a g e | 2 Abstract: The security of key generation and direct encryption in quantum and physical cryptography have been...emerging development of classical-noise cryptography [1, 2] and quantum cryptography [3] suggests that a new way of building cryptosystems may be...has been further studied theoretically and P a g e | 4 experimentally to only a limited extent. The second is quantum cryptography [3] based on
Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation
NASA Astrophysics Data System (ADS)
Broadbent, Anne
2016-08-01
In instantaneous nonlocal quantum computation, two parties cooperate in order to perform a quantum computation on their joint inputs, while being restricted to a single round of simultaneous communication. Previous results showed that instantaneous nonlocal quantum computation is possible, at the cost of an exponential amount of prior shared entanglement (in the size of the input). Here, we show that a linear amount of entanglement suffices, (in the size of the computation), as long as the parties share nonlocal correlations as given by the Popescu-Rohrlich box. This means that communication is not required for efficient instantaneous nonlocal quantum computation. Exploiting the well-known relation to position-based cryptography, our result also implies the impossibility of secure position-based cryptography against adversaries with nonsignaling correlations. Furthermore, our construction establishes a quantum analog of the classical communication complexity collapse under nonsignaling correlations.
High-speed data encryption over 25 km of fiber by two-mode coherent-state quantum cryptography.
Corndorf, Eric; Barbosa, Geraldo; Liang, Chuang; Yuen, Horace P; Kumar, Prem
2003-11-01
We demonstrate high-speed (250 Mbps) data encryption over 25 km of telecommunication fiber by use of coherent states. For the parameter values used in the experiment, the demonstration is secure against individual ciphertext-only eavesdropping attacks near the transmitter with ideal detection equipment. Whereas other quantum-cryptographic schemes require the use of fragile quantum states and ultrasensitive detection equipment, our protocol is loss tolerant, uses off-the-shelf components, and is optically amplifiable.
Molotkov, S. N.
2012-12-15
Any key-generation session contains a finite number of quantum-state messages, and it is there-fore important to understand the fundamental restrictions imposed on the minimal length of a string required to obtain a secret key with a specified length. The entropy uncertainty relations for smooth min and max entropies considerably simplify and shorten the proof of security. A proof of security of quantum key distribution with phase-temporal encryption is presented. This protocol provides the maximum critical error compared to other protocols up to which secure key distribution is guaranteed. In addition, unlike other basic protocols (of the BB84 type), which are vulnerable with respect to an attack by 'blinding' of avalanche photodetectors, this protocol is stable with respect to such an attack and guarantees key security.
NASA Astrophysics Data System (ADS)
Jiang, Mu-Sheng; Sun, Shi-Hai; Tang, Guang-Zhao; Ma, Xiang-Chun; Li, Chun-Yan; Liang, Lin-Mei
2013-12-01
Thanks to the high-speed self-differencing single-photon detector (SD-SPD), the secret key rate of quantum key distribution (QKD), which can, in principle, offer unconditionally secure private communications between two users (Alice and Bob), can exceed 1 Mbit/s. However, the SD-SPD may contain loopholes, which can be exploited by an eavesdropper (Eve) to hack into the unconditional security of the high-speed QKD systems. In this paper, we analyze the fact that the SD-SPD can be remotely controlled by Eve in order to spy on full information without being discovered, then proof-of-principle experiments are demonstrated. Here, we point out that this loophole is introduced directly by the operating principle of the SD-SPD, thus, it cannot be removed, except for the fact that some active countermeasures are applied by the legitimate parties.
Quantum cryptography without Bell's theorem
NASA Astrophysics Data System (ADS)
Bennett, Charles H.; Brassard, Gilles; Mermin, N. David
1992-02-01
Ekert has described a cryptographic scheme in which Einstein-Podolsky-Rosen (EPR) pairs of particles are used to generate identical random numbers in remote places, while Bell's theorem certifies that the particles have not been measured in transit by an eavesdropper. We describe a related but simpler EPR scheme and, without invoking Bell's theorem, prove it secure against more general attacks, including substitution of a fake EPR source. Finally we show our scheme is equivalent to the original 1984 key distribution scheme of Bennett and Brassard, which uses single particles instead of EPR pairs.
Neural cryptography with queries
NASA Astrophysics Data System (ADS)
Ruttor, Andreas; Kinzel, Wolfgang; Kanter, Ido
2005-01-01
Neural cryptography is based on synchronization of tree parity machines by mutual learning. We extend previous key-exchange protocols by replacing random inputs with queries depending on the current state of the neural networks. The probability of a successful attack is calculated for different model parameters using numerical simulations. The results show that queries restore the security against cooperating attackers. The success probability can be reduced without increasing the average synchronization time.
Dynamics of neural cryptography
NASA Astrophysics Data System (ADS)
Ruttor, Andreas; Kinzel, Wolfgang; Kanter, Ido
2007-05-01
Synchronization of neural networks has been used for public channel protocols in cryptography. In the case of tree parity machines the dynamics of both bidirectional synchronization and unidirectional learning is driven by attractive and repulsive stochastic forces. Thus it can be described well by a random walk model for the overlap between participating neural networks. For that purpose transition probabilities and scaling laws for the step sizes are derived analytically. Both these calculations as well as numerical simulations show that bidirectional interaction leads to full synchronization on average. In contrast, successful learning is only possible by means of fluctuations. Consequently, synchronization is much faster than learning, which is essential for the security of the neural key-exchange protocol. However, this qualitative difference between bidirectional and unidirectional interaction vanishes if tree parity machines with more than three hidden units are used, so that those neural networks are not suitable for neural cryptography. In addition, the effective number of keys which can be generated by the neural key-exchange protocol is calculated using the entropy of the weight distribution. As this quantity increases exponentially with the system size, brute-force attacks on neural cryptography can easily be made unfeasible.
Chaos and Cryptography: A new dimension in secure communications
NASA Astrophysics Data System (ADS)
Banerjee, Santo; Kurths, J.
2014-06-01
This issue is a collection of contributions on recent developments and achievements of cryptography and communications using chaos. The various contributions report important and promising results such as synchronization of networks and data transmissions; image cipher; optical and TDMA communications, quantum keys etc. Various experiments and applications such as FPGA, smartphone cipher, semiconductor lasers etc, are also included.
Cryptography in a communication system
NASA Astrophysics Data System (ADS)
Best, M. R.
1982-10-01
Communication system protection by cryptography is reviewed. Privacy and authentication problems are discussed. Conventional cryptographic systems as well as public key systems are complementary. Classical security methods such as signed contracts, physical locks, passwords and keys remain important.
NASA Astrophysics Data System (ADS)
Horoshko, D. B.
2007-12-01
The quantum key distribution protocol BB84 combined with the repetition protocol for error correction is analysed from the point of view of its security against individual eavesdropping relying on quantum memory. It is shown that the mere knowledge of the error-correcting protocol changes the optimal attack and provides the eavesdropper with additional information on the distributed key.
Visual cryptography by use of polarization
NASA Astrophysics Data System (ADS)
Yamamoto, Hirotsugu; Imagawa, Takanori; Suyama, Shiro
2010-01-01
Visual cryptography is a powerful method to share secret information, such as identification numbers, between plural members. There have been many papers on visual cryptography by use of intensity modulation. Although the use of intensity modulation is suitable for printing, degradation of image quality is a problem. Another problem for conventional visual cryptography is a risk of theft of physical keys. To cope with these problems, we propose a new field of visual cryptography by use of polarization. In this study, we have implemented polarization decoding by stacking films. Use of polarization processing improves image quality of visual cryptography. The purpose of this paper is to construct visual cryptography based on polarization processing. Furthermore, we construct a new type of visual cryptography that uses stacking order as a key for decryption. The use of stacking order multiplies the complexity of encryption. Then, it is effective to prevent secret against theft because the theft cannot determine the secret only by collecting encrypted films.
Finding Cryptography in Object Code
Jason L. Wright
2008-10-01
Finding and identifying Cryptography is a growing concern in the malware analysis community. In this paper, a heuristic method for determining the likelihood that a given function contains a cryptographic algorithm is discussed and the results of applying this method in various environments is shown. The algorithm is based on frequency analysis of opcodes that make up each function within a binary.
Multivariate Cryptography Based on Clipped Hopfield Neural Network.
Wang, Jia; Cheng, Lee-Ming; Su, Tong
2016-11-23
Designing secure and efficient multivariate public key cryptosystems [multivariate cryptography (MVC)] to strengthen the security of RSA and ECC in conventional and quantum computational environment continues to be a challenging research in recent years. In this paper, we will describe multivariate public key cryptosystems based on extended Clipped Hopfield Neural Network (CHNN) and implement it using the MVC (CHNN-MVC) framework operated in GF(p) space. The Diffie--Hellman key exchange algorithm is extended into the matrix field, which illustrates the feasibility of its new applications in both classic and postquantum cryptography. The efficiency and security of our proposed new public key cryptosystem CHNN-MVC are simulated and found to be NP-hard. The proposed algorithm will strengthen multivariate public key cryptosystems and allows hardware realization practicality.
NASA Astrophysics Data System (ADS)
Zhang, Yichen; Li, Zhengyu; Zhao, Yijia; Yu, Song; Guo, Hong
2017-02-01
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 specific attack model of the optimal two-mode attack and show the performance of the two-way protocol against the optimal two-mode attack. Even under the optimal two-mode attack, the performances of two-way protocol are still better than the corresponding one-way protocol, which shows the advantage of making double use of the quantum channel and the potential of long-distance secure communication using a two-way protocol.
Cryptography with DNA binary strands.
Leier, A; Richter, C; Banzhaf, W; Rauhe, H
2000-06-01
Biotechnological methods can be used for cryptography. Here two different cryptographic approaches based on DNA binary strands are shown. The first approach shows how DNA binary strands can be used for steganography, a technique of encryption by information hiding, to provide rapid encryption and decryption. It is shown that DNA steganography based on DNA binary strands is secure under the assumption that an interceptor has the same technological capabilities as sender and receiver of encrypted messages. The second approach shown here is based on steganography and a method of graphical subtraction of binary gel-images. It can be used to constitute a molecular checksum and can be combined with the first approach to support encryption. DNA cryptography might become of practical relevance in the context of labelling organic and inorganic materials with DNA 'barcodes'.
Practicality of quantum information processing
NASA Astrophysics Data System (ADS)
Lau, Hoi-Kwan
Quantum Information Processing (QIP) is expected to bring revolutionary enhancement to various technological areas. However, today's QIP applications are far from being practical. The problem involves both hardware issues, i.e., quantum devices are imperfect, and software issues, i.e., the functionality of some QIP applications is not fully understood. Aiming to improve the practicality of QIP, in my PhD research I have studied various topics in quantum cryptography and ion trap quantum computation. In quantum cryptography, I first studied the security of position-based quantum cryptography (PBQC). I discovered a wrong assumption in the previous literature that the cheaters are not allowed to share entangled resources. I proposed entanglement attacks that could cheat all known PBQC protocols. I also studied the practicality of continuous-variable (CV) quantum secret sharing (QSS). While the security of CV QSS was considered by the literature only in the limit of infinite squeezing, I found that finitely squeezed CV resources could also provide finite secret sharing rate. Our work relaxes the stringent resources requirement of implementing QSS. In ion trap quantum computation, I studied the phase error of quantum information induced by dc Stark effect during ion transportation. I found an optimized ion trajectory for which the phase error is the minimum. I also defined a threshold speed, above which ion transportation would induce significant error. In addition, I proposed a new application for ion trap systems as universal bosonic simulators (UBS). I introduced two architectures, and discussed their respective strength and weakness. I illustrated the implementations of bosonic state initialization, transformation, and measurement by applying radiation fields or by varying the trap potential. When comparing with conducting optical experiments, the ion trap UBS is advantageous in higher state initialization efficiency and higher measurement accuracy. Finally, I
Secure quantum key distribution
NASA Astrophysics Data System (ADS)
Lo, Hoi-Kwong; Curty, Marcos; Tamaki, Kiyoshi
2014-08-01
Secure communication is crucial in the Internet Age, and quantum mechanics stands poised to revolutionize cryptography as we know it today. In this Review, we introduce the motivation and the current state of the art of research in quantum cryptography. In particular, we discuss the present security model together with its assumptions, strengths and weaknesses. After briefly introducing recent experimental progress and challenges, we survey the latest developments in quantum hacking and countermeasures against it.
Report of the Public Cryptography Study Group.
ERIC Educational Resources Information Center
American Council on Education, Washington, DC.
Concerns of the National Security Agency (NSA) that information contained in some articles about cryptography in learned and professional journals and in monographs might be inimical to the national security are addressed. The Public Cryptography Study Group, with one dissenting opinion, recommends that a voluntary system of prior review of…
Advanced quantum communication systems
NASA Astrophysics Data System (ADS)
Jeffrey, Evan Robert
Quantum communication provides several examples of communication protocols which cannot be implemented securely using only classical communication. Currently, the most widely known of these is quantum cryptography, which allows secure key exchange between parties sharing a quantum channel subject to an eavesdropper. This thesis explores and extends the realm of quantum communication. Two new quantum communication protocols are described. The first is a new form of quantum cryptography---relativistic quantum cryptography---which increases communication efficiency by exploiting a relativistic bound on the power of an eavesdropper, in addition to the usual quantum mechanical restrictions intrinsic to quantum cryptography. By doing so, we have observed over 170% improvement in communication efficiency over a similar protocol not utilizing relativity. A second protocol, Quantum Orienteering, allows two cooperating parties to communicate a specific direction in space. This application shows the possibility of using joint measurements, or projections onto an entangled state, in order to extract the maximum useful information from quantum bits. For two-qubit communication, the maximal fidelity of communication using only separable operations is 73.6%, while joint measurements can improve the efficiency to 78.9%. In addition to implementing these protocols, we have improved several resources for quantum communication and quantum computing. Specifically, we have developed improved sources of polarization-entangled photons, a low-loss quantum memory for polarization qubits, and a quantum random number generator. These tools may be applied to a wide variety of future quantum and classical information systems.
Genetic attack on neural cryptography
Ruttor, Andreas; Kinzel, Wolfgang; Naeh, Rivka; Kanter, Ido
2006-03-15
Different scaling properties for the complexity of bidirectional synchronization and unidirectional learning are essential for the security of neural cryptography. Incrementing the synaptic depth of the networks increases the synchronization time only polynomially, but the success of the geometric attack is reduced exponentially and it clearly fails in the limit of infinite synaptic depth. This method is improved by adding a genetic algorithm, which selects the fittest neural networks. The probability of a successful genetic attack is calculated for different model parameters using numerical simulations. The results show that scaling laws observed in the case of other attacks hold for the improved algorithm, too. The number of networks needed for an effective attack grows exponentially with increasing synaptic depth. In addition, finite-size effects caused by Hebbian and anti-Hebbian learning are analyzed. These learning rules converge to the random walk rule if the synaptic depth is small compared to the square root of the system size.
Cryptographie quantique à variables continues
NASA Astrophysics Data System (ADS)
Bencheikh, K.; Jankovic, A.; Symul, T.; Levenson, J. A.
2002-06-01
Nous avons élaboré un protocole de cryptographie quantique qui permet de générer et de distribuer une clé secrète aléatoire. Le protocole repose sur l'utilisation de paires de champs électromagnétiques dont les quadratures présentent des corrélations quantiques de type Einstein-Podolsky-Rosen. Les fluctuations quantiques instantanése constituent les bits aléatoires de la clé secrète, et la dégradation irréversible des corrélations quantiques des quadratures causée par une tierce personne permet de la détecter et de garantir la sécurité d'échange.
Cryptography with chaos using Chua's system
NASA Astrophysics Data System (ADS)
Oliveira, C. H.; Pizolato, J. C., Jr.
2011-03-01
In the last years, chaotic systems have been applied in information security. These systems have a complex and unpredictable behavior, what makes them more attractive for data cryptography applications. In this work, the chaotic behavior of signals generated by Chua's system is combined with the original information in order to obtain a safe cryptographic method. The experimental results demonstrate that the proposed scheme can be used in data cryptography applications.
2005-07-06
many families of quantum MDS codes. 15. SUBJECT TERMS Quantum Information Science , Quantum Algorithms, Quantum Cryptography 16. SECURITY...separable codes over alphabets of arbitrary size,” a preprint, 2005; to be presented at ERATO conference on quantum information science , Tokyo, Japan...β, γ〉〉 = 1. Due to the Chinese remainder theorem, we have one more equivalent ∗ERATO Conference on Quantum Information Science , 2005 †jkim
Quantum algorithms: an overview
NASA Astrophysics Data System (ADS)
Montanaro, Ashley
2016-01-01
Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems and solving large systems of linear equations. Here we briefly survey some known quantum algorithms, with an emphasis on a broad overview of their applications rather than their technical details. We include a discussion of recent developments and near-term applications of quantum algorithms.
Neural Network Approach to Locating Cryptography in Object Code
Jason L. Wright; Milos Manic
2009-09-01
Finding and identifying cryptography is a growing concern in the malware analysis community. In this paper, artificial neural networks are used to classify functional blocks from a disassembled program as being either cryptography related or not. The resulting system, referred to as NNLC (Neural Net for Locating Cryptography) is presented and results of applying this system to various libraries are described.
Quantum computing with trapped ions
Hughes, R.J.
1998-01-01
The significance of quantum computation for cryptography is discussed. Following a brief survey of the requirements for quantum computational hardware, an overview of the ion trap quantum computation project at Los Alamos is presented. The physical limitations to quantum computation with trapped ions are analyzed and an assessment of the computational potential of the technology is made.
Hughes, Richard John; Thrasher, James Thomas; Nordholt, Jane Elizabeth
2016-11-29
Innovations for quantum key management harness quantum communications to form a cryptography system within a public key infrastructure framework. In example implementations, the quantum key management innovations combine quantum key distribution and a quantum identification protocol with a Merkle signature scheme (using Winternitz one-time digital signatures or other one-time digital signatures, and Merkle hash trees) to constitute a cryptography system. More generally, the quantum key management innovations combine quantum key distribution and a quantum identification protocol with a hash-based signature scheme. This provides a secure way to identify, authenticate, verify, and exchange secret cryptographic keys. Features of the quantum key management innovations further include secure enrollment of users with a registration authority, as well as credential checking and revocation with a certificate authority, where the registration authority and/or certificate authority can be part of the same system as a trusted authority for quantum key distribution.
Course 10: Basic Concepts in Quantum Computation
NASA Astrophysics Data System (ADS)
Ekert, A.; Hayden, P. M.; Inamori, H.
Contents 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
Report on Pairing-based Cryptography
Moody, Dustin; Peralta, Rene; Perlner, Ray; Regenscheid, Andrew; Roginsky, Allen; Chen, Lily
2015-01-01
This report summarizes study results on pairing-based cryptography. The main purpose of the study is to form NIST’s position on standardizing and recommending pairing-based cryptography schemes currently published in research literature and standardized in other standard bodies. The report reviews the mathematical background of pairings. This includes topics such as pairing-friendly elliptic curves and how to compute various pairings. It includes a brief introduction to existing identity-based encryption (IBE) schemes and other cryptographic schemes using pairing technology. The report provides a complete study of the current status of standard activities on pairing-based cryptographic schemes. It explores different application scenarios for pairing-based cryptography schemes. As an important aspect of adopting pairing-based schemes, the report also considers the challenges inherent in validation testing of cryptographic algorithms and modules. Based on the study, the report suggests an approach for including pairing-based cryptography schemes in the NIST cryptographic toolkit. The report also outlines several questions that will require further study if this approach is followed. PMID:26958435
Number Theory and Public-Key Cryptography.
ERIC Educational Resources Information Center
Lefton, Phyllis
1991-01-01
Described are activities in the study of techniques used to conceal the meanings of messages and data. Some background information and two BASIC programs that illustrate the algorithms used in a new cryptographic system called "public-key cryptography" are included. (CW)
Harry Potter and the Cryptography with Matrices
ERIC Educational Resources Information Center
Chua, Boon Liang
2006-01-01
This article describes Cryptography, defined as the science of encrypting and deciphering messages written in secret codes, it has played a vital role in securing information since ancient times. There are several cryptographic techniques and many make extensive use of mathematics to secure information. The author discusses an activity built…
Quantum Information, Computation and Communication
NASA Astrophysics Data System (ADS)
Jones, Jonathan A.; Jaksch, Dieter
2012-07-01
Part I. Quantum Information: 1. Quantum bits and quantum gates; 2. An atom in a laser field; 3. Spins in magnetic fields; 4. Photon techniques; 5. Two qubits and beyond; 6. Measurement and entanglement; Part II. Quantum Computation: 7. Principles of quantum computing; 8. Elementary quantum algorithms; 9. More advanced quantum algorithms; 10. Trapped atoms and ions; 11. Nuclear magnetic resonance; 12. Large scale quantum computers; Part III. Quantum Communication: 13. Basics of information theory; 14. Quantum information; 15. Quantum communication; 16. Testing EPR; 17. Quantum cryptography; Appendixes; References; Index.
Cryptography and the Internet: lessons and challenges
McCurley, K.S.
1996-12-31
The popularization of the Internet has brought fundamental changes to the world, because it allows a universal method of communication between computers. This carries enormous benefits with it, but also raises many security considerations. Cryptography is a fundamental technology used to provide security of computer networks, and there is currently a widespread engineering effort to incorporate cryptography into various aspects of the Internet. The system-level engineering required to provide security services for the Internet carries some important lessons for researchers whose study is focused on narrowly defined problems. It also offers challenges to the cryptographic research community by raising new questions not adequately addressed by the existing body of knowledge. This paper attempts to summarize some of these lessons and challenges for the cryptographic research community.
Logic Functions for Cryptography - A Tutorial
2009-05-01
Logic Functions for Cryptography - A Tutorial Jon T. Butler Tsutomu Sasao Department of Electrical Department of Computer Science and Computer ... of Computer Programming, Vol- ume 4” [9]. Definition 2.1 A linear function is the constant 0 function or the Exclusive OR of one or more variables...S) AND ADDRESS(ES) Naval Postgraduate School,Department of Electrical and Computer Engineering,Monterey,CA,93943 8. PERFORMING ORGANIZATION REPORT
Modular Integer Arithmetic for Public Key Cryptography
NASA Astrophysics Data System (ADS)
Güneysu, Tim; Paar, Christof
This chapter discusses building blocks for implementing popular public key cryptosystems, like RSA, Diffie-Hellman Key Exchange (DHKE) and Elliptic Curve Cryptography (ECC). Therefore, we briefly introduce field-based arithmetic on which most of recently established public key cryptosystems rely. As most popular fields, we give examples for architecture implementing efficient arithmetic operations over prime and binary extension fields for use in cryptographic applications.
Increasing complexity with quantum physics.
Anders, Janet; Wiesner, Karoline
2011-09-01
We argue that complex systems science and the rules of quantum physics are intricately related. We discuss a range of quantum phenomena, such as cryptography, computation and quantum phases, and the rules responsible for their complexity. We identify correlations as a central concept connecting quantum information and complex systems science. We present two examples for the power of correlations: using quantum resources to simulate the correlations of a stochastic process and to implement a classically impossible computational task.
Device-independent two-party cryptography secure against sequential attacks
NASA Astrophysics Data System (ADS)
Kaniewski, Jędrzej; Wehner, Stephanie
2016-05-01
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 (DI) protocols for two-party cryptography in the noisy-storage model. Specifically, we present a relatively easy to implement protocol for a cryptographic building block known as weak string erasure and prove its security even if the devices used in the protocol are prepared by the dishonest party. DI two-party cryptography is made challenging by the fact that Alice and Bob do not trust each other, which requires new techniques to establish security. We fully analyse the case of memoryless devices (for which sequential attacks are optimal) and the case of sequential attacks for arbitrary devices. The key ingredient of the proof, which might be of independent interest, is an explicit (and tight) relation between the violation of the Clauser-Horne-Shimony-Holt inequality observed by Alice and Bob and uncertainty generated by Alice against Bob who is forced to measure his system before finding out Alice’s setting (guessing with postmeasurement information). In particular, we show that security is possible for arbitrarily small violation.
Comparative Analysis of Cryptography Library in IoT
NASA Astrophysics Data System (ADS)
Kumar, Uday; Borgohain, Tuhin; Sanyal, Sugata
2015-05-01
The paper aims to do a survey along with a comparative analysis of the various cryptography libraries that are applicable in the field of Internet of Things (IoT). The first half of the paper briefly introduces the various cryptography libraries available in the field of cryptography along with a list of all the algorithms contained within the libraries. The second half of the paper deals with cryptography libraries specifically aimed for application in the field of Internet of Things. The various libraries and their performance analysis listed down in this paper are consolidated from various sources with the aim of providing a single comprehensive repository for reference to the various cryptography libraries and the comparative analysis of their features in IoT.
Comment on "Cheating prevention in visual cryptography".
Chen, Yu-Chi; Horng, Gwoboa; Tsai, Du-Shiau
2012-07-01
Visual cryptography (VC), proposed by Naor and Shamir, has numerous applications, including visual authentication and identification, steganography, and image encryption. In 2006, Horng showed that cheating is possible in VC, where some participants can deceive the remaining participants by forged transparencies. Since then, designing cheating-prevention visual secret-sharing (CPVSS) schemes has been studied by many researchers. In this paper, we cryptanalyze the Hu-Tzeng CPVSS scheme and show that it is not cheating immune. We also outline an improvement that helps to overcome the problem.
Quantum tagging for tags containing secret classical data
Kent, Adrian
2011-08-15
Various authors have considered schemes for quantum tagging, that is, authenticating the classical location of a classical tagging device by sending and receiving quantum signals from suitably located distant sites, in an environment controlled by an adversary whose quantum information processing and transmitting power is potentially unbounded. All of the schemes proposed elsewhere in the literature assume that the adversary is able to inspect the interior of the tagging device. All of these schemes have been shown to be breakable if the adversary has unbounded predistributed entanglement. We consider here the case in which the tagging device contains a finite key string shared with distant sites but kept secret from the adversary, and show this allows the location of the tagging device to be authenticated securely and indefinitely. Our protocol relies on quantum key distribution between the tagging device and at least one distant site, and demonstrates a new practical application of quantum key distribution. It also illustrates that the attainable security in position-based cryptography can depend crucially on apparently subtle details in the security scenario considered.
Quantum tasks in Minkowski space
NASA Astrophysics Data System (ADS)
Kent, Adrian
2012-11-01
The fundamental properties of quantum information and its applications to computing and cryptography have been greatly illuminated by considering information-theoretic tasks that are provably possible or impossible within non-relativistic quantum mechanics. I describe here a general framework for defining tasks within (special) relativistic quantum theory and illustrate it with examples from relativistic quantum cryptography and relativistic distributed quantum computation. The framework gives a unified description of all tasks previously considered and also defines a large class of new questions about the properties of quantum information in relation to Minkowski causality. It offers a way of exploring interesting new fundamental tasks and applications, and also highlights the scope for a more systematic understanding of the fundamental information-theoretic properties of relativistic quantum theory.
Quantum walk public-key cryptographic system
NASA Astrophysics Data System (ADS)
Vlachou, C.; Rodrigues, J.; Mateus, P.; Paunković, N.; Souto, A.
2015-12-01
Quantum Cryptography is a rapidly developing field of research that benefits from the properties of Quantum Mechanics in performing cryptographic tasks. Quantum walks are a powerful model for quantum computation and very promising for quantum information processing. In this paper, we present a quantum public-key cryptographic system based on quantum walks. In particular, in the proposed protocol the public-key is given by a quantum state generated by performing a quantum walk. We show that the protocol is secure and analyze the complexity of public key generation and encryption/decryption procedures.
Secure communications with low-orbit spacecraft using quantum cryptography
Hughes, Richard J.; Buttler, William T.; Kwiat, Paul G.; Luther, Gabriel G.; Morgan, George L; Nordholt, Jane E.; Peterson, Charles G.; Simmons, Charles M.
1999-01-01
Apparatus and method for secure communication between an earth station and spacecraft. A laser outputs single pulses that are split into preceding bright pulses and delayed attenuated pulses, and polarized. A Pockels cell changes the polarization of the polarized delayed attenuated pulses according to a string of random numbers, a first polarization representing a "1," and a second polarization representing a "0." At the receiving station, a beamsplitter randomly directs the preceding bright pulses and the polarized delayed attenuated pulses onto longer and shorter paths, both terminating in a beamsplitter which directs the preceding bright pulses and a first portion of the polarized delayed attenuated pulses to a first detector, and a second portion of the polarized delayed attenuated pulses to a second detector to generate a key for secure communication between the earth station and the spacecraft.
NASA Astrophysics Data System (ADS)
Hwang, Tzonelih; Luo, Yi-Ping; Yang, Chun-Wei; Lin, Tzu-Han
2014-04-01
This work proposes a new direction in quantum cryptography called quantum authencryption. Quantum authencryption (QA), a new term to distinguish from authenticated quantum secure direct communications, is used to describe the technique of combining quantum encryption and quantum authentication into one process for off-line communicants. QA provides a new way of quantum communications without the presence of a receiver on line, and thus makes many applications depending on secure one-way quantum communications, such as quantum E-mail systems, possible. An example protocol using single photons and one-way hash functions is presented to realize the requirements on QA.
Large-alphabet quantum key distribution with two-mode coherently correlated beams
NASA Astrophysics Data System (ADS)
Usenko, Vladyslav C.; Lev, Bohdan I.
2005-12-01
The large-alphabet quantum cryptography protocol based on the two-mode coherently correlated multi-photon beams is proposed. The alphabet extension for the protocol is shown to result in the increase of the QKD effectiveness and security.
Towards secure quantum key distribution protocol for wireless LANs: a hybrid approach
NASA Astrophysics Data System (ADS)
Naik, R. Lalu; Reddy, P. Chenna
2015-12-01
The primary goals of security such as authentication, confidentiality, integrity and non-repudiation in communication networks can be achieved with secure key distribution. Quantum mechanisms are highly secure means of distributing secret keys as they are unconditionally secure. Quantum key distribution protocols can effectively prevent various attacks in the quantum channel, while classical cryptography is efficient in authentication and verification of secret keys. By combining both quantum cryptography and classical cryptography, security of communications over networks can be leveraged. Hwang, Lee and Li exploited the merits of both cryptographic paradigms for provably secure communications to prevent replay, man-in-the-middle, and passive attacks. In this paper, we propose a new scheme with the combination of quantum cryptography and classical cryptography for 802.11i wireless LANs. Since quantum cryptography is premature in wireless networks, our work is a significant step forward toward securing communications in wireless networks. Our scheme is known as hybrid quantum key distribution protocol. Our analytical results revealed that the proposed scheme is provably secure for wireless networks.
Quantum Image Encryption and Decryption Algorithms Based on Quantum Image Geometric Transformations
NASA Astrophysics Data System (ADS)
Zhou, Ri-Gui; Wu, Qian; Zhang, Man-Qun; Shen, Chen-Yi
2013-06-01
Cryptography is the essential subject for network information security to protect important data. Although following the symmetric cryptosystem for which the participations in the communication keep exactly the same keys, the special for the encryption and decryption algorithms proposed in this paper lays in the operational objectives, the quantum image. Firstly, extracts the properties of gray-scale and position from the quantum gray-scale image which the storage expression of image in quantum states is achieved. Along with the geometric transformations in classical images, this article realizes the quantum image geometric transforms by means of designing quantum circuits. Eventually, through a combination of the proposals in previous, the encryption and decryption algorithms on quantum gray-scale images is finally accomplished, which could ensure the confidentiality and security of the information in delivery. The algorithms belong to the application of quantum image geometric transformations, for further, the new explorations for quantum image cryptography researches.
Efficient Quantum Pseudorandomness
NASA Astrophysics Data System (ADS)
Brandão, Fernando G. S. L.; Harrow, Aram W.; Horodecki, Michał
2016-04-01
Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g., in computation, communication, and control. Fully random transformations require exponential time for either classical or quantum systems, but in many cases pseudorandom operations can emulate certain properties of truly random ones. Indeed, in the classical realm there is by now a well-developed theory regarding such pseudorandom operations. However, the construction of such objects turns out to be much harder in the quantum case. Here, we show that random quantum unitary time evolutions ("circuits") are a powerful source of quantum pseudorandomness. This gives for the first time a polynomial-time construction of quantum unitary designs, which can replace fully random operations in most applications, and shows that generic quantum dynamics cannot be distinguished from truly random processes. We discuss applications of our result to quantum information science, cryptography, and understanding the self-equilibration of closed quantum dynamics.
Efficient Quantum Pseudorandomness.
Brandão, Fernando G S L; Harrow, Aram W; Horodecki, Michał
2016-04-29
Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g., in computation, communication, and control. Fully random transformations require exponential time for either classical or quantum systems, but in many cases pseudorandom operations can emulate certain properties of truly random ones. Indeed, in the classical realm there is by now a well-developed theory regarding such pseudorandom operations. However, the construction of such objects turns out to be much harder in the quantum case. Here, we show that random quantum unitary time evolutions ("circuits") are a powerful source of quantum pseudorandomness. This gives for the first time a polynomial-time construction of quantum unitary designs, which can replace fully random operations in most applications, and shows that generic quantum dynamics cannot be distinguished from truly random processes. We discuss applications of our result to quantum information science, cryptography, and understanding the self-equilibration of closed quantum dynamics.
Enhancing Undergraduate Mathematics Curriculum via Coding Theory and Cryptography
ERIC Educational Resources Information Center
Aydin, Nuh
2009-01-01
The theory of error-correcting codes and cryptography are two relatively recent applications of mathematics to information and communication systems. The mathematical tools used in these fields generally come from algebra, elementary number theory, and combinatorics, including concepts from computational complexity. It is possible to introduce the…
Cryptography for a High-Assurance Web-Based Enterprise
2013-10-01
document concentrates on layers 4 and above. Keywords- cryptogrophy; Public Key Infrastructure; Electronic Signature; Web services; Transport Layer...2. Other Cryptographic services - Java provides many cryptographic services through the Java Cryptography Architecture (JCA) framework. The...also was limited because it worked only in hardware, and the explosion of the Internet and e- commerce led to much greater use and versatility of
Quantum relays and noise suppression using linear optics
Jacobs, B.C.; Pittman, T.B.; Franson, J.D.
2002-11-01
Probabilistic quantum nondemolition (QND) measurements can be performed using linear optics and postselection. Here we show how QND devices of this kind can be used in a straightforward way to implement a quantum relay, which is capable of extending the range of a quantum cryptography system by suppressing the effects of detector noise. Unlike a quantum repeater, a quantum relay system does not require entanglement purification or the ability to store photons.
Quantum random number generators
NASA Astrophysics Data System (ADS)
Herrero-Collantes, Miguel; Garcia-Escartin, Juan Carlos
2017-01-01
Random numbers are a fundamental resource in science and engineering with important applications in simulation and cryptography. The inherent randomness at the core of quantum mechanics makes quantum systems a perfect source of entropy. Quantum random number generation is one of the most mature quantum technologies with many alternative generation methods. This review discusses the different technologies in quantum random number generation from the early devices based on radioactive decay to the multiple ways to use the quantum states of light to gather entropy from a quantum origin. Randomness extraction and amplification and the notable possibility of generating trusted random numbers even with untrusted hardware using device-independent generation protocols are also discussed.
Experimental quantum multiparty communication protocols
NASA Astrophysics Data System (ADS)
Smania, Massimiliano; Elhassan, Ashraf M.; Tavakoli, Armin; Bourennane, Mohamed
2016-06-01
Quantum information science breaks limitations of conventional information transfer, cryptography and computation by using quantum superpositions or entanglement as resources for information processing. Here we report on the experimental realisation of three-party quantum communication protocols using single three-level quantum system (qutrit) communication: secret-sharing, detectable Byzantine agreement and communication complexity reduction for a three-valued function. We have implemented these three schemes using the same optical fibre interferometric setup. Our realisation is easily scalable without compromising on detection efficiency or generating extremely complex many-particle entangled states.
Electronic Voting Protocol Using Identity-Based Cryptography
Gallegos-Garcia, Gina; Tapia-Recillas, Horacio
2015-01-01
Electronic voting protocols proposed to date meet their properties based on Public Key Cryptography (PKC), which offers high flexibility through key agreement protocols and authentication mechanisms. However, when PKC is used, it is necessary to implement Certification Authority (CA) to provide certificates which bind public keys to entities and enable verification of such public key bindings. Consequently, the components of the protocol increase notably. An alternative is to use Identity-Based Encryption (IBE). With this kind of cryptography, it is possible to have all the benefits offered by PKC, without neither the need of certificates nor all the core components of a Public Key Infrastructure (PKI). Considering the aforementioned, in this paper we propose an electronic voting protocol, which meets the privacy and robustness properties by using bilinear maps. PMID:26090515
Electronic Voting Protocol Using Identity-Based Cryptography.
Gallegos-Garcia, Gina; Tapia-Recillas, Horacio
2015-01-01
Electronic voting protocols proposed to date meet their properties based on Public Key Cryptography (PKC), which offers high flexibility through key agreement protocols and authentication mechanisms. However, when PKC is used, it is necessary to implement Certification Authority (CA) to provide certificates which bind public keys to entities and enable verification of such public key bindings. Consequently, the components of the protocol increase notably. An alternative is to use Identity-Based Encryption (IBE). With this kind of cryptography, it is possible to have all the benefits offered by PKC, without neither the need of certificates nor all the core components of a Public Key Infrastructure (PKI). Considering the aforementioned, in this paper we propose an electronic voting protocol, which meets the privacy and robustness properties by using bilinear maps.
Quantum Entanglement and Information
NASA Astrophysics Data System (ADS)
Zeilinger, Anton
2002-04-01
The development of quantum entanglement presents a very interesting and typical case how fundamental reasearch leads to new technologically interesting concepts. Initially it was introduced by Einstein and Schroedinger because of its philosophical interest. This, together with Bell's theorem, led to experiments beginning in the early 1970-s which also were only motivated by their importance for the foundations of physics. Most remarkably, in recent years people discovered that quantum entanglement can be useful in completely novel ways of transmitting and processing of information with no analog in classical physics. Here the most developed areas are quantum communication, quantum cryptography, quantum teleportation and quantum computation. In the talk I will present the basics of these applications of entanglement and I will discuss some existing experimental realisations. Finally I will argue that, while it is impossible to foresee where the present development will lead us, it is very likely that in the end a novel kind of information technology will emerge.
Elliptic Curve Cryptography on Smart Cards Without Coprocessors
2000-09-20
ELLIPTIC CURVE CRYPTOGRAPHY ON SMART CARDS WITHOUT COPROCESSORS Adam D. Woodbury Electrical and Computer Engineering Department adw@ece.wpi.edu...christof@ece.wpi.edu Worcester Polytechnic Institute Worcester, MA 01609 USA The Fourth Smart Card Research and Advanced Applications (CARDIS 2000...cost microprocessors with reasonable performance. We focus in this paper on the Intel 8051 family of microcontrollers popular in smart cards and other
Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography.
Picek, Stjepan; Carlet, Claude; Guilley, Sylvain; Miller, Julian F; Jakobovic, Domagoj
2016-01-01
The role of Boolean functions is prominent in several areas including cryptography, sequences, and coding theory. Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest. New motivations on the role of Boolean functions in cryptography with attendant new properties have emerged over the years. There are still many combinations of design criteria left unexplored and in this matter evolutionary computation can play a distinct role. This article concentrates on two scenarios for the use of Boolean functions in cryptography. The first uses Boolean functions as the source of the nonlinearity in filter and combiner generators. Although relatively well explored using evolutionary algorithms, it still presents an interesting goal in terms of the practical sizes of Boolean functions. The second scenario appeared rather recently where the objective is to find Boolean functions that have various orders of the correlation immunity and minimal Hamming weight. In both these scenarios we see that evolutionary algorithms are able to find high-quality solutions where genetic programming performs the best.
Trojan horse attacks on counterfactual quantum key distribution
NASA Astrophysics Data System (ADS)
Yang, Xiuqing; Wei, Kejin; Ma, Haiqiang; Sun, Shihai; Du, Yungang; Wu, Lingan
2016-04-01
There has been much interest in "counterfactual quantum cryptography" (T.-G. Noh, 2009 [10]). It seems that the counterfactual quantum key distribution protocol without any photon carrier through the quantum channel provides practical security advantages. However, we show that it is easy to break counterfactual quantum key distribution systems in practical situations. We introduce the two types of Trojan horse attacks that are available for the two-way protocol and become possible for practical counterfactual systems with our eavesdropping schemes.
Counterfactual quantum certificate authorization
NASA Astrophysics Data System (ADS)
Shenoy H., Akshata; Srikanth, R.; Srinivas, T.
2014-05-01
We present a multipartite protocol in a counterfactual paradigm. In counterfactual quantum cryptography, secure information is transmitted between two spatially separated parties even when there is no physical travel of particles transferring the information between them. We propose here a tripartite counterfactual quantum protocol for the task of certificate authorization. Here a trusted third party, Alice, authenticates an entity Bob (e.g., a bank) that a client Charlie wishes to securely transact with. The protocol is counterfactual with respect to either Bob or Charlie. We prove its security against a general incoherent attack, where Eve attacks single particles.
Practical quantum retrieval games
NASA Astrophysics Data System (ADS)
Arrazola, Juan Miguel; Karasamanis, Markos; Lütkenhaus, Norbert
2016-06-01
Complex cryptographic protocols are often constructed from simpler building blocks. In order to advance quantum cryptography, it is important to study practical building blocks that can be used to develop new protocols. An example is quantum retrieval games (QRGs), which have broad applicability and have already been used to construct quantum money schemes. In this work, we introduce a general construction of quantum retrieval games based on the hidden matching problem and show how they can be implemented in practice using available technology. More precisely, we provide a general method to construct (1-out-of-k ) QRGs, proving that their cheating probabilities decrease exponentially in k . In particular, we define QRGs based on coherent states of light, which can be implemented even in the presence of experimental imperfections. Our results constitute a tool in the arsenal of the practical quantum cryptographer.
Quantum random number generation
Ma, Xiongfeng; Yuan, Xiao; Cao, Zhu; Zhang, Zhen; Qi, Bing
2016-06-28
Quantum physics can be exploited to generate true random numbers, which play important roles in many applications, especially in cryptography. Genuine randomness from the measurement of a quantum system reveals the inherent nature of quantumness -- coherence, an important feature that differentiates quantum mechanics from classical physics. The generation of genuine randomness is generally considered impossible with only classical means. Based on the degree of trustworthiness on devices, quantum random number generators (QRNGs) can be grouped into three categories. The first category, practical QRNG, is built on fully trusted and calibrated devices and typically can generate randomness at a high speed by properly modeling the devices. The second category is self-testing QRNG, where verifiable randomness can be generated without trusting the actual implementation. The third category, semi-self-testing QRNG, is an intermediate category which provides a tradeoff between the trustworthiness on the device and the random number generation speed.
Quantum random number generation
Ma, Xiongfeng; Yuan, Xiao; Cao, Zhu; ...
2016-06-28
Quantum physics can be exploited to generate true random numbers, which play important roles in many applications, especially in cryptography. Genuine randomness from the measurement of a quantum system reveals the inherent nature of quantumness -- coherence, an important feature that differentiates quantum mechanics from classical physics. The generation of genuine randomness is generally considered impossible with only classical means. Based on the degree of trustworthiness on devices, quantum random number generators (QRNGs) can be grouped into three categories. The first category, practical QRNG, is built on fully trusted and calibrated devices and typically can generate randomness at a highmore » speed by properly modeling the devices. The second category is self-testing QRNG, where verifiable randomness can be generated without trusting the actual implementation. The third category, semi-self-testing QRNG, is an intermediate category which provides a tradeoff between the trustworthiness on the device and the random number generation speed.« less
An application of different dioids in public key cryptography
Durcheva, Mariana I.
2014-11-18
Dioids provide a natural framework for analyzing a broad class of discrete event dynamical systems such as the design and analysis of bus and railway timetables, scheduling of high-throughput industrial processes, solution of combinatorial optimization problems, the analysis and improvement of flow systems in communication networks. They have appeared in several branches of mathematics such as functional analysis, optimization, stochastic systems and dynamic programming, tropical geometry, fuzzy logic. In this paper we show how to involve dioids in public key cryptography. The main goal is to create key – exchange protocols based on dioids. Additionally the digital signature scheme is presented.
Quantum Public-Key Cryptosystem
NASA Astrophysics Data System (ADS)
Luo, Ming-Xing; Chen, Xiu-Bo; Yun, Deng; Yang, Yi-Xian
2012-03-01
Quantum one-way functions play a fundamental role in cryptography because of its necessity for the secure encryption schemes taking into account the quantum computer. In this paper our purpose is to establish a theoretical framework for a candidate of the quantum one-way functions and quantum trapdoor functions based on one-parameter unitary groups. The dynamics of parameterized unitary groups ensure the one-wayness and quantum undistinguishability in different levels, and the physical feasibility are derived from the simultaneous approximation of its infinitesimal generators. Moreover, these special functions are used to construct new cryptosystems-the quantum public-key cryptosystems for encrypting both the classical and quantum information.
Fully Distrustful Quantum Bit Commitment and Coin Flipping
NASA Astrophysics Data System (ADS)
Silman, J.; Chailloux, A.; Aharon, N.; Kerenidis, I.; Pironio, S.; Massar, S.
2011-06-01
In the distrustful quantum cryptography model the parties have conflicting interests and do not trust one another. Nevertheless, they trust the quantum devices in their labs. The aim of the device-independent approach to cryptography is to do away with the latter assumption, and, consequently, significantly increase security. It is an open question whether the scope of this approach also extends to protocols in the distrustful cryptography model, thereby rendering them “fully” distrustful. In this Letter, we show that for bit commitment—one of the most basic primitives within the model—the answer is positive. We present a device-independent (imperfect) bit-commitment protocol, where Alice’s and Bob’s cheating probabilities are ≃0.854 and (3)/(4), which we then use to construct a device-independent coin flipping protocol with bias ≲0.336.
Rudolph, Terry; Spekkens, Robert W.
2004-11-01
We introduce a primitive for quantum cryptography that we term 'state targeting'. We show that increasing one's probability of success in this task above a minimum amount implies an unavoidable increase in the probability of a particular kind of failure. This is analogous to the unavoidable disturbance to a quantum state that results from gaining information about its identity, and can be shown to be a purely quantum effect. We solve various optimization problems for state targeting that are useful for the security analysis of two-party cryptographic tasks implemented between remote antagonistic parties. Although we focus on weak coin flipping, the results are significant for other two-party protocols, such as strong coin flipping, partially binding and concealing bit commitment, and bit escrow. Furthermore, the results have significance not only for the traditional notion of security in cryptography, that of restricting a cheater's ability to bias the outcome of the protocol, but also for a different notion of security that arises only in the quantum context, that of cheat sensitivity. Finally, our analysis leads to some interesting secondary results, namely, a generalization of Uhlmann's theorem and an operational interpretation of the fidelity between two mixed states.
Remapping the quantum frontier
NASA Astrophysics Data System (ADS)
Monroe, Christopher; Lukin, Mikhail
2008-08-01
In 1994 the mathematician Peter Shor, then working at AT&T Bell Laboratories in the US, applied quantum mechanics to an age-old problem in number theory and made a remarkable discovery. He showed that a computer that operates on and processes quantum systems could factor large integers exponentially faster than a conventional computer. This result attracted a lot of attention because the difficulty of factoring large numbers is what ensures the security of modern cryptography schemes - even the best conventional computer would take several thousand years to factor a number with more than about 150 digits. Shor's quantum factoring algorithm could, in principle, break such encryption standards - a possibility that led to an explosion of interest in quantum information science. Until then it was a field that had largely been a mere curiosity, despite notable contributions from the likes of Richard Feynman and David Deutsch.
Quantum random number generation
NASA Astrophysics Data System (ADS)
Ma, Xiongfeng; Yuan, Xiao; Cao, Zhu; Qi, Bing; Zhang, Zhen
2016-06-01
Quantum physics can be exploited to generate true random numbers, which have important roles in many applications, especially in cryptography. Genuine randomness from the measurement of a quantum system reveals the inherent nature of quantumness—coherence, an important feature that differentiates quantum mechanics from classical physics. The generation of genuine randomness is generally considered impossible with only classical means. On the basis of the degree of trustworthiness on devices, quantum random number generators (QRNGs) can be grouped into three categories. The first category, practical QRNG, is built on fully trusted and calibrated devices and typically can generate randomness at a high speed by properly modelling the devices. The second category is self-testing QRNG, in which verifiable randomness can be generated without trusting the actual implementation. The third category, semi-self-testing QRNG, is an intermediate category that provides a tradeoff between the trustworthiness on the device and the random number generation speed.
Embracing the quantum limit in silicon computing.
Morton, John J L; McCamey, Dane R; Eriksson, Mark A; Lyon, Stephen A
2011-11-16
Quantum computers hold the promise of massive performance enhancements across a range of applications, from cryptography and databases to revolutionary scientific simulation tools. Such computers would make use of the same quantum mechanical phenomena that pose limitations on the continued shrinking of conventional information processing devices. Many of the key requirements for quantum computing differ markedly from those of conventional computers. However, silicon, which plays a central part in conventional information processing, has many properties that make it a superb platform around which to build a quantum computer.
Cryptanalysis and security enhancement of optical cryptography based on computational ghost imaging
NASA Astrophysics Data System (ADS)
Yuan, Sheng; Yao, Jianbin; Liu, Xuemei; Zhou, Xin; Li, Zhongyang
2016-04-01
Optical cryptography based on computational ghost imaging (CGI) has attracted much attention of researchers because it encrypts plaintext into a random intensity vector rather than complexed-valued function. This promising feature of the CGI-based cryptography reduces the amount of data to be transmitted and stored and therefore brings convenience in practice. However, we find that this cryptography is vulnerable to chosen-plaintext attack because of the linear relationship between the input and output of the encryption system, and three feasible strategies are proposed to break it in this paper. Even though a large number of plaintexts need to be chosen in these attack methods, it means that this cryptography still exists security risks. To avoid these attacks, a security enhancement method utilizing an invertible matrix modulation is further discussed and the feasibility is verified by numerical simulations.
Towards a high-speed quantum random number generator
NASA Astrophysics Data System (ADS)
Stucki, Damien; Burri, Samuel; Charbon, Edoardo; Chunnilall, Christopher; Meneghetti, Alessio; Regazzoni, Francesco
2013-10-01
Randomness is of fundamental importance in various fields, such as cryptography, numerical simulations, or the gaming industry. Quantum physics, which is fundamentally probabilistic, is the best option for a physical random number generator. In this article, we will present the work carried out in various projects in the context of the development of a commercial and certified high speed random number generator.
Implementing Diffie-Hellman key exchange using quantum EPR pairs
NASA Astrophysics Data System (ADS)
Mandal, Sayonnha; Parakh, Abhishek
2015-05-01
This paper implements the concepts of perfect forward secrecy and the Diffie-Hellman key exchange using EPR pairs to establish and share a secret key between two non-authenticated parties and transfer messages between them without the risk of compromise. Current implementations of quantum cryptography are based on the BB84 protocol, which is susceptible to siphoning attacks on the multiple photons emitted by practical laser sources. This makes BB84-based quantum cryptography protocol unsuitable for network computing environments. Diffie-Hellman does not require the two parties to be mutually authenticated to each other, yet it can provide a basis for a number of authenticated protocols, most notably the concept of perfect forward secrecy. The work proposed in this paper provides a new direction in utilizing quantum EPR pairs in quantum key exchange. Although, classical cryptography boasts of efficient and robust protocols like the Diffie-Hellman key exchange, in the current times, with the advent of quantum computing they are very much vulnerable to eavesdropping and cryptanalytic attacks. Using quantum cryptographic principles, however, these classical encryption algorithms show more promise and a more robust and secure structure for applications. The unique properties of quantum EPR pairs also, on the other hand, go a long way in removing attacks like eavesdropping by their inherent nature of one particle of the pair losing its state if a measurement occurs on the other. The concept of perfect forward secrecy is revisited in this paper to attribute tighter security to the proposed protocol.
Cryptanalysis and improvement of a quantum private set intersection protocol
NASA Astrophysics Data System (ADS)
Cheng, Xiaogang; Guo, Ren; Chen, Yonghong
2017-02-01
A recent Quantum Private Set Intersection (QPSI) scheme is crypt-analyzed. The original claimed communication overhead is shown to be not accurate. And the original security definition is passive and not fair. To ensure fairness, a passive third party is introduced. It is also shown that unconditional fairness of QPSI protocol is impossible. Since otherwise, it would violate a well-known impossible quantum cryptography result.
Quantum Information with Structured Light
NASA Astrophysics Data System (ADS)
Mirhosseini, Mohammad
Quantum information science promises dramatic progress in a variety of fields such as cryptography, computation, and metrology. Although the proof-of-principle attempts for implementing quantum protocols have often relied on only a few qubits, the utilization of more sophisticated quantum systems is required for practical applications. In this thesis, we investigate the emerging role of high-dimensional optical states as a resource for encoding quantum information. We begin the first chapter with a review of orbital angular momentum (OAM) as a prime candidate for realizing multilevel quantum states and follow with a brief introduction to the quantum measurement theory. The second and the third chapters are dedicated to the application of OAM modes in quantum cryptography. In the second chapter, we discuss the challenges of projective measurement of OAM at the single-photon level, a crucial task required for quantum information processing. We then present our development of an efficient and accurate mode-sorting device that is capable of projectively measuring the orbital angular momentum of single photons. In the third chapter, we discuss the role of OAM modes in increasing the information capacity of quantum cryptography. We start this chapter by establishing the merits of encoding information on the quantum index of OAM modes in a free-space link. We then generalizing the BB-84 QKD protocol to the Hilbert space spanned by a finite number of OAM modes and outline our experimental realization. The last two chapters are dedicated to the tomography of structured light fields. We start the fourth chapter by applying the recently found method of direct measurement to the characterization of OAM superpositions. We find the quantum state in the Hilbert space spanned by 27 OAM modes by performing a weak measurement of orbital angular momentum (OAM) followed by a strong measurement of azimuthal angle. We then introduce the concept of compressive direct measurement (CDM
Authentication Protocol using Quantum Superposition States
Kanamori, Yoshito; Yoo, Seong-Moo; Gregory, Don A.; Sheldon, Frederick T
2009-01-01
When it became known that quantum computers could break the RSA (named for its creators - Rivest, Shamir, and Adleman) encryption algorithm within a polynomial-time, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have sufficient computational power to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. An authentication protocol using quantum superposition states instead of quantum entangled particles is proposed. The random number shared between a sender and a receiver can be used for classical encryption after the authentication has succeeded. The proposed protocol can be implemented with the current technologies we introduce in this paper.
Prospects for quantum computation with trapped ions
Hughes, R.J.; James, D.F.V.
1997-12-31
Over the past decade information theory has been generalized to allow binary data to be represented by two-state quantum mechanical systems. (A single two-level system has come to be known as a qubit in this context.) The additional freedom introduced into information physics with quantum systems has opened up a variety of capabilities that go well beyond those of conventional information. For example, quantum cryptography allows two parties to generate a secret key even in the presence of eavesdropping. But perhaps the most remarkable capabilities have been predicted in the field of quantum computation. Here, a brief survey of the requirements for quantum computational hardware, and an overview of the in trap quantum computation project at Los Alamos are presented. The physical limitations to quantum computation with trapped ions are discussed.
Optimal architectures for long distance quantum communication
Muralidharan, Sreraman; Li, Linshu; Kim, Jungsang; Lütkenhaus, Norbert; Lukin, Mikhail D.; Jiang, Liang
2016-01-01
Despite the tremendous progress of quantum cryptography, efficient quantum communication over long distances (≥1000 km) remains an outstanding challenge due to fiber attenuation and operation errors accumulated over the entire communication distance. Quantum repeaters (QRs), as a promising approach, can overcome both photon loss and operation errors, and hence significantly speedup the communication rate. Depending on the methods used to correct loss and operation errors, all the proposed QR schemes can be classified into three categories (generations). Here we present the first systematic comparison of three generations of quantum repeaters by evaluating the cost of both temporal and physical resources, and identify the optimized quantum repeater architecture for a given set of experimental parameters for use in quantum key distribution. Our work provides a roadmap for the experimental realizations of highly efficient quantum networks over transcontinental distances. PMID:26876670
High-dimensional quantum cloning and applications to quantum hacking
Bouchard, Frédéric; Fickler, Robert; Boyd, Robert W.; Karimi, Ebrahim
2017-01-01
Attempts at cloning a quantum system result in the introduction of imperfections in the state of the copies. This is a consequence of the no-cloning theorem, which is a fundamental law of quantum physics and the backbone of security for quantum communications. Although perfect copies are prohibited, a quantum state may be copied with maximal accuracy via various optimal cloning schemes. Optimal quantum cloning, which lies at the border of the physical limit imposed by the no-signaling theorem and the Heisenberg uncertainty principle, has been experimentally realized for low-dimensional photonic states. However, an increase in the dimensionality of quantum systems is greatly beneficial to quantum computation and communication protocols. Nonetheless, no experimental demonstration of optimal cloning machines has hitherto been shown for high-dimensional quantum systems. We perform optimal cloning of high-dimensional photonic states by means of the symmetrization method. We show the universality of our technique by conducting cloning of numerous arbitrary input states and fully characterize our cloning machine by performing quantum state tomography on cloned photons. In addition, a cloning attack on a Bennett and Brassard (BB84) quantum key distribution protocol is experimentally demonstrated to reveal the robustness of high-dimensional states in quantum cryptography. PMID:28168219
High-dimensional quantum cloning and applications to quantum hacking.
Bouchard, Frédéric; Fickler, Robert; Boyd, Robert W; Karimi, Ebrahim
2017-02-01
Attempts at cloning a quantum system result in the introduction of imperfections in the state of the copies. This is a consequence of the no-cloning theorem, which is a fundamental law of quantum physics and the backbone of security for quantum communications. Although perfect copies are prohibited, a quantum state may be copied with maximal accuracy via various optimal cloning schemes. Optimal quantum cloning, which lies at the border of the physical limit imposed by the no-signaling theorem and the Heisenberg uncertainty principle, has been experimentally realized for low-dimensional photonic states. However, an increase in the dimensionality of quantum systems is greatly beneficial to quantum computation and communication protocols. Nonetheless, no experimental demonstration of optimal cloning machines has hitherto been shown for high-dimensional quantum systems. We perform optimal cloning of high-dimensional photonic states by means of the symmetrization method. We show the universality of our technique by conducting cloning of numerous arbitrary input states and fully characterize our cloning machine by performing quantum state tomography on cloned photons. In addition, a cloning attack on a Bennett and Brassard (BB84) quantum key distribution protocol is experimentally demonstrated to reveal the robustness of high-dimensional states in quantum cryptography.
Application of visual cryptography for learning in optics and photonics
NASA Astrophysics Data System (ADS)
Mandal, Avikarsha; Wozniak, Peter; Vauderwange, Oliver; Curticapean, Dan
2016-09-01
In the age data digitalization, important applications of optics and photonics based sensors and technology lie in the field of biometrics and image processing. Protecting user data in a safe and secure way is an essential task in this area. However, traditional cryptographic protocols rely heavily on computer aided computation. Secure protocols which rely only on human interactions are usually simpler to understand. In many scenarios development of such protocols are also important for ease of implementation and deployment. Visual cryptography (VC) is an encryption technique on images (or text) in which decryption is done by human visual system. In this technique, an image is encrypted into number of pieces (known as shares). When the printed shares are physically superimposed together, the image can be decrypted with human vision. Modern digital watermarking technologies can be combined with VC for image copyright protection where the shares can be watermarks (small identification) embedded in the image. Similarly, VC can be used for improving security of biometric authentication. This paper presents about design and implementation of a practical laboratory experiment based on the concept of VC for a course in media engineering. Specifically, our contribution deals with integration of VC in different schemes for applications like digital watermarking and biometric authentication in the field of optics and photonics. We describe theoretical concepts and propose our infrastructure for the experiment. Finally, we will evaluate the learning outcome of the experiment, performed by the students.
Approach to design neural cryptography: a generalized architecture and a heuristic rule.
Mu, Nankun; Liao, Xiaofeng; Huang, Tingwen
2013-06-01
Neural cryptography, a type of public key exchange protocol, is widely considered as an effective method for sharing a common secret key between two neural networks on public channels. How to design neural cryptography remains a great challenge. In this paper, in order to provide an approach to solve this challenge, a generalized network architecture and a significant heuristic rule are designed. The proposed generic framework is named as tree state classification machine (TSCM), which extends and unifies the existing structures, i.e., tree parity machine (TPM) and tree committee machine (TCM). Furthermore, we carefully study and find that the heuristic rule can improve the security of TSCM-based neural cryptography. Therefore, TSCM and the heuristic rule can guide us to designing a great deal of effective neural cryptography candidates, in which it is possible to achieve the more secure instances. Significantly, in the light of TSCM and the heuristic rule, we further expound that our designed neural cryptography outperforms TPM (the most secure model at present) on security. Finally, a series of numerical simulation experiments are provided to verify validity and applicability of our results.
Quantum Information Science: An Update
NASA Astrophysics Data System (ADS)
Kwek, L. C.; Zen, Freddy P.
2016-08-01
It is now roughly thirty years since the incipient ideas on quantum information science was concretely formalized. Over the last three decades, there has been much development in this field, and at least one technology, namely devices for quantum cryptography, is now commercialized. Yet, the holy grail of a workable quantum computing machine still lies faraway at the horizon. In any case, it took nearly several centuries before the vacuum tubes were invented after the first mechanical calculating were constructed, and several decades later, for the transistor to bring the current computer technology to fruition. In this review, we provide a short survey of the current development and progress in quantum information science. It clearly does not do justice to the amount of work in the past thirty years. Nevertheless, despite the modest attempt, this review hopes to induce younger researchers into this exciting field.
Two-out-of-two color matching based visual cryptography schemes.
Machizaud, Jacques; Fournel, Thierry
2012-09-24
Visual cryptography which consists in sharing a secret message between transparencies has been extended to color prints. In this paper, we propose a new visual cryptography scheme based on color matching. The stacked printed media reveal a uniformly colored message decoded by the human visual system. In contrast with the previous color visual cryptography schemes, the proposed one enables to share images without pixel expansion and to detect a forgery as the color of the message is kept secret. In order to correctly print the colors on the media and to increase the security of the scheme, we use spectral models developed for color reproduction describing printed colors from an optical point of view.
Philosophy of Quantum Information and Entanglement
NASA Astrophysics Data System (ADS)
Bokulich, Alisa; Jaeger, Gregg
2010-06-01
Preface; Introduction; Part I. Quantum Entanglement and Nonlocality: 1. Nonlocality beyond quantum mechanics Sandu Popescu; 2. Entanglement and subsystems, entanglement beyond subsystems, and all that Lorenza Viola and Howard Barnum; 3. Formalism locality in quantum theory and quantum gravity Lucien Hardy; Part II. Quantum Probability: 4. Bell's inequality from the contextual probabilistic viewpoint Andrei Khrennikov; 5. Probabilistic theories: what is special about quantum mechanics? Giacomo Mauro D'Ariano; 6. What probabilities tell about quantum systems, with application to entropy and entanglement John Myers and Hadi Madjid; 7. Bayesian updating and information gain in quantum measurements Leah Henderson; Part III. Quantum Information: 8. Schumacher information and the philosophy of physics Arnold Duwell; 9. From physics to information theory and back Wayne Myrvold; 10. Information, immaterialism, and instrumentalism: old and new in quantum information Chris Timpson; Part IV. Quantum Communication and Computing: 11. Quantum computation: where does the speed-up come from? Jeff Bub; 12. Quantum mechanics, quantum computing and quantum cryptography Tai Wu.
A public-key cryptosystem for quantum message transmission
NASA Astrophysics Data System (ADS)
Yang, Li
2005-01-01
We present a quantum public-key cryptography protocol for quantum message transmission. The private key of this protocol includes three classical matrices: a generator matrix of a Goppa code, an invertible matrix and a permutation matrix. The public key is product of these three matrices. The encryption and decryption algorithms are merely quantum computations related with the transformations between bases of the quantum registers. The security of this protocol is based on the hypothesis that there is no effective algorithm of NP-complete problem.
Observable measure of quantum coherence in finite dimensional systems.
Girolami, Davide
2014-10-24
Quantum coherence is the key resource for quantum technology, with applications in quantum optics, information processing, metrology, and cryptography. Yet, there is no universally efficient method for quantifying coherence either in theoretical or in experimental practice. I introduce a framework for measuring quantum coherence in finite dimensional systems. I define a theoretical measure which satisfies the reliability criteria established in the context of quantum resource theories. Then, I present an experimental scheme implementable with current technology which evaluates the quantum coherence of an unknown state of a d-dimensional system by performing two programmable measurements on an ancillary qubit, in place of the O(d2) direct measurements required by full state reconstruction. The result yields a benchmark for monitoring quantum effects in complex systems, e.g., certifying nonclassicality in quantum protocols and probing the quantum behavior of biological complexes.
Quantum Information Science Using Photons
NASA Astrophysics Data System (ADS)
Bouwmeester, D.; Howell, J. C.; Lamas-Linares, A.
Contents: 1 Introduction 1.1 A Humble Point of View 1.2 Quantum Mystery 1.3 Maxwell's Demon 1.4 Shannon Entropy 1.5 Von Neumann Entropy 2 Einstein-Podolsky-Rosen Paradox and Bell's Inequalities 3 Producing Entangled Particles 3.1 Introduction 3.2 Parametric Down-Conversion 3.3 Franson's Proposal 3.4 Polarization Entanglement 4 The Beam Splitter Action on a Two-Photon State 4.1 Beamsplitter Transformation 4.2 Bell-State Analyzer 5 No-Cloning Theorem 6 Quantum Cryptography 7 Quantum Dense Coding 7.1 Theoretical Scheme 7.2 Experimental Dense Coding with Qubits 8 Quantum Teleportation 8.1 Theoretical Scheme 8.2 Experimental Quantum Teleportation of Qubits 8.3 Teleportation of Entanglement 8.4 A Two-Particle Scheme for Quantum Teleportation 9 Teleportation of Continuous Quantum Variables 9.1 Theoretical Scheme 9.2 Quantum Optical Implementation 10 Quantum Error Detection and Correction 10.1 Introduction 10.2 Quantum Error Detection 10.3 Avoiding Controlled-NOT Operations 10.4 Post-selection 11 Stimulated Entanglement 11.1 Theory 12 Bohm-Type Spin-s Entanglements
Influence of satellite motion on polarization qubits in a Space-Earth quantum communication link.
Bonato, Cristian; Aspelmeyer, Markus; Jennewein, Thomas; Pernechele, Claudio; Villoresi, Paolo; Zeilinger, Anton
2006-10-16
In a Space quantum-cryptography experiment a satellite pointing system is needed to send single photons emitted by the source on the satellite to the polarization analysis apparatus on Earth. In this paper a simulation is presented regarding how the satellite pointing systems affect the polarization state of the single photons, to help designing a proper compensation system.
Information security: from classical to quantum
NASA Astrophysics Data System (ADS)
Barnett, Stephen M.; Brougham, Thomas
2012-09-01
Quantum cryptography was designed to provide a new approach to the problem of distributing keys for private-key cryptography. The principal idea is that security can be ensured by exploiting the laws of quantum physics and, in particular, by the fact that any attempt to measure a quantum state will change it uncontrollably. This change can be detected by the legitimate users of the communication channel and so reveal to them the presence of an eavesdropper. In this paper I explain (briefly) how quantum key distribution works and some of the progress that has been made towards making this a viable technology. With the principles of quantum communication and quantum key distribution firmly established, it is perhaps time to consider how efficient it can be made. It is interesting to ask, in particular, how many bits of information might reasonably be encoded securely on each photon. The use of photons entangled in their time of arrival might make it possible to achieve data rates in excess of 10 bits per photon.
Certified randomness in quantum physics.
Acín, Antonio; Masanes, Lluis
2016-12-07
The concept of randomness plays an important part in many disciplines. On the one hand, the question of whether random processes exist is fundamental for our understanding of nature. On the other, randomness is a resource for cryptography, algorithms and simulations. Standard methods for generating randomness rely on assumptions about the devices that are often not valid in practice. However, quantum technologies enable new methods for generating certified randomness, based on the violation of Bell inequalities. These methods are referred to as device-independent because they do not rely on any modelling of the devices. Here we review efforts to design device-independent randomness generators and the associated challenges.
Certified randomness in quantum physics
NASA Astrophysics Data System (ADS)
Acín, Antonio; Masanes, Lluis
2016-12-01
The concept of randomness plays an important part in many disciplines. On the one hand, the question of whether random processes exist is fundamental for our understanding of nature. On the other, randomness is a resource for cryptography, algorithms and simulations. Standard methods for generating randomness rely on assumptions about the devices that are often not valid in practice. However, quantum technologies enable new methods for generating certified randomness, based on the violation of Bell inequalities. These methods are referred to as device-independent because they do not rely on any modelling of the devices. Here we review efforts to design device-independent randomness generators and the associated challenges.
Network-Centric Quantum Communications
NASA Astrophysics Data System (ADS)
Hughes, Richard
2014-03-01
Single-photon quantum communications (QC) offers ``future-proof'' cryptographic security rooted in the laws of physics. Today's quantum-secured communications cannot be compromised by unanticipated future technological advances. But to date, QC has only existed in point-to-point instantiations that have limited ability to address the cyber security challenges of our increasingly networked world. In my talk I will describe a fundamentally new paradigm of network-centric quantum communications (NQC) that leverages the network to bring scalable, QC-based security to user groups that may have no direct user-to-user QC connectivity. With QC links only between each of N users and a trusted network node, NQC brings quantum security to N2 user pairs, and to multi-user groups. I will describe a novel integrated photonics quantum smartcard (``QKarD'') and its operation in a multi-node NQC test bed. The QKarDs are used to implement the quantum cryptographic protocols of quantum identification, quantum key distribution and quantum secret splitting. I will explain how these cryptographic primitives are used to provide key management for encryption, authentication, and non-repudiation for user-to-user communications. My talk will conclude with a description of a recent demonstration that QC can meet both the security and quality-of-service (latency) requirements for electric grid control commands and data. These requirements cannot be met simultaneously with present-day cryptography.
Quantum cloning disturbed by thermal Davies environment
NASA Astrophysics Data System (ADS)
Dajka, Jerzy; Łuczka, Jerzy
2016-06-01
A network of quantum gates designed to implement universal quantum cloning machine is studied. We analyze how thermal environment coupled to auxiliary qubits, `blank paper' and `toner' required at the preparation stage of copying, modifies an output fidelity of the cloner. Thermal environment is described in terms of the Markovian Davies theory. We show that such a cloning machine is not universal any more but its output is independent of at least a part of parameters of the environment. As a case study, we consider cloning of states in a six-state cryptography's protocol. We also briefly discuss cloning of arbitrary input states.
An Anti-Cheating Visual Cryptography Scheme Based on Chaotic Encryption System
NASA Astrophysics Data System (ADS)
Han, Yanyan; Xu, Zhuolin; Ge, Xiaonan; He, Wencai
By chaotic encryption system and introducing the trusted third party (TTP), in this paper, an anti-cheating visual cryptography scheme (VCS) is proposed. The scheme solved the problem of dishonest participants and improved the security of chaotic encryption system. Simulation results and analysis show that the recovery image is acceptable, the system can detect the cheating in participants effectively and with high security.
An Application-Independent Cryptography Model That Is Easy to Use for All Level Users
ERIC Educational Resources Information Center
Gabrielson, Anthony J.
2013-01-01
Cryptography libraries are inflexible and difficult for developers to integrate with their applications. These difficulties are often encountered by applications, like PGP, which are non-intuitive for end-users and are often used improperly or not at all. This thesis discusses the negative impact of the current prevailing poor usability on…
The Design and Evaluation of a Cryptography Teaching Strategy for Software Engineering Students
ERIC Educational Resources Information Center
Dowling, T.
2006-01-01
The present paper describes the design, implementation and evaluation of a cryptography module for final-year software engineering students. The emphasis is on implementation architectures and practical cryptanalysis rather than a standard mathematical approach. The competitive continuous assessment process reflects this approach and rewards…
Cryptographic Research and NSA: Report of the Public Cryptography Study Group.
ERIC Educational Resources Information Center
Davida, George I.
1981-01-01
The Public Cryptography Study Group accepted the claim made by the National Security Agency that some information in some publications concerning cryptology could be inimical to national security, and is allowing the establishment of a voluntary mechanism, on an experimental basis, for NSA to review cryptology manuscripts. (MLW)
Elliptic Curve Cryptography with Security System in Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Huang, Xu; Sharma, Dharmendra
2010-10-01
The rapid progress of wireless communications and embedded micro-electro-system technologies has made wireless sensor networks (WSN) very popular and even become part of our daily life. WSNs design are generally application driven, namely a particular application's requirements will determine how the network behaves. However, the natures of WSN have attracted increasing attention in recent years due to its linear scalability, a small software footprint, low hardware implementation cost, low bandwidth requirement, and high device performance. It is noted that today's software applications are mainly characterized by their component-based structures which are usually heterogeneous and distributed, including the WSNs. But WSNs typically need to configure themselves automatically and support as hoc routing. Agent technology provides a method for handling increasing software complexity and supporting rapid and accurate decision making. This paper based on our previous works [1, 2], three contributions have made, namely (a) fuzzy controller for dynamic slide window size to improve the performance of running ECC (b) first presented a hidden generation point for protection from man-in-the middle attack and (c) we first investigates multi-agent applying for key exchange together. Security systems have been drawing great attentions as cryptographic algorithms have gained popularity due to the natures that make them suitable for use in constrained environment such as mobile sensor information applications, where computing resources and power availability are limited. Elliptic curve cryptography (ECC) is one of high potential candidates for WSNs, which requires less computational power, communication bandwidth, and memory in comparison with other cryptosystem. For saving pre-computing storages recently there is a trend for the sensor networks that the sensor group leaders rather than sensors communicate to the end database, which highlighted the needs to prevent from the man
NASA Astrophysics Data System (ADS)
Zhang, KeJia; Zhang, Long; Song, TingTing; Yang, YingHui
2016-06-01
In this paper, we propose certain different design ideas on a novel topic in quantum cryptography — quantum operation sharing (QOS). Following these unique ideas, three QOS schemes, the "HIEC" (The scheme whose messages are hidden in the entanglement correlation), "HIAO" (The scheme whose messages are hidden with the assistant operations) and "HIMB" (The scheme whose messages are hidden in the selected measurement basis), have been presented to share the single-qubit operations determinately on target states in a remote node. These schemes only require Bell states as quantum resources. Therefore, they can be directly applied in quantum networks, since Bell states are considered the basic quantum channels in quantum networks. Furthermore, after analyse on the security and resource consumptions, the task of QOS can be achieved securely and effectively in these schemes.
Teleporting photonic qudits using multimode quantum scissors.
Goyal, Sandeep K; Konrad, Thomas
2013-12-19
Teleportation plays an important role in the communication of quantum information between the nodes of a quantum network and is viewed as an essential ingredient for long-distance Quantum Cryptography. We describe a method to teleport the quantum information carried by a photon in a superposition of a number d of light modes (a "qudit") by the help of d additional photons based on transcription. A qudit encoded into a single excitation of d light modes (in our case Laguerre-Gauss modes which carry orbital angular momentum) is transcribed to d single-rail photonic qubits, which are spatially separated. Each single-rail qubit consists of a superposition of vacuum and a single photon in each one of the modes. After successful teleportation of each of the d single-rail qubits by means of "quantum scissors" they are converted back into a qudit carried by a single photon which completes the teleportation scheme.
A broadcasting multiple blind signature scheme based on quantum GHZ entanglement
NASA Astrophysics Data System (ADS)
Tian, Yuan; Chen, Hong; Gao, Yan; Zhuang, Honglin; Lian, Haigang; Han, Zhengping; Yu, Peng; Kong, Xiangze; Wen, Xiaojun
2014-09-01
Using the correlation of the GHZ triplet states, a broadcasting multiple blind signature scheme is proposed. Different from classical multiple signature and current quantum signature schemes, which could only deliver either multiple signature or unconditional security, our scheme guarantees both by adopting quantum key preparation, quantum encryption algorithm and quantum entanglement. Our proposed scheme has the properties of multiple signature, blindness, non-disavowal, non-forgery and traceability. To the best of our knowledge, we are the first to propose the broadcasting multiple blind signature of quantum cryptography.
Reliable Freestanding Position-Based Routing in Highway Scenarios
Galaviz-Mosqueda, Gabriel A.; Aquino-Santos, Raúl; Villarreal-Reyes, Salvador; Rivera-Rodríguez, Raúl; Villaseñor-González, Luis; Edwards, Arthur
2012-01-01
Vehicular Ad Hoc Networks (VANETs) are considered by car manufacturers and the research community as the enabling technology to radically improve the safety, efficiency and comfort of everyday driving. However, before VANET technology can fulfill all its expected potential, several difficulties must be addressed. One key issue arising when working with VANETs is the complexity of the networking protocols compared to those used by traditional infrastructure networks. Therefore, proper design of the routing strategy becomes a main issue for the effective deployment of VANETs. In this paper, a reliable freestanding position-based routing algorithm (FPBR) for highway scenarios is proposed. For this scenario, several important issues such as the high mobility of vehicles and the propagation conditions may affect the performance of the routing strategy. These constraints have only been partially addressed in previous proposals. In contrast, the design approach used for developing FPBR considered the constraints imposed by a highway scenario and implements mechanisms to overcome them. FPBR performance is compared to one of the leading protocols for highway scenarios. Performance metrics show that FPBR yields similar results when considering freespace propagation conditions, and outperforms the leading protocol when considering a realistic highway path loss model. PMID:23202159
Reliable freestanding position-based routing in highway scenarios.
Galaviz-Mosqueda, Gabriel A; Aquino-Santos, Raúl; Villarreal-Reyes, Salvador; Rivera-Rodríguez, Raúl; Villaseñor-González, Luis; Edwards, Arthur
2012-10-24
Vehicular Ad Hoc Networks (VANETs) are considered by car manufacturers and the research community as the enabling technology to radically improve the safety, efficiency and comfort of everyday driving. However, before VANET technology can fulfill all its expected potential, several difficulties must be addressed. One key issue arising when working with VANETs is the complexity of the networking protocols compared to those used by traditional infrastructure networks. Therefore, proper design of the routing strategy becomes a main issue for the effective deployment of VANETs. In this paper, a reliable freestanding position-based routing algorithm (FPBR) for highway scenarios is proposed. For this scenario, several important issues such as the high mobility of vehicles and the propagation conditions may affect the performance of the routing strategy. These constraints have only been partially addressed in previous proposals. In contrast, the design approach used for developing FPBR considered the constraints imposed by a highway scenario and implements mechanisms to overcome them. FPBR performance is compared to one of the leading protocols for highway scenarios. Performance metrics show that FPBR yields similar results when considering freespace propagation conditions, and outperforms the leading protocol when considering a realistic highway path loss model.
Insecurity of quantum secure computations
NASA Astrophysics Data System (ADS)
Lo, Hoi-Kwong
1997-08-01
It had been widely claimed that quantum mechanics can protect private information during public decision in, for example, the so-called two-party secure computation. If this were the case, quantum smart-cards, storing confidential information accessible only to a proper reader, could prevent fake teller machines from learning the PIN (personal identification number) from the customers' input. Although such optimism has been challenged by the recent surprising discovery of the insecurity of the so-called quantum bit commitment, the security of quantum two-party computation itself remains unaddressed. Here I answer this question directly by showing that all one-sided two-party computations (which allow only one of the two parties to learn the result) are necessarily insecure. As corollaries to my results, quantum one-way oblivious password identification and the so-called quantum one-out-of-two oblivious transfer are impossible. I also construct a class of functions that cannot be computed securely in any two-sided two-party computation. Nevertheless, quantum cryptography remains useful in key distribution and can still provide partial security in ``quantum money'' proposed by Wiesner.
Quantum rewinding via phase estimation
NASA Astrophysics Data System (ADS)
Tabia, Gelo Noel
2015-03-01
In cryptography, the notion of a zero-knowledge proof was introduced by Goldwasser, Micali, and Rackoff. An interactive proof system is said to be zero-knowledge if any verifier interacting with an honest prover learns nothing beyond the validity of the statement being proven. With recent advances in quantum information technologies, it has become interesting to ask if classical zero-knowledge proof systems remain secure against adversaries with quantum computers. The standard approach to show the zero-knowledge property involves constructing a simulator for a malicious verifier that can be rewinded to a previous step when the simulation fails. In the quantum setting, the simulator can be described by a quantum circuit that takes an arbitrary quantum state as auxiliary input but rewinding becomes a nontrivial issue. Watrous proposed a quantum rewinding technique in the case where the simulation's success probability is independent of the auxiliary input. Here I present a more general quantum rewinding scheme that employs the quantum phase estimation algorithm. This work was funded by institutional research grant IUT2-1 from the Estonian Research Council and by the European Union through the European Regional Development Fund.
Quantum communication and information processing
NASA Astrophysics Data System (ADS)
Beals, Travis Roland
Quantum computers enable dramatically more efficient algorithms for solving certain classes of computational problems, but, in doing so, they create new problems. In particular, Shor's Algorithm allows for efficient cryptanalysis of many public-key cryptosystems. As public key cryptography is a critical component of present-day electronic commerce, it is crucial that a working, secure replacement be found. Quantum key distribution (QKD), first developed by C.H. Bennett and G. Brassard, offers a partial solution, but many challenges remain, both in terms of hardware limitations and in designing cryptographic protocols for a viable large-scale quantum communication infrastructure. In Part I, I investigate optical lattice-based approaches to quantum information processing. I look at details of a proposal for an optical lattice-based quantum computer, which could potentially be used for both quantum communications and for more sophisticated quantum information processing. In Part III, I propose a method for converting and storing photonic quantum bits in the internal state of periodically-spaced neutral atoms by generating and manipulating a photonic band gap and associated defect states. In Part II, I present a cryptographic protocol which allows for the extension of present-day QKD networks over much longer distances without the development of new hardware. I also present a second, related protocol which effectively solves the authentication problem faced by a large QKD network, thus making QKD a viable, information-theoretic secure replacement for public key cryptosystems.
Bank Transfer Over Quantum Channel With Digital Checks
Kanamori, Yoshito; Yoo, Seong-Moo; Sheldon, Frederick T
2006-01-01
In recent years, many quantum cryptographic schemes have been proposed. However, it seems that there are many technical difficulties to realize them (except Quantum Key Distributions) as practical applications. In this paper, we propose a bank transfer (i.e., funds or Electronic Funds Transfer) system utilizing both classical and quantum cryptography to provide theoretically unbreakable security. This system can be realized using current technologies (e.g., linear polarizers and Faraday rotators) and requires no additional authentication and no key distribution scheme. However, a trusted third party must keep all member banks' private keys for encryption, authentication and also for functions to generate classical digital signatures.
Three Quantum Leaps in the Development of Information Security
NASA Astrophysics Data System (ADS)
Kaijser, Per
2007-12-01
This paper gives a coarse overview of the historical development of algorithms used for information security. It is shown that the development of these encryption algorithms has been made in small incremental steps for almost 2000 years until the latter part of the last century when three revolutionary inventions were made. The main properties of these new technologies, the public key encryption method, quantum cryptography and quantum computing are explained and demonstrates why they can be seen as quantum leaps in the development of information security.
Measures and applications of quantum correlations
NASA Astrophysics Data System (ADS)
Adesso, Gerardo; Bromley, Thomas R.; Cianciaruso, Marco
2016-11-01
Quantum information theory is built upon the realisation that quantum resources like coherence and entanglement can be exploited for novel or enhanced ways of transmitting and manipulating information, such as quantum cryptography, teleportation, and quantum computing. We now know that there is potentially much more than entanglement behind the power of quantum information processing. There exist more general forms of non-classical correlations, stemming from fundamental principles such as the necessary disturbance induced by a local measurement, or the persistence of quantum coherence in all possible local bases. These signatures can be identified and are resilient in almost all quantum states, and have been linked to the enhanced performance of certain quantum protocols over classical ones in noisy conditions. Their presence represents, among other things, one of the most essential manifestations of quantumness in cooperative systems, from the subatomic to the macroscopic domain. In this work we give an overview of the current quest for a proper understanding and characterisation of the frontier between classical and quantum correlations (QCs) in composite states. We focus on various approaches to define and quantify general QCs, based on different yet interlinked physical perspectives, and comment on the operational significance of the ensuing measures for quantum technology tasks such as information encoding, distribution, discrimination and metrology. We then provide a broader outlook of a few applications in which quantumness beyond entanglement looks fit to play a key role.
On the passive probing of fiber optic quantum communication channels
Korol'kov, A. V.; Katamadze, K. G.; Kulik, S. P.; Molotkov, S. N.
2010-04-15
Avalanche photodetectors based on InGaAs:P are the most sensitive and only detectors operating in the telecommunication wavelength range 1.30-1.55 {mu}m in the fiber optic quantum cryptography systems that can operate in the single photon count mode. In contrast to the widely used silicon photodetectors for wavelengths up to 1 {mu}m operating in a waiting mode, these detectors always operate in a gated mode. The production of an electron-hole pair in the process of the absorption of a photon and the subsequent appearance of an avalanche of carriers can be accompanied by the inverse processes of the recombination and emission of photons. Such a backward emission can present a potential serious problem for the stability of fiber optic quantum cryptography systems against passive probing. The results of analyzing the detection of backscattered radiation are reported. The probability of such an emission has been estimated.
No extension of quantum theory can have improved predictive power.
Colbeck, Roger; Renner, Renato
2011-08-02
According to quantum theory, measurements generate random outcomes, in stark contrast with classical mechanics. This raises the question of whether there could exist an extension of the theory that removes this indeterminism, as suspected by Einstein, Podolsky and Rosen. Although this has been shown to be impossible, existing results do not imply that the current theory is maximally informative. Here we ask the more general question of whether any improved predictions can be achieved by any extension of quantum theory. Under the assumption that measurements can be chosen freely, we answer this question in the negative: no extension of quantum theory can give more information about the outcomes of future measurements than quantum theory itself. Our result has significance for the foundations of quantum mechanics, as well as applications to tasks that exploit the inherent randomness in quantum theory, such as quantum cryptography.
Quantum Entanglement: A Fundamental Concept Finding its Applications
NASA Astrophysics Data System (ADS)
Zeilinger, Anton
Entanglement, according to the Austrian physicist Erwin Schrödinger the Essence of Quantum Mechanics, has been known for a long time now to be the source of a number of paradoxical and counterintuitive phenomena. Of those the most remarkable one is usually called non-locality and it is at the heart of the Einstein-Podolsky-Rosen Paradox and of the fact that Quantum Mechanics violates Bell's inequalities. Recent years saw an emergence of novel ideas in entanglement of three or more particles. Most recently it turned out that entanglement is an important concept in the development of quantum communication, quantum cryptography and quantum computation. First explicit experimental realizations with two or more photons include quantum dense coding and quantum teleportation.
Memory-built-in quantum cloning in a hybrid solid-state spin register
NASA Astrophysics Data System (ADS)
Wang, W.-B.; Zu, C.; He, L.; Zhang, W.-G.; Duan, L.-M.
2015-07-01
As a way to circumvent the quantum no-cloning theorem, approximate quantum cloning protocols have received wide attention with remarkable applications. Copying of quantum states to memory qubits provides an important strategy for eavesdropping in quantum cryptography. We report an experiment that realizes cloning of quantum states from an electron spin to a nuclear spin in a hybrid solid-state spin register with near-optimal fidelity. The nuclear spin provides an ideal memory qubit at room temperature, which stores the cloned quantum states for a millisecond under ambient conditions, exceeding the lifetime of the original quantum state carried by the electron spin by orders of magnitude. The realization of a cloning machine with built-in quantum memory provides a key step for application of quantum cloning in quantum information science.
Practical secure quantum communications
NASA Astrophysics Data System (ADS)
Diamanti, Eleni
2015-05-01
We review recent advances in the field of quantum cryptography, focusing in particular on practical implementations of two central protocols for quantum network applications, namely key distribution and coin flipping. The former allows two parties to share secret messages with information-theoretic security, even in the presence of a malicious eavesdropper in the communication channel, which is impossible with classical resources alone. The latter enables two distrustful parties to agree on a random bit, again with information-theoretic security, and with a cheating probability lower than the one that can be reached in a classical scenario. Our implementations rely on continuous-variable technology for quantum key distribution and on a plug and play discrete-variable system for coin flipping, and necessitate a rigorous security analysis adapted to the experimental schemes and their imperfections. In both cases, we demonstrate the protocols with provable security over record long distances in optical fibers and assess the performance of our systems as well as their limitations. The reported advances offer a powerful toolbox for practical applications of secure communications within future quantum networks.
Color image zero-watermarking based on SVD and visual cryptography in DWT domain
NASA Astrophysics Data System (ADS)
Liu, Xilin; Chen, Beijing; Coatrieux, Gouenou; Shu, Huazhong
2017-02-01
This paper presents a novel robust color image zero-watermarking scheme based on SVD and visual cryptography. We firstly generate the image feature from the SVD of the image blocks, and then employ the visual secret sharing scheme to construct ownership share from the watermark and the image feature. The low frequency component of one level discrete wavelet transform of the color image is partitioned into blocks. Then we propose to use the feature generated from the first singular value of the blocks to construct the master share. When ownership debate occurs, the ownership share is used to extract the watermark. Experimental results show the better performance of the proposed watermarking system in terms of robustness to various attacks, including noise, filtering, JPEG compression and so on, than other visual cryptography based color image watermarking algorithm.
Quantum control on entangled bipartite qubits
Delgado, Francisco
2010-04-15
Ising interactions between qubits can produce distortion on entangled pairs generated for engineering purposes (e.g., for quantum computation or quantum cryptography). The presence of parasite magnetic fields destroys or alters the expected behavior for which it was intended. In addition, these pairs are generated with some dispersion in their original configuration, so their discrimination is necessary for applications. Nevertheless, discrimination should be made after Ising distortion. Quantum control helps in both problems; making some projective measurements upon the pair to decide the original state to replace it, or just trying to reconstruct it using some procedures which do not alter their quantum nature. Results about the performance of these procedures are reported. First, we will work with pure systems studying restrictions and advantages. Then, we will extend these operations for mixed states generated with uncertainty in the time of distortion, correcting them by assuming the control prescriptions for the most probable one.
Entropy-as-a-Service: Unlocking the Full Potential of Cryptography
Vassilev, Apostol; Staples, Robert
2016-01-01
Securing the Internet requires strong cryptography, which depends on the availability of good entropy for generating unpredictable keys and accurate clocks. Attacks abusing weak keys or old inputs portend challenges for the Internet. EaaS is a novel architecture providing entropy and timestamps from a decentralized root of trust, scaling gracefully across diverse geopolitical locales and remaining trustworthy unless much of the collective is compromised. PMID:28003687
Cryptanalysis of a Classical Chaos-Based Cryptosystem with Some Quantum Cryptography Features
NASA Astrophysics Data System (ADS)
Arroyo, David; Hernandez, Fernando; Orúe, Amalia B.
The application of synchronization theory to build new cryptosystems has been a hot topic during the last two decades. In this paper, we analyze a recent proposal in this field. We pinpoint the main limitations of the software implementation of chaos-based systems designed on the grounds of synchronization theory. In addition, we show that the cryptosystem under evaluation possesses serious security problems that imply a clear reduction of the key space.
Adaptive pixel-selection using chaotic map lattices for image cryptography
NASA Astrophysics Data System (ADS)
Sittigorn, Jirasak; Paithoonwattanakij, Kitti; Surawatpunya, Charray
2014-01-01
Chaotic theory has been used in cryptography application for generating a sequence of data that is close to pseudorandom number based on an adjusted initial condition and a parameter. However, data recovery becomes a crucial problem due to the precision of the parameters. This difficulty leads to limited usage of Chaotic-based cryptography especially for error sensitive applications such as voice cryptography. In order to enhance the encryption security and overcome this limitation, an Adaptive Pixel-Selection using Chaotic Map Lattices (APCML) is proposed. In APCML, the encryption sequence has been adaptively selected based on chaos generator. Moreover, the chaotic transformation and normalization boundary have been revised to alleviate the rounding error and inappropriate normalization boundary problems. In the experiments, the measurement indices of originality preservation, visual inspection, and statistical analysis are used to evaluate the performance of the proposed APCML compared to that of the original CML. Consequently, the APCML algorithm offers greater performance with full recovery of the original message.
Design of an Elliptic Curve Cryptography processor for RFID tag chips.
Liu, Zilong; Liu, Dongsheng; Zou, Xuecheng; Lin, Hui; Cheng, Jian
2014-09-26
Radio Frequency Identification (RFID) is an important technique for wireless sensor networks and the Internet of Things. Recently, considerable research has been performed in the combination of public key cryptography and RFID. In this paper, an efficient architecture of Elliptic Curve Cryptography (ECC) Processor for RFID tag chip is presented. We adopt a new inversion algorithm which requires fewer registers to store variables than the traditional schemes. A new method for coordinate swapping is proposed, which can reduce the complexity of the controller and shorten the time of iterative calculation effectively. A modified circular shift register architecture is presented in this paper, which is an effective way to reduce the area of register files. Clock gating and asynchronous counter are exploited to reduce the power consumption. The simulation and synthesis results show that the time needed for one elliptic curve scalar point multiplication over GF(2163) is 176.7 K clock cycles and the gate area is 13.8 K with UMC 0.13 μm Complementary Metal Oxide Semiconductor (CMOS) technology. Moreover, the low power and low cost consumption make the Elliptic Curve Cryptography Processor (ECP) a prospective candidate for application in the RFID tag chip.
Devi, B Pushpa; Singh, Kh Manglem; Roy, Sudipta
2016-01-01
This paper proposes a new watermarking algorithm based on the shuffled singular value decomposition and the visual cryptography for copyright protection of digital images. It generates the ownership and identification shares of the image based on visual cryptography. It decomposes the image into low and high frequency sub-bands. The low frequency sub-band is further divided into blocks of same size after shuffling it and then the singular value decomposition is applied to each randomly selected block. Shares are generated by comparing one of the elements in the first column of the left orthogonal matrix with its corresponding element in the right orthogonal matrix of the singular value decomposition of the block of the low frequency sub-band. The experimental results show that the proposed scheme clearly verifies the copyright of the digital images, and is robust to withstand several image processing attacks. Comparison with the other related visual cryptography-based algorithms reveals that the proposed method gives better performance. The proposed method is especially resilient against the rotation attack.
Design of an Elliptic Curve Cryptography Processor for RFID Tag Chips
Liu, Zilong; Liu, Dongsheng; Zou, Xuecheng; Lin, Hui; Cheng, Jian
2014-01-01
Radio Frequency Identification (RFID) is an important technique for wireless sensor networks and the Internet of Things. Recently, considerable research has been performed in the combination of public key cryptography and RFID. In this paper, an efficient architecture of Elliptic Curve Cryptography (ECC) Processor for RFID tag chip is presented. We adopt a new inversion algorithm which requires fewer registers to store variables than the traditional schemes. A new method for coordinate swapping is proposed, which can reduce the complexity of the controller and shorten the time of iterative calculation effectively. A modified circular shift register architecture is presented in this paper, which is an effective way to reduce the area of register files. Clock gating and asynchronous counter are exploited to reduce the power consumption. The simulation and synthesis results show that the time needed for one elliptic curve scalar point multiplication over GF(2163) is 176.7 K clock cycles and the gate area is 13.8 K with UMC 0.13 μm Complementary Metal Oxide Semiconductor (CMOS) technology. Moreover, the low power and low cost consumption make the Elliptic Curve Cryptography Processor (ECP) a prospective candidate for application in the RFID tag chip. PMID:25264952
Fault-tolerant quantum random-number generator certified by Majorana fermions
NASA Astrophysics Data System (ADS)
Deng, Dong-Ling; Duan, Lu-Ming
2013-07-01
Braiding of Majorana fermions gives accurate topological quantum operations that are intrinsically robust to noise and imperfection, providing a natural method to realize fault-tolerant quantum information processing. Unfortunately, it is known that braiding of Majorana fermions is not sufficient for the implementation of universal quantum computation. Here we show that topological manipulation of Majorana fermions provides the full set of operations required to generate random numbers by way of quantum mechanics and to certify its genuine randomness through violation of a multipartite Bell inequality. The result opens a perspective to apply Majorana fermions for the robust generation of certified random numbers, which has important applications in cryptography and other related areas.
Secure quantum signatures: a practical quantum technology (Conference Presentation)
NASA Astrophysics Data System (ADS)
Andersson, Erika
2016-10-01
Modern cryptography encompasses much more than encryption of secret messages. Signature schemes are widely used to guarantee that messages cannot be forged or tampered with, for example in e-mail, software updates and electronic commerce. Messages are also transferrable, which distinguishes digital signatures from message authentication. Transferability means that messages can be forwarded; in other words, that a sender is unlikely to be able to make one recipient accept a message which is subsequently rejected by another recipient if the message is forwarded. Similar to public-key encryption, the security of commonly used signature schemes relies on the assumed computational difficulty of problems such as finding discrete logarithms or factoring large primes. With quantum computers, such assumptions would no longer be valid. Partly for this reason, it is desirable to develop signature schemes with unconditional or information-theoretic security. Quantum signature schemes are one possible solution. Similar to quantum key distribution (QKD), their unconditional security relies only on the laws of quantum mechanics. Quantum signatures can be realized with the same system components as QKD, but are so far less investigated. This talk aims to provide an introduction to quantum signatures and to review theoretical and experimental progress so far.
Quantum key distribution with an entangled light emitting diode
Dzurnak, B.; Stevenson, R. M.; Nilsson, J.; Dynes, J. F.; Yuan, Z. L.; Skiba-Szymanska, J.; Shields, A. J.; Farrer, I.; Ritchie, D. A.
2015-12-28
Measurements performed on entangled photon pairs shared between two parties can allow unique quantum cryptographic keys to be formed, creating secure links between users. An advantage of using such entangled photon links is that they can be adapted to propagate entanglement to end users of quantum networks with only untrusted nodes. However, demonstrations of quantum key distribution with entangled photons have so far relied on sources optically excited with lasers. Here, we realize a quantum cryptography system based on an electrically driven entangled-light-emitting diode. Measurement bases are passively chosen and we show formation of an error-free quantum key. Our measurements also simultaneously reveal Bell's parameter for the detected light, which exceeds the threshold for quantum entanglement.
Improved uncertainty relation in the presence of quantum memory
NASA Astrophysics Data System (ADS)
Xiao, Yunlong; Jing, Naihuan; Fei, Shao-Ming; Li-Jost, Xianqing
2016-12-01
Berta et al’s uncertainty principle in the presence of quantum memory (Berta et al 2010 Nat. Phys. 6 659) reveals uncertainties with quantum side information between the observables. In the recent important work of Coles and Piani (2014 Phys. Rev. A 89 022112), the entropic sum is controlled by the first and second maximum overlaps between the two projective measurements. We generalize the entropic uncertainty relation in the presence of quantum memory and find the exact dependence on all d largest overlaps between two measurements on any d-dimensional Hilbert space. Our bound is rigorously shown to be strictly tighter than previous entropic bounds in the presence of quantum memory, which have potential applications to quantum cryptography with entanglement witnesses and quantum key distributions.
Authentication of quantum messages.
Barnum, Howard; Crépeau, Jean-Claude; Gottesman, D.; Smith, A.; Tapp, Alan
2001-01-01
Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical private key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In this paper we study the authentication of messages composed of quantum states. We give a formal definition of authentication in the quantum setting. Assuming A and B have access to an insecure quantum channel and share a private, classical random key, we provide a non-interactive scheme that both enables A to encrypt and authenticate (with unconditional security) an m qubit message by encoding it into m + s qubits, where the probability decreases exponentially in the security parameter s. The scheme requires a private key of size 2m + O(s). To achieve this, we give a highly efficient protocol for testing the purity of shared EPR pairs. It has long been known that learning information about a general quantum state will necessarily disturb it. We refine this result to show that such a disturbance can be done with few side effects, allowing it to circumvent cryptographic protections. Consequently, any scheme to authenticate quantum messages must also encrypt them. In contrast, no such constraint exists classically: authentication and encryption are independent tasks, and one can authenticate a message while leaving it publicly readable. This reasoning has two important consequences: On one hand, it allows us to give a lower bound of 2m key bits for authenticating m qubits, which makes our protocol asymptotically optimal. On the other hand, we use it to show that digitally signing quantum states is impossible, even with only computational security.
Ion Trap Quantum Computers: Performance Limits and Experimental Progress
NASA Astrophysics Data System (ADS)
Hughes, Richard
1998-03-01
In a quantum computer information would be represented by the quantum mechanical states of suitable atomic-scale systems. (A single bit of information represented by a two-level quantum system is known as a qubit.) This notion leads to the possibility of computing with quantum mechanical superpositions of numbers ("quantum parallelism"), which for certain problems would make Quantum/quantum.html>quantum computation very much more efficient than classical computation. The possibility of rapidly factoring the large integers used in public-key cryptography is an important example. (Public key cryptosystems derive their security from the difficuty of factoring, and similar problems, with conventional computers.) Quantum computational hardware development is in its infancy, but an experimental study of quantum computation with laser-cooled trapped calcium ions that is under way at Los Alamos will be described. One of the pricipal obstacles to practical quantum computation is the inevitable loss of quantum coherence of the complex quantum states involved. The results of a theoretical analysis showing that quantum factoring of small integers should be possible with trapped ions will be presented. The prospects for larger-scale computations will be discussed.
Bell's Theorem, Entanglement, Quantum Teleportation, and All That
Legett, Anthony
2008-03-05
One of the most surprising aspects of quantum mechanics is that under certain circumstances it does not allow individual physical systems, even when isolated, to possess properties in their own right. This feature, first clearly appreciated by John Bell in 1964, has in the last three decades been tested experimentally and found (in most people's opinion) to be spectacularly confirmed. More recently it has been realized that it permits various operations which are classically impossible, such as 'teleportation' and secure-in-principle cryptography. This talk is a very basic introduction to the subject, which requires only elementary quantum mechanics.
Bell's Theorem, Entaglement, Quantum Teleportation and All That
Anthony Leggett
2008-03-05
One of the most surprising aspects of quantum mechanics is that under certain circumstances it does not allow individual physical systems, even when isolated, to possess properties in their own right. This feature, first clearly appreciated by John Bell in 1964, has in the last three decades been tested experimentally and found (in most people's opinion) to be spectacularly confirmed. More recently it has been realized that it permits various operations which are classically impossible, such as "teleportation" and secure-in-principle cryptography. This talk is a very basic introduction to the subject, which requires only elementary quantum mechanics.
Bell's Theorem, Entaglement, Quantum Teleportation and All That
Anthony Leggett
2016-07-12
One of the most surprising aspects of quantum mechanics is that under certain circumstances it does not allow individual physical systems, even when isolated, to possess properties in their own right. This feature, first clearly appreciated by John Bell in 1964, has in the last three decades been tested experimentally and found (in most people's opinion) to be spectacularly confirmed. More recently it has been realized that it permits various operations which are classically impossible, such as "teleportation" and secure-in-principle cryptography. This talk is a very basic introduction to the subject, which requires only elementary quantum mechanics.
Entanglement enhances security in quantum communication
Demkowicz-Dobrzanski, Rafal; Sen, Aditi; Sen, Ujjwal; Lewenstein, Maciej
2009-07-15
Secret sharing is a protocol in which a 'boss' wants to send a classical message secretly to two 'subordinates', such that none of the subordinates is able to know the message alone, while they can find it if they cooperate. Quantum mechanics is known to allow for such a possibility. We analyze tolerable quantum bit error rates in such secret sharing protocols in the physically relevant case when the eavesdropping is local with respect to the two channels of information transfer from the boss to the two subordinates. We find that using entangled encoding states is advantageous to legitimate users of the protocol. We therefore find that entanglement is useful for secure quantum communication. We also find that bound entangled states with positive partial transpose are not useful as a local eavesdropping resource. Moreover, we provide a criterion for security in secret sharing--a parallel of the Csiszar-Koerner criterion in single-receiver classical cryptography.
Quantum entanglement assisted key distribution
NASA Astrophysics Data System (ADS)
Tang, Ke; Ji, Ping; Zhang, Xiaowen
2007-04-01
Quantum correlations or entanglement is a basic ingredient for many applications of quantum information theory.One important application using quantum entanglement exploits the correlation nature of entangled photon states is quantum key distribution, which is proven unbreakable in principle and provides the highest possible security that is impossible in classical information theory. However, generating entangled photon pairs is not a simple task -- only approximately one out of a million pump photons decay into a signal and idler photon pair. This low rate of entangled photon pairs is further reduced by the overhead required in order for the rectification of the inevitable errors due to channel imperfections or caused by potential eavesdroppers. As a consequence, quantum key distribution suffers from a low bit rate, which is in the order of hundreds to thousands bits per second or below. On the other hand, the classical public key distribution does not impose a tight limit on the transmission rate. However, it is subject to the risks of eavesdroppers sitting in the middle of the insecure channel. In this paper, we propose a hybrid key distribution method which uses public key distribution method to generate a raw key, and then uses entanglement assisted communication to modify the raw key by inserting a number of quantum bits in the raw key. Building upon the foundation of the unconditional security of quantum key distribution, we use the privacy amplification to make the affection of inserted bits expand to a whole key. Our quantum entanglement assisted key distribution scheme greatly improves the efficiency of key distribution while without compromising the level of security achievable by quantum cryptography.
Quantum key distribution session with 16-dimensional photonic states
Etcheverry, S.; Cañas, G.; Gómez, E. S.; Nogueira, W. A. T.; Saavedra, C.; Xavier, G. B.; Lima, G.
2013-01-01
The secure transfer of information is an important problem in modern telecommunications. Quantum key distribution (QKD) provides a solution to this problem by using individual quantum systems to generate correlated bits between remote parties, that can be used to extract a secret key. QKD with D-dimensional quantum channels provides security advantages that grow with increasing D. However, the vast majority of QKD implementations has been restricted to two dimensions. Here we demonstrate the feasibility of using higher dimensions for real-world quantum cryptography by performing, for the first time, a fully automated QKD session based on the BB84 protocol with 16-dimensional quantum states. Information is encoded in the single-photon transverse momentum and the required states are dynamically generated with programmable spatial light modulators. Our setup paves the way for future developments in the field of experimental high-dimensional QKD. PMID:23897033
Disorder generated by interacting neural networks: application to econophysics and cryptography
NASA Astrophysics Data System (ADS)
Kinzel, Wolfgang; Kanter, Ido
2003-10-01
When neural networks are trained on their own output signals they generate disordered time series. In particular, when two neural networks are trained on their mutual output they can synchronize; they relax to a time-dependent state with identical synaptic weights. Two applications of this phenomenon are discussed for (a) econophysics and (b) cryptography. (a) When agents competing in a closed market (minority game) are using neural networks to make their decisions, the total system relaxes to a state of good performance. (b) Two partners communicating over a public channel can find a common secret key.
Design and Implementation of KSP on the Next Generation Cryptography API
NASA Astrophysics Data System (ADS)
Lina, Zhang
With good seamless connectivity and higher safety, KSP (Key Storage Providers) is the inexorable trend of security requirements and development to take the place of CSP (Cryptographic Service Provider). But the study on KSP has just started in our country, and almost no reports of its implementation can be found. Based on the analysis of function modules and the architecture of Cryptography API (Next Generation (CNG)), this paper discusses the design and implementation of KSP (key storage providers) based on smart card in detail, and an example is also presented to illustrate how to use KSP in Windows Vista.
Jin, Chunhua; Xu, Chunxiang; Zhang, Xiaojun; Zhao, Jining
2015-03-01
Radio Frequency Identification(RFID) is an automatic identification technology, which can be widely used in healthcare environments to locate and track staff, equipment and patients. However, potential security and privacy problems in RFID system remain a challenge. In this paper, we design a mutual authentication protocol for RFID based on elliptic curve cryptography(ECC). We use pre-computing method within tag's communication, so that our protocol can get better efficiency. In terms of security, our protocol can achieve confidentiality, unforgeability, mutual authentication, tag's anonymity, availability and forward security. Our protocol also can overcome the weakness in the existing protocols. Therefore, our protocol is suitable for healthcare environments.
Quantum Attack-Resistent Certificateless Multi-Receiver Signcryption Scheme
Li, Huixian; Chen, Xubao; Pang, Liaojun; Shi, Weisong
2013-01-01
The existing certificateless signcryption schemes were designed mainly based on the traditional public key cryptography, in which the security relies on the hard problems, such as factor decomposition and discrete logarithm. However, these problems will be easily solved by the quantum computing. So the existing certificateless signcryption schemes are vulnerable to the quantum attack. Multivariate public key cryptography (MPKC), which can resist the quantum attack, is one of the alternative solutions to guarantee the security of communications in the post-quantum age. Motivated by these concerns, we proposed a new construction of the certificateless multi-receiver signcryption scheme (CLMSC) based on MPKC. The new scheme inherits the security of MPKC, which can withstand the quantum attack. Multivariate quadratic polynomial operations, which have lower computation complexity than bilinear pairing operations, are employed in signcrypting a message for a certain number of receivers in our scheme. Security analysis shows that our scheme is a secure MPKC-based scheme. We proved its security under the hardness of the Multivariate Quadratic (MQ) problem and its unforgeability under the Isomorphism of Polynomials (IP) assumption in the random oracle model. The analysis results show that our scheme also has the security properties of non-repudiation, perfect forward secrecy, perfect backward secrecy and public verifiability. Compared with the existing schemes in terms of computation complexity and ciphertext length, our scheme is more efficient, which makes it suitable for terminals with low computation capacity like smart cards. PMID:23967037
Quantum attack-resistent certificateless multi-receiver signcryption scheme.
Li, Huixian; Chen, Xubao; Pang, Liaojun; Shi, Weisong
2013-01-01
The existing certificateless signcryption schemes were designed mainly based on the traditional public key cryptography, in which the security relies on the hard problems, such as factor decomposition and discrete logarithm. However, these problems will be easily solved by the quantum computing. So the existing certificateless signcryption schemes are vulnerable to the quantum attack. Multivariate public key cryptography (MPKC), which can resist the quantum attack, is one of the alternative solutions to guarantee the security of communications in the post-quantum age. Motivated by these concerns, we proposed a new construction of the certificateless multi-receiver signcryption scheme (CLMSC) based on MPKC. The new scheme inherits the security of MPKC, which can withstand the quantum attack. Multivariate quadratic polynomial operations, which have lower computation complexity than bilinear pairing operations, are employed in signcrypting a message for a certain number of receivers in our scheme. Security analysis shows that our scheme is a secure MPKC-based scheme. We proved its security under the hardness of the Multivariate Quadratic (MQ) problem and its unforgeability under the Isomorphism of Polynomials (IP) assumption in the random oracle model. The analysis results show that our scheme also has the security properties of non-repudiation, perfect forward secrecy, perfect backward secrecy and public verifiability. Compared with the existing schemes in terms of computation complexity and ciphertext length, our scheme is more efficient, which makes it suitable for terminals with low computation capacity like smart cards.
Quantum crytography over 14km of installed optical fiber
Hughes, R.J.; Luther, G.G.; Morgan, G.L.; Simmons, C.
1995-09-01
We have made the first demonstration that low error rate quantum cryptography over long distances (14km) of installed optical fiber in a real-world environment, subject to uncontrolled temperature and mechanical influences, representing an important new step towards incorporation of quantum cryptography into existing information security systems. We also point out that the high visibility single-photon interference in our experiment allows us to infer a test of the superposition principle of quantum mechanics: a photon reaching the detector has traveled over 14km of optical fiber in a wavepacket comprising a coherent superposition of two components that are spatially separated by about 2m. In principle, there are decoherence processes (or even possible modifications of quantum mechanics) that could cause the photon`s wavefunction to collapse into one component or the other during propagation, leading to a reduction in visibility. However, our results are consistent with no such loss of quantum coherence during the 67-{mu}s propagation time.
On the number of entangled qubits in quantum wireless sensor networks
NASA Astrophysics Data System (ADS)
Mohapatra, Amit Kumar; Balakrishnan, S.
2016-08-01
Wireless sensor networks (WSNs) can take the advantages by utilizing the security schemes based on the concepts of quantum computation and cryptography. However, quantum wireless sensor networks (QWSNs) are shown to have many practical constraints. One of the constraints is the number of entangled qubits which is very high in the quantum security scheme proposed by [Nagy et al., Nat. Comput. 9 (2010) 819]. In this work, we propose a modification of the security scheme introduced by Nagy et al. and hence the reduction in the number of entangled qubits is shown. Further, the modified scheme can overcome some of the constraints in the QWSNs.
Improving the security of arbitrated quantum signature against the forgery attack
NASA Astrophysics Data System (ADS)
Zhang, Ke-Jia; Zhang, Wei-Wei; Li, Dan
2013-08-01
As a feasible model for signing quantum messages, some cryptanalysis and improvement of arbitrated quantum signature (AQS) have received a great deal of attentions in recent years. However, in this paper we find the previous improvement is not suitable implemented in some typical AQS protocols in the sense that the receiver, Bob, can forge a valid signature under known message attack. We describe the forgery strategy and present some corresponding improved strategies to stand against the forgery attack by modifying the encryption algorithm, an important part of AQS. These works preserve the merits of AQS and lead some potential improvements of the security in quantum signature or other cryptography problems.
A quantum Fredkin gate (Conference Presentation)
NASA Astrophysics Data System (ADS)
Patel, Raj B.; Ho, Joseph; Ferreyrol, Franck; Ralph, Timothy C.; Pryde, Geoff J.
2016-10-01
One of the greatest challenges in modern science is the realisation of quantum computers which, as their scale increases, will allow enhanced performance of tasks across many areas of quantum information processing. Quantum logic gates play a vital role in realising these applications by carrying out the elementary operations on the qubits; a key aim is minimising the resources needed to build these gates into useful circuits. While the salient features of a quantum computer have been shown in proof-of-principle experiments, e.g., single- and two-qubit gates, difficulties in scaling quantum systems to encode and manipulate multiple qubits has hindered demonstrations of more complex operations. This is exemplified by the classical Fredkin (or controlled-SWAP) gate [1] for which, despite many theoretical proposals [2,3] relying on concatenating multiple two-qubit gates, a quantum analogue has yet to be realised. Here, by directly adding control to a two-qubit SWAP unitary [4], we use photonic qubit logic to report the first experimental demonstration of a quantum Fredkin gate [5]. Our scheme uses linear optics and improves on the overall probability of success by an order of magnitude over previous proposals [2,3]. This optical approach allows us to add control an arbitrary black-box unitary which is otherwise forbidden in the standard circuit model [6]. Additionally, the action of our gate exhibits quantum coherence allowing the generation of the highest fidelity three-photon GHZ states to date. The quantum Fredkin gate has many applications in quantum computing, quantum measurements [7] and cryptography [8,9]. Using our scheme, we apply the Fredkin gate to the task of direct measurements of the purity and state overlap of a quantum system [7] without recourse to quantum state tomography.
Fully integrated quantum photonic circuit with an electrically driven light source
NASA Astrophysics Data System (ADS)
Khasminskaya, Svetlana; Pyatkov, Felix; Słowik, Karolina; Ferrari, Simone; Kahl, Oliver; Kovalyuk, Vadim; Rath, Patrik; Vetter, Andreas; Hennrich, Frank; Kappes, Manfred M.; Gol'Tsman, G.; Korneev, A.; Rockstuhl, Carsten; Krupke, Ralph; Pernice, Wolfram H. P.
2016-11-01
Photonic quantum technologies allow quantum phenomena to be exploited in applications such as quantum cryptography, quantum simulation and quantum computation. A key requirement for practical devices is the scalable integration of single-photon sources, detectors and linear optical elements on a common platform. Nanophotonic circuits enable the realization of complex linear optical systems, while non-classical light can be measured with waveguide-integrated detectors. However, reproducible single-photon sources with high brightness and compatibility with photonic devices remain elusive for fully integrated systems. Here, we report the observation of antibunching in the light emitted from an electrically driven carbon nanotube embedded within a photonic quantum circuit. Non-classical light generated on chip is recorded under cryogenic conditions with waveguide-integrated superconducting single-photon detectors, without requiring optical filtering. Because exclusively scalable fabrication and deposition methods are used, our results establish carbon nanotubes as promising nanoscale single-photon emitters for hybrid quantum photonic devices.
NASA Astrophysics Data System (ADS)
Bartkiewicz, Karol; Černoch, Antonín; Lemr, Karel; Miranowicz, Adam; Nori, Franco
2016-06-01
Temporal steering, which is a temporal analog of Einstein-Podolsky-Rosen steering, refers to temporal quantum correlations between the initial and final state of a quantum system. Our analysis of temporal steering inequalities in relation to the average quantum bit error rates reveals the interplay between temporal steering and quantum cloning, which guarantees the security of quantum key distribution based on mutually unbiased bases against individual attacks. The key distributions analyzed here include the Bennett-Brassard 1984 protocol and the six-state 1998 protocol by Bruss. Moreover, we define a temporal steerable weight, which enables us to identify a kind of monogamy of temporal correlation that is essential to quantum cryptography and useful for analyzing various scenarios of quantum causality.
Quantum Control of Light and Matter: From the Macroscopic to the Nano Scale
2016-02-02
with high- efficiency (> 50%) optical storage and read-out have been achieved 1-7, but the longest demonstrated storage times in these systems are...times of 0.5 minutes! We observed storage of single-photon pulses in the condensates, with unprecedented long storage times and high efficiency for...over long distances, which is essential for quantum cryptography. We have built a compact system for integrating BECs with nanoscale structures and have
Efficient quantum optical state engineering and applications
NASA Astrophysics Data System (ADS)
McCusker, Kevin T.
Over a century after the modern prediction of the existence of individual particles of light by Albert Einstein, a reliable source of this simple quantum state of one photon does not exist. While common light sources such as a light bulb, LED, or laser can produce a pulse of light with an average of one photon, there is (currently) no way of knowing the number of photons in that pulse without first absorbing (and thereby destroying) them. Spontaneous parametric down-conversion, a process in which one high-energy photon splits into two lower-energy photons, allows us to prepare a single-photon state by detecting one of the photons, which then heralds the existence of its twin. This process has been the workhorse of quantum optics, allowing demonstrations of a myriad of quantum processes and protocols, such as entanglement, cryptography, superdense coding, teleportation, and simple quantum computing demonstrations. All of these processes would benefit from better engineering of the underlying down-conversion process, but despite significant effort (both theoretical and experimental), optimization of this process is ongoing. The focus of this work is to optimize certain aspects of a down-conversion source, and then use this tool in novel experiments not otherwise feasible. Specifically, the goal is to optimize the heralding efficiency of the down-conversion photons, i.e., the probability that if one photon is detected, the other photon is also detected. This source is then applied to two experiments (a single-photon source, and a quantum cryptography implementation), and the detailed theory of an additional application (a source of Fock states and path-entangled states, called N00N states) is discussed, along with some other possible applications.
Leone, Loredana; Pezzella, Alessandro; Crescenzi, Orlando; Napolitano, Alessandra; Barone, Vincenzo; d'Ischia, Marco
2015-06-01
Current molecular cryptography (MoCryp) systems are almost exclusively based on DNA chemistry and reports of cryptography technologies based on other less complex chemical systems are lacking. We describe herein, as proof of concept, the prototype of the first asymmetric MoCryp system, based on an 8-compound set of a novel bioinspired class of cyanine-type dyes called trichocyanines. These novel acidichromic cyanine-type dyes inspired by red hair pigments were synthesized and characterized with the aid of density functional theory (DFT) calculations. Trichocyanines consist of a modular scaffold easily accessible via an expedient condensation of 3-phenyl- or 3-methyl-2H-1,4-benzothiazines with N-dimethyl- or o-methoxyhydroxy-substituted benzaldehyde or cinnamaldehyde derivatives. The eight representative members synthesized herein can be classified as belonging to two three-state systems tunable through four different control points. This versatile dye platform can generate an expandable palette of colors and appears to be specifically suited to implement an unprecedented single-use asymmetric molecular cryptography system. With this system, we intend to pioneer the translation of digital public-key cryptography into a chemical-coding one-time-pad-like system.
Leone, Loredana; Pezzella, Alessandro; Crescenzi, Orlando; Napolitano, Alessandra; Barone, Vincenzo; d’Ischia, Marco
2015-01-01
Current molecular cryptography (MoCryp) systems are almost exclusively based on DNA chemistry and reports of cryptography technologies based on other less complex chemical systems are lacking. We describe herein, as proof of concept, the prototype of the first asymmetric MoCryp system, based on an 8-compound set of a novel bioinspired class of cyanine-type dyes called trichocyanines. These novel acidichromic cyanine-type dyes inspired by red hair pigments were synthesized and characterized with the aid of density functional theory (DFT) calculations. Trichocyanines consist of a modular scaffold easily accessible via an expedient condensation of 3-phenyl- or 3-methyl-2H-1,4-benzothiazines with N-dimethyl- or o-methoxyhydroxy-substituted benzaldehyde or cinnamaldehyde derivatives. The eight representative members synthesized herein can be classified as belonging to two three-state systems tunable through four different control points. This versatile dye platform can generate an expandable palette of colors and appears to be specifically suited to implement an unprecedented single-use asymmetric molecular cryptography system. With this system, we intend to pioneer the translation of digital public-key cryptography into a chemical-coding one-time-pad-like system. PMID:26246999
Robust quantum data locking from phase modulation
NASA Astrophysics Data System (ADS)
Lupo, Cosmo; Wilde, Mark M.; Lloyd, Seth
2014-08-01
Quantum data locking is a uniquely quantum phenomenon that allows a relatively short key of constant size to (un)lock an arbitrarily long message encoded in a quantum state, in such a way that an eavesdropper who measures the state but does not know the key has essentially no information about the message. The application of quantum data locking in cryptography would allow one to overcome the limitations of the one-time pad encryption, which requires the key to have the same length as the message. However, it is known that the strength of quantum data locking is also its Achilles heel, as the leakage of a few bits of the key or the message may in principle allow the eavesdropper to unlock a disproportionate amount of information. In this paper we show that there exist quantum data locking schemes that can be made robust against information leakage by increasing the length of the key by a proportionate amount. This implies that a constant size key can still lock an arbitrarily long message as long as a fraction of it remains secret to the eavesdropper. Moreover, we greatly simplify the structure of the protocol by proving that phase modulation suffices to generate strong locking schemes, paving the way to optical experimental realizations. Also, we show that successful data locking protocols can be constructed using random code words, which very well could be helpful in discovering random codes for data locking over noisy quantum channels.
BOOK REVIEW Quantum Measurement and Control Quantum Measurement and Control
NASA Astrophysics Data System (ADS)
Kiefer, Claus
2010-12-01
In the last two decades there has been an enormous progress in the experimental investigation of single quantum systems. This progress covers fields such as quantum optics, quantum computation, quantum cryptography, and quantum metrology, which are sometimes summarized as `quantum technologies'. A key issue there is entanglement, which can be considered as the characteristic feature of quantum theory. As disparate as these various fields maybe, they all have to deal with a quantum mechanical treatment of the measurement process and, in particular, the control process. Quantum control is, according to the authors, `control for which the design requires knowledge of quantum mechanics'. Quantum control situations in which measurements occur at important steps are called feedback (or feedforward) control of quantum systems and play a central role here. This book presents a comprehensive and accessible treatment of the theoretical tools that are needed to cope with these situations. It also provides the reader with the necessary background information about the experimental developments. The authors are both experts in this field to which they have made significant contributions. After an introduction to quantum measurement theory and a chapter on quantum parameter estimation, the central topic of open quantum systems is treated at some length. This chapter includes a derivation of master equations, the discussion of the Lindblad form, and decoherence - the irreversible emergence of classical properties through interaction with the environment. A separate chapter is devoted to the description of open systems by the method of quantum trajectories. Two chapters then deal with the central topic of quantum feedback control, while the last chapter gives a concise introduction to one of the central applications - quantum information. All sections contain a bunch of exercises which serve as a useful tool in learning the material. Especially helpful are also various separate
LDRD final report on quantum computing using interacting semiconductor quantum wires.
Lyo, Sungkwun Kenneth; Dunn, Roberto G.; Lilly, Michael Patrick; Tibbetts, Denise R. ); Stephenson, Larry L.; Seamons, John Andrew; Reno, John Louis; Bielejec, Edward Salvador; Simmons, Jerry Alvon
2006-01-01
For several years now quantum computing has been viewed as a new paradigm for certain computing applications. Of particular importance to this burgeoning field is the development of an algorithm for factoring large numbers which obviously has deep implications for cryptography and national security. Implementation of these theoretical ideas faces extraordinary challenges in preparing and manipulating quantum states. The quantum transport group at Sandia has demonstrated world-leading, unique double quantum wires devices where we have unprecedented control over the coupling strength, number of 1 D channels, overlap and interaction strength in this nanoelectronic system. In this project, we study 1D-1D tunneling with the ultimate aim of preparing and detecting quantum states of the coupled wires. In a region of strong tunneling, electrons can coherently oscillate from one wire to the other. By controlling the velocity of the electrons, length of the coupling region and tunneling strength we will attempt to observe tunneling oscillations. This first step is critical for further development double quantum wires into the basic building block for a quantum computer, and indeed for other coupled nanoelectronic devices that will rely on coherent transport. If successful, this project will have important implications for nanoelectronics, quantum computing and information technology.
Quantum secure direct communication with frequency coding scheme
NASA Astrophysics Data System (ADS)
Zhao, Xue-Liang; Ruan, Dong
2016-11-01
Quantum secure direct communication (QSDC) is an important branch of quantum cryptography. It can transmit secret information directly without establishing a key first, unlike quantum key distribution which requires this precursive event. One of the most highlighted QSDC protocol is the Two-step protocol. This paper will focus on proposing a frequency coding scheme in the Two-step protocol, while retaining other contents of the QSDC protocol. This new coding scheme will significantly increase the protocol's ability against channel noise and loss, and provides an efficient protocol for secure direct quantum communication in a noisy environment. Besides, the frequency coding technology is also easy to understand and highly practical. After numerically simulating the performance of the protocol in a noisy channel, the results showed that the scheme was robust against channel noise and loss.
Loss-tolerant quantum secure positioning with weak laser sources
Lim, Charles Ci Wen; Xu, Feihu; Siopsis, George; Chitambar, Eric; Evans, Philip G.; Qi, Bing
2016-09-14
Quantum position verification (QPV) is the art of verifying the geographical location of an untrusted party. It has recently been shown that the widely studied Bennett & Brassard 1984 (BB84) QPV protocol is insecure after the 3 dB loss point assuming local operations and classical communication (LOCC) adversaries. Here in this paper, we propose a time-reversed entanglement swapping QPV protocol (based on measurement-device-independent quantum cryptography) that is highly robust against quantum channel loss. First, assuming ideal qubit sources, we show that the protocol is secure against LOCC adversaries for any quantum channel loss, thereby overcoming the 3 dB loss limit. Then, we analyze the security of the protocol in a more practical setting involving weak laser sources and linear optics. Lastly, in this setting, we find that the security only degrades by an additive constant and the protocol is able to verify positions up to 47 dB channel loss.
Enhanced security for multi-detector quantum random number generators
NASA Astrophysics Data System (ADS)
Marangon, Davide G.; Vallone, Giuseppe; Zanforlin, Ugo; Villoresi, Paolo
2016-11-01
Quantum random number generators (QRNG) represent an advanced solution for randomness generation, which is essential in every cryptographic application. In this context, integrated arrays of single-photon detectors have promising applications as QRNGs based on the spatial detection of photons. For the employment of QRNGs in cryptography, it is necessary to have efficient methods to evaluate the so-called quantum min-entropy that corresponds to the amount of the true extractable quantum randomness from the QRNG. Here, we present an efficient method that allows the estimation of the quantum min-entropy for a multi-detector QRNG. In particular, we consider a scenario in which an attacker can control the efficiency of the detectors and knows the emitted number of photons. Eventually, we apply the method to a QRNG with 103 detectors.
Fault tolerant quantum random number generator certified by Majorana fermions
NASA Astrophysics Data System (ADS)
Deng, Dong-Ling; Duan, Lu-Ming
2013-03-01
Braiding of Majorana fermions gives accurate topological quantum operations that are intrinsically robust to noise and imperfection, providing a natural method to realize fault-tolerant quantum information processing. Unfortunately, it is known that braiding of Majorana fermions is not sufficient for implementation of universal quantum computation. Here we show that topological manipulation of Majorana fermions provides the full set of operations required to generate random numbers by way of quantum mechanics and to certify its genuine randomness through violation of a multipartite Bell inequality. The result opens a new perspective to apply Majorana fermions for robust generation of certified random numbers, which has important applications in cryptography and other related areas. This work was supported by the NBRPC (973 Program) 2011CBA00300 (2011CBA00302), the IARPA MUSIQC program, the ARO and the AFOSR MURI program.
Loss-tolerant quantum secure positioning with weak laser sources
NASA Astrophysics Data System (ADS)
Lim, Charles Ci Wen; Xu, Feihu; Siopsis, George; Chitambar, Eric; Evans, Philip G.; Qi, Bing
2016-09-01
Quantum position verification (QPV) is the art of verifying the geographical location of an untrusted party. Recently, it has been shown that the widely studied Bennett & Brassard 1984 (BB84) QPV protocol is insecure after the 3 dB loss point assuming local operations and classical communication (LOCC) adversaries. Here, we propose a time-reversed entanglement swapping QPV protocol (based on measurement-device-independent quantum cryptography) that is highly robust against quantum channel loss. First, assuming ideal qubit sources, we show that the protocol is secure against LOCC adversaries for any quantum channel loss, thereby overcoming the 3 dB loss limit. Then, we analyze the security of the protocol in a more practical setting involving weak laser sources and linear optics. In this setting, we find that the security only degrades by an additive constant and the protocol is able to verify positions up to 47 dB channel loss.
Long-distance continuous-variable quantum key distribution by controlling excess noise
Huang, Duan; Huang, Peng; Lin, Dakai; Zeng, Guihua
2016-01-01
Quantum cryptography founded on the laws of physics could revolutionize the way in which communication information is protected. Significant progresses in long-distance quantum key distribution based on discrete variables have led to the secure quantum communication in real-world conditions being available. However, the alternative approach implemented with continuous variables has not yet reached the secure distance beyond 100 km. Here, we overcome the previous range limitation by controlling system excess noise and report such a long distance continuous-variable quantum key distribution experiment. Our result paves the road to the large-scale secure quantum communication with continuous variables and serves as a stepping stone in the quest for quantum network. PMID:26758727
Long-distance continuous-variable quantum key distribution by controlling excess noise
NASA Astrophysics Data System (ADS)
Huang, Duan; Huang, Peng; Lin, Dakai; Zeng, Guihua
2016-01-01
Quantum cryptography founded on the laws of physics could revolutionize the way in which communication information is protected. Significant progresses in long-distance quantum key distribution based on discrete variables have led to the secure quantum communication in real-world conditions being available. However, the alternative approach implemented with continuous variables has not yet reached the secure distance beyond 100 km. Here, we overcome the previous range limitation by controlling system excess noise and report such a long distance continuous-variable quantum key distribution experiment. Our result paves the road to the large-scale secure quantum communication with continuous variables and serves as a stepping stone in the quest for quantum network.
Zhang, Zezhong; Qi, Qingqing
2014-05-01
Medication errors are very dangerous even fatal since it could cause serious even fatal harm to patients. In order to reduce medication errors, automated patient medication systems using the Radio Frequency Identification (RFID) technology have been used in many hospitals. The data transmitted in those medication systems is very important and sensitive. In the past decade, many security protocols have been proposed to ensure its secure transition attracted wide attention. Due to providing mutual authentication between the medication server and the tag, the RFID authentication protocol is considered as the most important security protocols in those systems. In this paper, we propose a RFID authentication protocol to enhance patient medication safety using elliptic curve cryptography (ECC). The analysis shows the proposed protocol could overcome security weaknesses in previous protocols and has better performance. Therefore, the proposed protocol is very suitable for automated patient medication systems.
A User Authentication Scheme Based on Elliptic Curves Cryptography for Wireless Ad Hoc Networks.
Chen, Huifang; Ge, Linlin; Xie, Lei
2015-07-14
The feature of non-infrastructure support in a wireless ad hoc network (WANET) makes it suffer from various attacks. Moreover, user authentication is the first safety barrier in a network. A mutual trust is achieved by a protocol which enables communicating parties to authenticate each other at the same time and to exchange session keys. For the resource-constrained WANET, an efficient and lightweight user authentication scheme is necessary. In this paper, we propose a user authentication scheme based on the self-certified public key system and elliptic curves cryptography for a WANET. Using the proposed scheme, an efficient two-way user authentication and secure session key agreement can be achieved. Security analysis shows that our proposed scheme is resilient to common known attacks. In addition, the performance analysis shows that our proposed scheme performs similar or better compared with some existing user authentication schemes.
A User Authentication Scheme Based on Elliptic Curves Cryptography for Wireless Ad Hoc Networks
Chen, Huifang; Ge, Linlin; Xie, Lei
2015-01-01
The feature of non-infrastructure support in a wireless ad hoc network (WANET) makes it suffer from various attacks. Moreover, user authentication is the first safety barrier in a network. A mutual trust is achieved by a protocol which enables communicating parties to authenticate each other at the same time and to exchange session keys. For the resource-constrained WANET, an efficient and lightweight user authentication scheme is necessary. In this paper, we propose a user authentication scheme based on the self-certified public key system and elliptic curves cryptography for a WANET. Using the proposed scheme, an efficient two-way user authentication and secure session key agreement can be achieved. Security analysis shows that our proposed scheme is resilient to common known attacks. In addition, the performance analysis shows that our proposed scheme performs similar or better compared with some existing user authentication schemes. PMID:26184224
NASA Astrophysics Data System (ADS)
Zhao, Tieyu; Ran, Qiwen; Yuan, Lin; Chi, Yingying; Ma, Jing
2015-09-01
In this paper, a novel image encryption system with fingerprint used as a secret key is proposed based on the phase retrieval algorithm and RSA public key algorithm. In the system, the encryption keys include the fingerprint and the public key of RSA algorithm, while the decryption keys are the fingerprint and the private key of RSA algorithm. If the users share the fingerprint, then the system will meet the basic agreement of asymmetric cryptography. The system is also applicable for the information authentication. The fingerprint as secret key is used in both the encryption and decryption processes so that the receiver can identify the authenticity of the ciphertext by using the fingerprint in decryption process. Finally, the simulation results show the validity of the encryption scheme and the high robustness against attacks based on the phase retrieval technique.
Two-layer tree-connected feed-forward neural network model for neural cryptography
NASA Astrophysics Data System (ADS)
Lei, Xinyu; Liao, Xiaofeng; Chen, Fei; Huang, Tingwen
2013-03-01
Neural synchronization by means of mutual learning provides an avenue to design public key exchange protocols, bringing about what is known as neural cryptography. Two identically structured neural networks learn from each other and reach full synchronization eventually. The full synchronization enables two networks to have the same weight, which can be used as a secret key for many subsequent cryptographic purposes. It is striking to observe that after the first decade of neural cryptography, the tree parity machine (TPM) network with hidden unit K=3 appears to be the sole network that is suitable for a neural protocol. No convincingly secure neural protocol is well designed by using other network structures despite considerable research efforts. With the goal of overcoming the limitations of a suitable network structure, in this paper we develop a two-layer tree-connected feed-forward neural network (TTFNN) model for a neural protocol. The TTFNN model captures the notion that two partners are capable of exchanging a vector with multiple bits in each time step. An in-depth study of the dynamic process of TTFNN-based protocols is then undertaken, based upon which a feasible condition is theoretically obtained to seek applicable protocols. Afterward, according to two analytically derived heuristic rules, a complete methodology for designing feasible TTFNN-based protocols is elaborated. A variety of feasible neural protocols are constructed, which exhibit the effectiveness and benefits of the proposed model. With another look from the perspective of application, TTFNN-based instances, which can outperform the conventional TPM-based protocol with respect to synchronization speed, are also experimentally confirmed.
Memory assisted free space quantum communication
NASA Astrophysics Data System (ADS)
Jordaan, Bertus; Namazi, Mehdi; Goham, Connor; Shahrokhshahi, Reihaneh; Vallone, Giuseppe; Villoresi, Paolo; Figueroa, Eden
2016-05-01
A quantum memory assisted node between different quantum channels has the capability to modify and synchronize its output, allowing for easy connectivity, and advanced cryptography protocols. We present the experimental progress towards the storage of single photon level pulses carrying random polarization qubits into a dual rail room temperature quantum memory (RTQM) after ~ 20m of free space propagation. The RTQM coherently stores the input pulses through electromagnetically induced transparency (EIT) of a warm 87 Rb vapor and filters the output by polarization elements and temperature-controlled etalon resonators. This allows the characterization of error rates for each polarization basis and the testing of the synchronization ability of the quantum memory. This work presents a steppingstone towards quantum key distribution and quantum repeater networks. The work was supported by the US-Navy Office of Naval Research, Grant Number N00141410801 and the Simons Foundation, Grant Number SBF241180.B. J. acknowledges financial assistance of the National Research Foundation (NRF) of South Africa.
Ultrafast Quantum Control and Quantum Processing in the Vibronic States of Molecules and Solids
NASA Astrophysics Data System (ADS)
Sussman, Benjamin; Bustard, Philip; England, Duncan; Lausten, Rune
2014-05-01
The unusual features of quantum mechanics are enabling the development of technologies not possible with classical physics, including applications in secure communications, quantum processing, and enhanced measurement. Efforts to build these devices utilize nonclassical states in numerous quantum systems, including cavity quantum electrodynamics, trap ions, nuclear spins, etc. as the basis for many prototypes. Here we investigate vibronic states in both molecules and bulk solids as distinct alternatives. We demonstrate a memory for light based on storing photons in the vibrations of hydrogen molecules and the optical phonons of diamond. Both classical and nonclassical photon states are used. These THz-bandwidth memories can be used to store femtosecond pulses for many operational time bins before the states decohere, making them viable for local photonic processing. We investigate decoherence and major sources of competing noise. While sustaining quantum coherence is critical for most quantum processing, rapid dephasing can also be used as a resource in these systems for rapid quantum random number generation, suitable for high-performance cryptography. NSERC
Analysis and Proposal of Position-Based Routing Protocols for Vehicular Ad Hoc Networks
NASA Astrophysics Data System (ADS)
Okada, Hiraku; Takano, Akira; Mase, Kenichi
One of the most promising applications of a mobile ad hoc network is a vehicular ad hoc network (VANET). Each vehicle is aware of its position information by GPS or other methods, so position-based routing is a useful approach in VANET. The position-based routing protocol can be classified roughly into a next-hop forwarding method and a directed flooding method. We evaluate performance of both methods by analytic approach and compare them in this paper. From the evaluation results, we conclude that it is effective for the position-based routing to choose either the next-hop forwarding method or the directed flooding method according to the environment. Then we propose the hybrid transmission method which can select one of them according to the environment, and clarify that the proposed method can keep the packet delivery ratio at a high level and reduce the delay time.
Quantum computing accelerator I/O : LDRD 52750 final report.
Schroeppel, Richard Crabtree; Modine, Normand Arthur; Ganti, Anand; Pierson, Lyndon George; Tigges, Christopher P.
2003-12-01
In a superposition of quantum states, a bit can be in both the states '0' and '1' at the same time. This feature of the quantum bit or qubit has no parallel in classical systems. Currently, quantum computers consisting of 4 to 7 qubits in a 'quantum computing register' have been built. Innovative algorithms suited to quantum computing are now beginning to emerge, applicable to sorting and cryptanalysis, and other applications. A framework for overcoming slightly inaccurate quantum gate interactions and for causing quantum states to survive interactions with surrounding environment is emerging, called quantum error correction. Thus there is the potential for rapid advances in this field. Although quantum information processing can be applied to secure communication links (quantum cryptography) and to crack conventional cryptosystems, the first few computing applications will likely involve a 'quantum computing accelerator' similar to a 'floating point arithmetic accelerator' interfaced to a conventional Von Neumann computer architecture. This research is to develop a roadmap for applying Sandia's capabilities to the solution of some of the problems associated with maintaining quantum information, and with getting data into and out of such a 'quantum computing accelerator'. We propose to focus this work on 'quantum I/O technologies' by applying quantum optics on semiconductor nanostructures to leverage Sandia's expertise in semiconductor microelectronic/photonic fabrication techniques, as well as its expertise in information theory, processing, and algorithms. The work will be guided by understanding of practical requirements of computing and communication architectures. This effort will incorporate ongoing collaboration between 9000, 6000 and 1000 and between junior and senior personnel. Follow-on work to fabricate and evaluate appropriate experimental nano/microstructures will be proposed as a result of this work.
General A Scheme to Share Information via Employing Discrete Algorithm to Quantum States
NASA Astrophysics Data System (ADS)
Kang, Guo-Dong; Fang, Mao-Fa
2011-02-01
We propose a protocol for information sharing between two legitimate parties (Bob and Alice) via public-key cryptography. In particular, we specialize the protocol by employing discrete algorithm under mod that maps integers to quantum states via photon rotations. Based on this algorithm, we find that the protocol is secure under various classes of attacks. Specially, owe to the algorithm, the security of the classical privacy contained in the quantum public-key and the corresponding ciphertext is guaranteed. And the protocol is robust against the impersonation attack and the active wiretapping attack by designing particular checking processing, thus the protocol is valid.
All-optical cryptography of M-QAM formats by using two-dimensional spectrally sliced keys.
Abbade, Marcelo L F; Cvijetic, Milorad; Messani, Carlos A; Alves, Cleiton J; Tenenbaum, Stefan
2015-05-10
There has been an increased interest in enhancing the security of optical communications systems and networks. All-optical cryptography methods have been considered as an alternative to electronic data encryption. In this paper we propose and verify the use of a novel all-optical scheme based on cryptographic keys applied on the spectral signal for encryption of the M-QAM modulated data with bit rates of up to 200 gigabits per second.
Secret sharing with a single d -level quantum system
NASA Astrophysics Data System (ADS)
Tavakoli, Armin; Herbauts, Isabelle; Żukowski, Marek; Bourennane, Mohamed
2015-09-01
We give an example of a wide class of problems for which quantum-information protocols based on multisystem entanglement can be mapped into much simpler ones involving one system. Secret sharing is a cryptographic primitive which plays a central role in various secure multiparty computation tasks and management of keys in cryptography. In secret sharing protocols, a classical message is divided into shares given to recipient parties in such a way that some number of parties need to collaborate in order to reconstruct the message. Quantum protocols for the task commonly rely on multipartite GHZ entanglement. We present a multiparty secret sharing protocol which requires only sequential communication of a single quantum d -level system (for any prime d ). It has huge advantages in scalability and can be realized with state-of-the-art technology.
Measurement-device-independent entanglement-based quantum key distribution
NASA Astrophysics Data System (ADS)
Yang, Xiuqing; Wei, Kejin; Ma, Haiqiang; Sun, Shihai; Liu, Hongwei; Yin, Zhenqiang; Li, Zuohan; Lian, Shibin; Du, Yungang; Wu, Lingan
2016-05-01
We present a quantum key distribution protocol in a model in which the legitimate users gather statistics as in the measurement-device-independent entanglement witness to certify the sources and the measurement devices. We show that the task of measurement-device-independent quantum communication can be accomplished based on monogamy of entanglement, and it is fairly loss tolerate including source and detector flaws. We derive a tight bound for collective attacks on the Holevo information between the authorized parties and the eavesdropper. Then with this bound, the final secret key rate with the source flaws can be obtained. The results show that long-distance quantum cryptography over 144 km can be made secure using only standard threshold detectors.
Eavesdropping on counterfactual quantum key distribution with finite resources
NASA Astrophysics Data System (ADS)
Liu, Xingtong; Zhang, Bo; Wang, Jian; Tang, Chaojing; Zhao, Jingjing; Zhang, Sheng
2014-08-01
A striking scheme called "counterfactual quantum cryptography" gives a conceptually new approach to accomplish the task of key distribution. It allows two legitimate parties to share a secret even though a particle carrying secret information is not, in fact, transmitted through the quantum channel. Since an eavesdropper cannot directly access the entire quantum system of each signal particle, the protocol seems to provide practical security advantages. However, here we propose an eavesdropping method which works on the scheme in a finite key scenario. We show that, for practical systems only generating a finite number of keys, the eavesdropping can obtain all of the secret information without being detected. We also present a improved protocol as a countermeasure against this attack.
Quantum random bit generation using stimulated Raman scattering.
Bustard, Philip J; Moffatt, Doug; Lausten, Rune; Wu, Guorong; Walmsley, Ian A; Sussman, Benjamin J
2011-12-05
Random number sequences are a critical resource in a wide variety of information systems, including applications in cryptography, simulation, and data sampling. We introduce a quantum random number generator based on the phase measurement of Stokes light generated by amplification of zero-point vacuum fluctuations using stimulated Raman scattering. This is an example of quantum noise amplification using the most noise-free process possible: near unitary quantum evolution. The use of phase offers robustness to classical pump noise and the ability to generate multiple bits per measurement. The Stokes light is generated with high intensity and as a result, fast detectors with high signal-to-noise ratios can be used for measurement, eliminating the need for single-photon sensitive devices. The demonstrated implementation uses optical phonons in bulk diamond.
Robust Operation of Tendon-Driven Robot Fingers Using Force and Position-Based Control Laws
NASA Technical Reports Server (NTRS)
Abdallah, Muhammad E (Inventor); Platt, Jr., Robert J. (Inventor); Reiland, Matthew J (Inventor); Hargrave, Brian (Inventor); Diftler, Myron A (Inventor); Strawser, Philip A (Inventor); Ihrke, Chris A. (Inventor)
2013-01-01
A robotic system includes a tendon-driven finger and a control system. The system controls the finger via a force-based control law when a tension sensor is available, and via a position-based control law when a sensor is not available. Multiple tendons may each have a corresponding sensor. The system selectively injects a compliance value into the position-based control law when only some sensors are available. A control system includes a host machine and a non-transitory computer-readable medium having a control process, which is executed by the host machine to control the finger via the force- or position-based control law. A method for controlling the finger includes determining the availability of a tension sensor(s), and selectively controlling the finger, using the control system, via the force or position-based control law. The position control law allows the control system to resist disturbances while nominally maintaining the initial state of internal tendon tensions.
Industrial application for global quantum communication
NASA Astrophysics Data System (ADS)
Mirza, A.; Petruccione, F.
2012-09-01
In the last decade the quantum communication community has witnessed great advances in photonic quantum cryptography technology with the research, development and commercialization of automated Quantum Key Distribution (QKD) devices. These first generation devices are however bottlenecked by the achievable spatial coverage. This is due to the intrinsic absorption of the quantum particle into the communication medium. As QKD is of paramount importance in the future ICT landscape, various innovative solutions have been developed and tested to expand the spatial coverage of these networks such as the Quantum City initiative in Durban, South Africa. To expand this further into a global QKD-secured network, recent efforts have focussed on high-altitude free-space techniques through the use of satellites. This couples the QKD-secured Metropolitan Area Networks (MANs) with secured ground-tosatellite links as access points to a global network. Such a solution, however, has critical limitations that reduce its commercial feasibility. As parallel step to the development of satellitebased global QKD networks, we investigate the use of the commercial aircrafts' network as secure transport mechanisms in a global QKD network. This QKD-secured global network will provide a robust infrastructure to create, distribute and manage encryption keys between the MANs of the participating cities.
Long-distance quantum communication over noisy networks without long-time quantum memory
NASA Astrophysics Data System (ADS)
Mazurek, Paweł; Grudka, Andrzej; Horodecki, Michał; Horodecki, Paweł; Łodyga, Justyna; Pankowski, Łukasz; PrzysieŻna, Anna
2014-12-01
The problem of sharing entanglement over large distances is crucial for implementations of quantum cryptography. A possible scheme for long-distance entanglement sharing and quantum communication exploits networks whose nodes share Einstein-Podolsky-Rosen (EPR) pairs. In Perseguers et al. [Phys. Rev. A 78, 062324 (2008), 10.1103/PhysRevA.78.062324] the authors put forward an important isomorphism between storing quantum information in a dimension D and transmission of quantum information in a D +1 -dimensional network. We show that it is possible to obtain long-distance entanglement in a noisy two-dimensional (2D) network, even when taking into account that encoding and decoding of a state is exposed to an error. For 3D networks we propose a simple encoding and decoding scheme based solely on syndrome measurements on 2D Kitaev topological quantum memory. Our procedure constitutes an alternative scheme of state injection that can be used for universal quantum computation on 2D Kitaev code. It is shown that the encoding scheme is equivalent to teleporting the state, from a specific node into a whole two-dimensional network, through some virtual EPR pair existing within the rest of network qubits. We present an analytic lower bound on fidelity of the encoding and decoding procedure, using as our main tool a modified metric on space-time lattice, deviating from a taxicab metric at the first and the last time slices.
Deciphering the language of nature: cryptography, secrecy, and alterity in Francis Bacon.
Clody, Michael C
2011-01-01
The essay argues that Francis Bacon's considerations of parables and cryptography reflect larger interpretative concerns of his natural philosophic project. Bacon describes nature as having a language distinct from those of God and man, and, in so doing, establishes a central problem of his natural philosophy—namely, how can the language of nature be accessed through scientific representation? Ultimately, Bacon's solution relies on a theory of differential and duplicitous signs that conceal within them the hidden voice of nature, which is best recognized in the natural forms of efficient causality. The "alphabet of nature"—those tables of natural occurrences—consequently plays a central role in his program, as it renders nature's language susceptible to a process and decryption that mirrors the model of the bilateral cipher. It is argued that while the writing of Bacon's natural philosophy strives for literality, its investigative process preserves a space for alterity within scientific representation, that is made accessible to those with the interpretative key.
NASA Astrophysics Data System (ADS)
Jungeblut, T.; Puttmann, C.; Dreesen, R.; Porrmann, M.; Thies, M.; Rückert, U.; Kastens, U.
2010-12-01
The secure transmission of data plays a significant role in today's information era. Especially in the area of public-key-cryptography methods, which are based on elliptic curves (ECC), gain more and more importance. Compared to asymmetric algorithms, like RSA, ECC can be used with shorter key lengths, while achieving an equal level of security. The performance of ECC-algorithms can be increased significantly by adding application specific hardware extensions. Due to their fine grained parallelism, VLIW-processors are well suited for the execution of ECC algorithms. In this work, we extended the fourfold parallel CoreVA-VLIW-architecture by several hardware accelerators to increase the resource efficiency of the overall system. For the design-space exploration we use a dual design flow, which is based on the automatic generation of a complete C-compiler based tool chain from a central processor specification. Using the hardware accelerators the performance of the scalar multiplication on binary fields can be increased by the factor of 29. The energy consumption can be reduced by up to 90%. The extended processor hardware was mapped on a current 65 nm low-power standard-cell-technology. The chip area of the CoreVA-VLIW-architecture is 0.24 mm2 at a power consumption of 29 mW/MHz. The performance gain is analyzed in respect to the increased hardware costs, as chip area or power consumption.
Evaluating security of a clone preventive techinque using physical randomness and cryptography
NASA Astrophysics Data System (ADS)
Matsumoto, Hiroyuki; Matsumoto, Tsutomu
2000-04-01
Clone resistance of most of all anti-counterfeiting techniques depends upon secret identifiers or difficulty of reproduction. However, these kinds of techniques are no use if a counterfeiter has enough financial a power to work the secret out or toe overcome the difficulty. We have focused on, among others, random patterns which can be inevitably difficult to reproduce. Consequently, we have developed a document protection system which utilizes random patterns of magnetic micro-fibers in substrates of documents. We have also applied cryptography to the system. The system verifies and authenticates a stochastic feature using pre-stored template data and a digital signature. The stochastic feature and the digital signature respectively prevent 'dead copying' and counterfeiting/alteration of the recorded data such as a value of the card. Therefore security of the system depends upon difficulty both in reproduction of the stochastic feature and in analysis of the digital signature. We have evalut3ed the security of the system for several kinds of criminal attacks. Some criminals may try to counterfeit a stochastic feature by modeling on a genuine document. In our paper we discuss security evaluation of our document protection system against such kinds of criminal methods and also discus a countermeasure and its difficulty.
Choi, Younsung; Lee, Donghoon; Kim, Jiye; Jung, Jaewook; Nam, Junghyun; Won, Dongho
2014-01-01
Wireless sensor networks (WSNs) consist of sensors, gateways and users. Sensors are widely distributed to monitor various conditions, such as temperature, sound, speed and pressure but they have limited computational ability and energy. To reduce the resource use of sensors and enhance the security of WSNs, various user authentication protocols have been proposed. In 2011, Yeh et al. first proposed a user authentication protocol based on elliptic curve cryptography (ECC) for WSNs. However, it turned out that Yeh et al.'s protocol does not provide mutual authentication, perfect forward secrecy, and key agreement between the user and sensor. Later in 2013, Shi et al. proposed a new user authentication protocol that improves both security and efficiency of Yeh et al.'s protocol. However, Shi et al.'s improvement introduces other security weaknesses. In this paper, we show that Shi et al.'s improved protocol is vulnerable to session key attack, stolen smart card attack, and sensor energy exhausting attack. In addition, we propose a new, security-enhanced user authentication protocol using ECC for WSNs. PMID:24919012
Elliptic Curve Cryptography-Based Authentication with Identity Protection for Smart Grids.
Zhang, Liping; Tang, Shanyu; Luo, He
2016-01-01
In a smart grid, the power service provider enables the expected power generation amount to be measured according to current power consumption, thus stabilizing the power system. However, the data transmitted over smart grids are not protected, and then suffer from several types of security threats and attacks. Thus, a robust and efficient authentication protocol should be provided to strength the security of smart grid networks. As the Supervisory Control and Data Acquisition system provides the security protection between the control center and substations in most smart grid environments, we focus on how to secure the communications between the substations and smart appliances. Existing security approaches fail to address the performance-security balance. In this study, we suggest a mitigation authentication protocol based on Elliptic Curve Cryptography with privacy protection by using a tamper-resistant device at the smart appliance side to achieve a delicate balance between performance and security of smart grids. The proposed protocol provides some attractive features such as identity protection, mutual authentication and key agreement. Finally, we demonstrate the completeness of the proposed protocol using the Gong-Needham-Yahalom logic.
An Interoperability Consideration in Selecting Domain Parameters for Elliptic Curve Cryptography
NASA Technical Reports Server (NTRS)
Ivancic, Will (Technical Monitor); Eddy, Wesley M.
2005-01-01
Elliptic curve cryptography (ECC) will be an important technology for electronic privacy and authentication in the near future. There are many published specifications for elliptic curve cryptosystems, most of which contain detailed descriptions of the process for the selection of domain parameters. Selecting strong domain parameters ensures that the cryptosystem is robust to attacks. Due to a limitation in several published algorithms for doubling points on elliptic curves, some ECC implementations may produce incorrect, inconsistent, and incompatible results if domain parameters are not carefully chosen under a criterion that we describe. Few documents specify the addition or doubling of points in such a manner as to avoid this problematic situation. The safety criterion we present is not listed in any ECC specification we are aware of, although several other guidelines for domain selection are discussed in the literature. We provide a simple example of how a set of domain parameters not meeting this criterion can produce catastrophic results, and outline a simple means of testing curve parameters for interoperable safety over doubling.
Elliptic Curve Cryptography-Based Authentication with Identity Protection for Smart Grids
Zhang, Liping; Tang, Shanyu; Luo, He
2016-01-01
In a smart grid, the power service provider enables the expected power generation amount to be measured according to current power consumption, thus stabilizing the power system. However, the data transmitted over smart grids are not protected, and then suffer from several types of security threats and attacks. Thus, a robust and efficient authentication protocol should be provided to strength the security of smart grid networks. As the Supervisory Control and Data Acquisition system provides the security protection between the control center and substations in most smart grid environments, we focus on how to secure the communications between the substations and smart appliances. Existing security approaches fail to address the performance-security balance. In this study, we suggest a mitigation authentication protocol based on Elliptic Curve Cryptography with privacy protection by using a tamper-resistant device at the smart appliance side to achieve a delicate balance between performance and security of smart grids. The proposed protocol provides some attractive features such as identity protection, mutual authentication and key agreement. Finally, we demonstrate the completeness of the proposed protocol using the Gong-Needham- Yahalom logic. PMID:27007951
NASA Astrophysics Data System (ADS)
Lukishova, Svetlana G.; Liapis, Andreas C.; Bissell, Luke J.; Gehring, George M.; Winkler, Justin M.; Boyd, Robert W.
2015-03-01
We present here our results on using liquid crystals in experiments with nonclassical light sources: (1) single-photon sources exhibiting antibunching (separation of all photons in time), which are key components for secure quantum communication systems, and (2) entangled photon source with photons exhibiting quantum interference in a Hong-Ou- Mandel interferometer. In the first part, cholesteric liquid crystal hosts were used to create definite circular polarization of antibunched photons emitted by nanocrystal quantum dots. If the photon has unknown polarization, filtering it through a polarizer to produce the desired polarization for quantum key distribution with bits based on polarization states of photons will reduce by half the efficiency of a quantum cryptography system. In the first part, we also provide our results on observation of a circular polarized microcavity resonance in nanocrystal quantum dot fluorescence in a 1-D chiral photonic bandgap cholesteric liquid crystal microcavity. In the second part of this paper with indistinguishable, time-entangled photons, we demonstrate our experimental results on simulating quantum-mechanical barrier tunnelling phenomena. A Hong-Ou-Mandel dip (quantum interference effect) is shifted when a phase change was introduced on the way of one of entangled photons in pair (one arm of the interferometer) by inserting in this arm an electrically controlled planar-aligned nematic liquid crystal layer between two prisms in the conditions close to a frustrated total internal reflection. By applying different AC-voltages to the planar-aligned nematic layer and changing its refractive index, we can obtain various conditions for incident photon propagation - from total reflection to total transmission. Measuring changes of tunnelling times of photon through this structure with femtosecond resolution permitted us to answer some unresolved questions in quantum-mechanical barrier tunnelling phenomena.
Experimental Eavesdropping Based on Optimal Quantum Cloning
NASA Astrophysics Data System (ADS)
Bartkiewicz, Karol; Lemr, Karel; Černoch, Antonín; Soubusta, Jan; Miranowicz, Adam
2013-04-01
The security of quantum cryptography is guaranteed by the no-cloning theorem, which implies that an eavesdropper copying transmitted qubits in unknown states causes their disturbance. Nevertheless, in real cryptographic systems some level of disturbance has to be allowed to cover, e.g., transmission losses. An eavesdropper can attack such systems by replacing a noisy channel by a better one and by performing approximate cloning of transmitted qubits which disturb them but below the noise level assumed by legitimate users. We experimentally demonstrate such symmetric individual eavesdropping on the quantum key distribution protocols of Bennett and Brassard (BB84) and the trine-state spherical code of Renes (R04) with two-level probes prepared using a recently developed photonic multifunctional quantum cloner [Lemr et al., Phys. Rev. A 85, 050307(R) (2012)PLRAAN1050-2947]. We demonstrated that our optimal cloning device with high-success rate makes the eavesdropping possible by hiding it in usual transmission losses. We believe that this experiment can stimulate the quest for other operational applications of quantum cloning.
NASA Astrophysics Data System (ADS)
McCloskey, R.; Ferraro, A.; Paternostro, M.
2017-01-01
We identify the families of states that maximize some recently proposed quantifiers of Einstein-Podolsky-Rosen (EPR) steering and the volume of the quantum steering ellipsoid (QSE). The optimal measurements which maximize genuine EPR steering measures are discussed and we develop a 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.
Two-slit experiment: quantum and classical probabilities
NASA Astrophysics Data System (ADS)
Khrennikov, Andrei
2015-06-01
Inter-relation between quantum and classical probability models is one of the most fundamental problems of quantum foundations. Nowadays this problem also plays an important role in quantum technologies, in quantum cryptography and the theory of quantum random generators. In this letter, we compare the viewpoint of Richard Feynman that the behavior of quantum particles cannot be described by classical probability theory with the viewpoint that quantum-classical inter-relation is more complicated (cf, in particular, with the tomographic model of quantum mechanics developed in detail by Vladimir Man'ko). As a basic example, we consider the two-slit experiment, which played a crucial role in quantum foundational debates at the beginning of quantum mechanics (QM). In particular, its analysis led Niels Bohr to the formulation of the principle of complementarity. First, we demonstrate that in complete accordance with Feynman's viewpoint, the probabilities for the two-slit experiment have the non-Kolmogorovian structure, since they violate one of basic laws of classical probability theory, the law of total probability (the heart of the Bayesian analysis). However, then we show that these probabilities can be embedded in a natural way into the classical (Kolmogorov, 1933) probability model. To do this, one has to take into account the randomness of selection of different experimental contexts, the joint consideration of which led Feynman to a conclusion about the non-classicality of quantum probability. We compare this embedding of non-Kolmogorovian quantum probabilities into the Kolmogorov model with well-known embeddings of non-Euclidean geometries into Euclidean space (e.g., the Poincaré disk model for the Lobachvesky plane).
Probabilistic Model of Fault Detection in Quantum Circuits
NASA Astrophysics Data System (ADS)
Banerjee, A.; Pathak, A.
Since the introduction of quantum computation, several protocols (such as quantum cryptography, quantum algorithm, quantum teleportation) have established quantum computing as a superior future technology. Each of these processes involves quantum circuits, which are prone to different kinds of faults. Consequently, it is important to verify whether the circuit hardware is defective or not. The systematic procedure to do so is known as fault testing. Normally testing is done by providing a set of valid input states and measuring the corresponding output states and comparing the output states with the expected output states of the perfect (fault less) circuit. This particular set of input vectors are known as test set [6]. If there exists a fault then the next step would be to find the exact location and nature of the defect. This is known as fault localization. A model that explains the logical or functional faults in the circuit is a fault model. Conventional fault models include (i) stuck at faults, (ii) bridge faults, and (iii) delay faults. These fault models have been rigorously studied for conventional irreversible circuit. But with the advent of reversible classical computing and quantum computing it has become important to enlarge the domain of the study on test vectors.
Quantum-locked key distribution at nearly the classical capacity rate.
Lupo, Cosmo; Lloyd, Seth
2014-10-17
Quantum data locking is a protocol that allows for a small secret key to (un)lock an exponentially larger amount of information, hence yielding the strongest violation of the classical one-time pad encryption in the quantum setting. This violation mirrors a large gap existing between two security criteria for quantum cryptography quantified by two entropic quantities: the Holevo information and the accessible information. We show that the latter becomes a sensible security criterion if an upper bound on the coherence time of the eavesdropper's quantum memory is known. Under this condition, we introduce a protocol for secret key generation through a memoryless qudit channel. For channels with enough symmetry, such as the d-dimensional erasure and depolarizing channels, this protocol allows secret key generation at an asymptotic rate as high as the classical capacity minus one bit.
Quantum-Locked Key Distribution at Nearly the Classical Capacity Rate
NASA Astrophysics Data System (ADS)
Lupo, Cosmo; Lloyd, Seth
2014-10-01
Quantum data locking is a protocol that allows for a small secret key to (un)lock an exponentially larger amount of information, hence yielding the strongest violation of the classical one-time pad encryption in the quantum setting. This violation mirrors a large gap existing between two security criteria for quantum cryptography quantified by two entropic quantities: the Holevo information and the accessible information. We show that the latter becomes a sensible security criterion if an upper bound on the coherence time of the eavesdropper's quantum memory is known. Under this condition, we introduce a protocol for secret key generation through a memoryless qudit channel. For channels with enough symmetry, such as the d-dimensional erasure and depolarizing channels, this protocol allows secret key generation at an asymptotic rate as high as the classical capacity minus one bit.
Molotkov, S. N.
2012-05-15
The fundamental quantum mechanics prohibitions on the measurability of quantum states allow secure key distribution between spatially remote users to be performed. Experimental and commercial implementations of quantum cryptography systems, however, use components that exist at the current technology level, in particular, one-photon avalanche photodetectors. These detectors are subject to the blinding effect. It was shown that all the known basic quantum key distribution protocols and systems based on them are vulnerable to attacks with blinding of photodetectors. In such attacks, an eavesdropper knows all the key transferred, does not produce errors at the reception side, and remains undetected. Three protocols of quantum key distribution stable toward such attacks are suggested. The security of keys and detection of eavesdropping attempts are guaranteed by the internal structure of protocols themselves rather than additional technical improvements.
NASA Astrophysics Data System (ADS)
Molotkov, S. N.
2012-05-01
The fundamental quantum mechanics prohibitions on the measurability of quantum states allow secure key distribution between spatially remote users to be performed. Experimental and commercial implementations of quantum cryptography systems, however, use components that exist at the current technology level, in particular, one-photon avalanche photodetectors. These detectors are subject to the blinding effect. It was shown that all the known basic quantum key distribution protocols and systems based on them are vulnerable to attacks with blinding of photodetectors. In such attacks, an eavesdropper knows all the key transferred, does not produce errors at the reception side, and remains undetected. Three protocols of quantum key distribution stable toward such attacks are suggested. The security of keys and detection of eavesdropping attempts are guaranteed by the internal structure of protocols themselves rather than additional technical improvements.
Quantum-secure covert communication on bosonic channels.
Bash, Boulat A; Gheorghe, Andrei H; Patel, Monika; Habif, Jonathan L; Goeckel, Dennis; Towsley, Don; Guha, Saikat
2015-10-19
Computational encryption, information-theoretic secrecy and quantum cryptography offer progressively stronger security against unauthorized decoding of messages contained in communication transmissions. However, these approaches do not ensure stealth--that the mere presence of message-bearing transmissions be undetectable. We characterize the ultimate limit of how much data can be reliably and covertly communicated over the lossy thermal-noise bosonic channel (which models various practical communication channels). We show that whenever there is some channel noise that cannot in principle be controlled by an otherwise arbitrarily powerful adversary--for example, thermal noise from blackbody radiation--the number of reliably transmissible covert bits is at most proportional to the square root of the number of orthogonal modes (the time-bandwidth product) available in the transmission interval. We demonstrate this in a proof-of-principle experiment. Our result paves the way to realizing communications that are kept covert from an all-powerful quantum adversary.
Quantum-secure covert communication on bosonic channels
NASA Astrophysics Data System (ADS)
Bash, Boulat A.; Gheorghe, Andrei H.; Patel, Monika; Habif, Jonathan L.; Goeckel, Dennis; Towsley, Don; Guha, Saikat
2015-10-01
Computational encryption, information-theoretic secrecy and quantum cryptography offer progressively stronger security against unauthorized decoding of messages contained in communication transmissions. However, these approaches do not ensure stealth--that the mere presence of message-bearing transmissions be undetectable. We characterize the ultimate limit of how much data can be reliably and covertly communicated over the lossy thermal-noise bosonic channel (which models various practical communication channels). We show that whenever there is some channel noise that cannot in principle be controlled by an otherwise arbitrarily powerful adversary--for example, thermal noise from blackbody radiation--the number of reliably transmissible covert bits is at most proportional to the square root of the number of orthogonal modes (the time-bandwidth product) available in the transmission interval. We demonstrate this in a proof-of-principle experiment. Our result paves the way to realizing communications that are kept covert from an all-powerful quantum adversary.
Quantum-secure covert communication on bosonic channels
Bash, Boulat A.; Gheorghe, Andrei H.; Patel, Monika; Habif, Jonathan L.; Goeckel, Dennis; Towsley, Don; Guha, Saikat
2015-01-01
Computational encryption, information-theoretic secrecy and quantum cryptography offer progressively stronger security against unauthorized decoding of messages contained in communication transmissions. However, these approaches do not ensure stealth—that the mere presence of message-bearing transmissions be undetectable. We characterize the ultimate limit of how much data can be reliably and covertly communicated over the lossy thermal-noise bosonic channel (which models various practical communication channels). We show that whenever there is some channel noise that cannot in principle be controlled by an otherwise arbitrarily powerful adversary—for example, thermal noise from blackbody radiation—the number of reliably transmissible covert bits is at most proportional to the square root of the number of orthogonal modes (the time-bandwidth product) available in the transmission interval. We demonstrate this in a proof-of-principle experiment. Our result paves the way to realizing communications that are kept covert from an all-powerful quantum adversary. PMID:26478089
Source-Device-Independent Ultrafast Quantum Random Number Generation
NASA Astrophysics Data System (ADS)
Marangon, Davide G.; Vallone, Giuseppe; Villoresi, Paolo
2017-02-01
Secure random numbers are a fundamental element of many applications in science, statistics, cryptography and more in general in security protocols. We present a method that enables the generation of high-speed unpredictable random numbers from the quadratures of an electromagnetic field without any assumption on the input state. The method allows us to eliminate the numbers that can be predicted due to the presence of classical and quantum side information. In particular, we introduce a procedure to estimate a bound on the conditional min-entropy based on the entropic uncertainty principle for position and momentum observables of infinite dimensional quantum systems. By the above method, we experimentally demonstrated the generation of secure true random bits at a rate greater than 1.7 Gbit /s .
Pseudo random number generator based on quantum chaotic map
NASA Astrophysics Data System (ADS)
Akhshani, A.; Akhavan, A.; Mobaraki, A.; Lim, S.-C.; Hassan, Z.
2014-01-01
For many years dissipative quantum maps were widely used as informative models of quantum chaos. In this paper, a new scheme for generating good pseudo-random numbers (PRNG), based on quantum logistic map is proposed. Note that the PRNG merely relies on the equations used in the quantum chaotic map. The algorithm is not complex, which does not impose high requirement on computer hardware and thus computation speed is fast. In order to face the challenge of using the proposed PRNG in quantum cryptography and other practical applications, the proposed PRNG is subjected to statistical tests using well-known test suites such as NIST, DIEHARD, ENT and TestU01. The results of the statistical tests were promising, as the proposed PRNG successfully passed all these tests. Moreover, the degree of non-periodicity of the chaotic sequences of the quantum map is investigated through the Scale index technique. The obtained result shows that, the sequence is more non-periodic. From these results it can be concluded that, the new scheme can generate a high percentage of usable pseudo-random numbers for simulation and other applications in scientific computing.
Chen Benyong; Zhang Enzheng; Yan Liping; Li Chaorong; Tang Wuhua; Feng Qibo
2009-11-15
Not only the magnitude but also the position of straightness errors are of concern to users. However, current laser interferometers used for measuring straightness seldom give the relative position of the straightness error. To solve this problem, a laser interferometer for measuring straightness and its position based on heterodyne interferometry is proposed. The optical configuration of the interferometer is designed and the measurement principle is analyzed theoretically. Two experiments were carried out. The first experiment verifies the validity and repeatability of the interferometer by measuring a linear stage. Also, the second one for measuring a flexure-hinge stage demonstrates that the interferometer is capable of nanometer measurement accuracy. These results show that this interferometer has advantages of simultaneously measuring straightness error and the relative position with high precision, and a compact structure.
Scale-Free Correlations in Flocking Systems with Position-Based Interactions
NASA Astrophysics Data System (ADS)
Huepe, Cristián; Ferrante, Eliseo; Wenseleers, Tom; Turgut, Ali Emre
2015-02-01
We consider a model of self-propelled agents with spring-like interactions that depend only on relative positions, and not on relative orientations. We observe that groups of these agents self-organize to achieve collective motion (CM) through a mechanism based on the cascading of self-propulsion energy towards lower elastic modes. By computing the correlation functions of the speed and velocity fluctuations for different group sizes, we show that the corresponding correlation lengths are proportional to the linear size of the group and have no intrinsic length scale. We argue that such scale-free correlations are a natural consequence of the position-based interactions and associated CM dynamics. We hypothesize that this effect, acting in the context of more complex realistic interactions, could be at the origin of the scale-free correlations measured experimentally in flocks of starlings, instead of the previously argued proximity to a critical regime.
Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
NASA Astrophysics Data System (ADS)
Buhrman, Harry; Christandl, Matthias; Schaffner, Christian
2012-10-01
A fundamental task in modern cryptography is the joint computation of a function which has two inputs, one from Alice and one from Bob, such that neither of the two can learn more about the other’s input than what is implied by the value of the function. In this Letter, we show that any quantum protocol for the computation of a classical deterministic function that outputs the result to both parties (two-sided computation) and that is secure against a cheating Bob can be completely broken by a cheating Alice. Whereas it is known that quantum protocols for this task cannot be completely secure, our result implies that security for one party implies complete insecurity for the other. Our findings stand in stark contrast to recent protocols for weak coin tossing and highlight the limits of cryptography within quantum mechanics. We remark that our conclusions remain valid, even if security is only required to be approximate and if the function that is computed for Bob is different from that of Alice.
Quantum coherent optical phase modulation in an ultrafast transmission electron microscope.
Feist, Armin; Echternkamp, Katharina E; Schauss, Jakob; Yalunin, Sergey V; Schäfer, Sascha; Ropers, Claus
2015-05-14
Coherent manipulation of quantum systems with light is expected to be a cornerstone of future information and communication technology, including quantum computation and cryptography. The transfer of an optical phase onto a quantum wavefunction is a defining aspect of coherent interactions and forms the basis of quantum state preparation, synchronization and metrology. Light-phase-modulated electron states near atoms and molecules are essential for the techniques of attosecond science, including the generation of extreme-ultraviolet pulses and orbital tomography. In contrast, the quantum-coherent phase-modulation of energetic free-electron beams has not been demonstrated, although it promises direct access to ultrafast imaging and spectroscopy with tailored electron pulses on the attosecond scale. Here we demonstrate the coherent quantum state manipulation of free-electron populations in an electron microscope beam. We employ the interaction of ultrashort electron pulses with optical near-fields to induce Rabi oscillations in the populations of electron momentum states, observed as a function of the optical driving field. Excellent agreement with the scaling of an equal-Rabi multilevel quantum ladder is obtained, representing the observation of a light-driven 'quantum walk' coherently reshaping electron density in momentum space. We note that, after the interaction, the optically generated superposition of momentum states evolves into a train of attosecond electron pulses. Our results reveal the potential of quantum control for the precision structuring of electron densities, with possible applications ranging from ultrafast electron spectroscopy and microscopy to accelerator science and free-electron lasers.
Quantum coherent optical phase modulation in an ultrafast transmission electron microscope
NASA Astrophysics Data System (ADS)
Feist, Armin; Echternkamp, Katharina E.; Schauss, Jakob; Yalunin, Sergey V.; Schäfer, Sascha; Ropers, Claus
2015-05-01
Coherent manipulation of quantum systems with light is expected to be a cornerstone of future information and communication technology, including quantum computation and cryptography. The transfer of an optical phase onto a quantum wavefunction is a defining aspect of coherent interactions and forms the basis of quantum state preparation, synchronization and metrology. Light-phase-modulated electron states near atoms and molecules are essential for the techniques of attosecond science, including the generation of extreme-ultraviolet pulses and orbital tomography. In contrast, the quantum-coherent phase-modulation of energetic free-electron beams has not been demonstrated, although it promises direct access to ultrafast imaging and spectroscopy with tailored electron pulses on the attosecond scale. Here we demonstrate the coherent quantum state manipulation of free-electron populations in an electron microscope beam. We employ the interaction of ultrashort electron pulses with optical near-fields to induce Rabi oscillations in the populations of electron momentum states, observed as a function of the optical driving field. Excellent agreement with the scaling of an equal-Rabi multilevel quantum ladder is obtained, representing the observation of a light-driven `quantum walk' coherently reshaping electron density in momentum space. We note that, after the interaction, the optically generated superposition of momentum states evolves into a train of attosecond electron pulses. Our results reveal the potential of quantum control for the precision structuring of electron densities, with possible applications ranging from ultrafast electron spectroscopy and microscopy to accelerator science and free-electron lasers.
Scalable quantum information processing with photons and atoms
NASA Astrophysics Data System (ADS)
Pan, Jian-Wei
Over the past three decades, the promises of super-fast quantum computing and secure quantum cryptography have spurred a world-wide interest in quantum information, generating fascinating quantum technologies for coherent manipulation of individual quantum systems. However, the distance of fiber-based quantum communications is limited due to intrinsic fiber loss and decreasing of entanglement quality. Moreover, probabilistic single-photon source and entanglement source demand exponentially increased overheads for scalable quantum information processing. To overcome these problems, we are taking two paths in parallel: quantum repeaters and through satellite. We used the decoy-state QKD protocol to close the loophole of imperfect photon source, and used the measurement-device-independent QKD protocol to close the loophole of imperfect photon detectors--two main loopholes in quantum cryptograph. Based on these techniques, we are now building world's biggest quantum secure communication backbone, from Beijing to Shanghai, with a distance exceeding 2000 km. Meanwhile, we are developing practically useful quantum repeaters that combine entanglement swapping, entanglement purification, and quantum memory for the ultra-long distance quantum communication. The second line is satellite-based global quantum communication, taking advantage of the negligible photon loss and decoherence in the atmosphere. We realized teleportation and entanglement distribution over 100 km, and later on a rapidly moving platform. We are also making efforts toward the generation of multiphoton entanglement and its use in teleportation of multiple properties of a single quantum particle, topological error correction, quantum algorithms for solving systems of linear equations and machine learning. Finally, I will talk about our recent experiments on quantum simulations on ultracold atoms. On the one hand, by applying an optical Raman lattice technique, we realized a two-dimensional spin-obit (SO
Measurement-Device-Independent Quantum Key Distribution over Untrustful Metropolitan Network
NASA Astrophysics Data System (ADS)
Tang, Yan-Lin; Yin, Hua-Lei; Zhao, Qi; Liu, Hui; Sun, Xiang-Xiang; Huang, Ming-Qi; Zhang, Wei-Jun; Chen, Si-Jing; Zhang, Lu; You, Li-Xing; Wang, Zhen; Liu, Yang; Lu, Chao-Yang; Jiang, Xiao; Ma, Xiongfeng; Zhang, Qiang; Chen, Teng-Yun; Pan, Jian-Wei
2016-01-01
Quantum cryptography holds the promise to establish an information-theoretically secure global network. All field tests of metropolitan-scale quantum networks to date are based on trusted relays. The security critically relies on the accountability of the trusted relays, which will break down if the relay is dishonest or compromised. Here, we construct a measurement-device-independent quantum key distribution (MDIQKD) network in a star topology over a 200-square-kilometer metropolitan area, which is secure against untrustful relays and against all detection attacks. In the field test, our system continuously runs through one week with a secure key rate 10 times larger than previous results. Our results demonstrate that the MDIQKD network, combining the best of both worlds—security and practicality, constitutes an appealing solution to secure metropolitan communications.
A generator for unique quantum random numbers based on vacuum states
NASA Astrophysics Data System (ADS)
Gabriel, Christian; Wittmann, Christoffer; Sych, Denis; Dong, Ruifang; Mauerer, Wolfgang; Andersen, Ulrik L.; Marquardt, Christoph; Leuchs, Gerd
2010-10-01
Random numbers are a valuable component in diverse applications that range from simulations over gambling to cryptography. The quest for true randomness in these applications has engendered a large variety of different proposals for producing random numbers based on the foundational unpredictability of quantum mechanics. However, most approaches do not consider that a potential adversary could have knowledge about the generated numbers, so the numbers are not verifiably random and unique. Here we present a simple experimental setup based on homodyne measurements that uses the purity of a continuous-variable quantum vacuum state to generate unique random numbers. We use the intrinsic randomness in measuring the quadratures of a mode in the lowest energy vacuum state, which cannot be correlated to any other state. The simplicity of our source, combined with its verifiably unique randomness, are important attributes for achieving high-reliability, high-speed and low-cost quantum random number generators.
Stapp, H.P.
1988-12-01
Quantum ontologies are conceptions of the constitution of the universe that are compatible with quantum theory. The ontological orientation is contrasted to the pragmatic orientation of science, and reasons are given for considering quantum ontologies both within science, and in broader contexts. The principal quantum ontologies are described and evaluated. Invited paper at conference: Bell's Theorem, Quantum Theory, and Conceptions of the Universe, George Mason University, October 20-21, 1988. 16 refs.
Quantum anonymous voting with unweighted continuous-variable graph states
NASA Astrophysics Data System (ADS)
Guo, Ying; Feng, Yanyan; Zeng, Guihua
2016-08-01
Motivated by the revealing topological structures of continuous-variable graph state (CVGS), we investigate the design of quantum voting scheme, which has serious advantages over the conventional ones in terms of efficiency and graphicness. Three phases are included, i.e., the preparing phase, the voting phase and the counting phase, together with three parties, i.e., the voters, the tallyman and the ballot agency. Two major voting operations are performed on the yielded CVGS in the voting process, namely the local rotation transformation and the displacement operation. The voting information is carried by the CVGS established before hand, whose persistent entanglement is deployed to keep the privacy of votes and the anonymity of legal voters. For practical applications, two CVGS-based quantum ballots, i.e., comparative ballot and anonymous survey, are specially designed, followed by the extended ballot schemes for the binary-valued and multi-valued ballots under some constraints for the voting design. Security is ensured by entanglement of the CVGS, the voting operations and the laws of quantum mechanics. The proposed schemes can be implemented using the standard off-the-shelf components when compared to discrete-variable quantum voting schemes attributing to the characteristics of the CV-based quantum cryptography.
High-capacity quantum Fibonacci coding for key distribution
NASA Astrophysics Data System (ADS)
Simon, David S.; Lawrence, Nate; Trevino, Jacob; Dal Negro, Luca; Sergienko, Alexander V.
2013-03-01
Quantum cryptography and quantum key distribution (QKD) have been the most successful applications of quantum information processing, highlighting the unique capability of quantum mechanics, through the no-cloning theorem, to securely share encryption keys between two parties. Here, we present an approach to high-capacity, high-efficiency QKD by exploiting cross-disciplinary ideas from quantum information theory and the theory of light scattering of aperiodic photonic media. We propose a unique type of entangled-photon source, as well as a physical mechanism for efficiently sharing keys. The key-sharing protocol combines entanglement with the mathematical properties of a recursive sequence to allow a realization of the physical conditions necessary for implementation of the no-cloning principle for QKD, while the source produces entangled photons whose orbital angular momenta (OAM) are in a superposition of Fibonacci numbers. The source is used to implement a particular physical realization of the protocol by randomly encoding the Fibonacci sequence onto entangled OAM states, allowing secure generation of long keys from few photons. Unlike in polarization-based protocols, reference frame alignment is unnecessary, while the required experimental setup is simpler than other OAM-based protocols capable of achieving the same capacity and its complexity grows less rapidly with increasing range of OAM used.
Quantum Computer Games: Quantum Minesweeper
ERIC Educational Resources Information Center
Gordon, Michal; Gordon, Goren
2010-01-01
The computer game of quantum minesweeper is introduced as a quantum extension of the well-known classical minesweeper. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. Quantum minesweeper demonstrates the effects of superposition, entanglement and their non-local characteristics. While in the classical…
NASA Astrophysics Data System (ADS)
Zhao, Tieyu; Ran, Qiwen; Yuan, Lin; Chi, Yingying; Ma, Jing
2016-08-01
A novel image encryption system based on double random phase encoding (DRPE) and RSA public-key algorithm is proposed. The main characteristic of the system is that each encryption process produces a new decryption key (even for the same plaintext), thus the encryption system conforms to the feature of the one-time pad (OTP) cryptography. The other characteristic of the system is the use of fingerprint key. Only with the rightful authorization will the true decryption be obtained, otherwise the decryption will result in noisy images. So the proposed system can be used to determine whether the ciphertext is falsified by attackers. In addition, the system conforms to the basic agreement of asymmetric cryptosystem (ACS) due to the combination with the RSA public-key algorithm. The simulation results show that the encryption scheme has high robustness against the existing attacks.
DPNuc: Identifying Nucleosome Positions Based on the Dirichlet Process Mixture Model.
Chen, Huidong; Guan, Jihong; Zhou, Shuigeng
2015-01-01
Nucleosomes and the free linker DNA between them assemble the chromatin. Nucleosome positioning plays an important role in gene transcription regulation, DNA replication and repair, alternative splicing, and so on. With the rapid development of ChIP-seq, it is possible to computationally detect the positions of nucleosomes on chromosomes. However, existing methods cannot provide accurate and detailed information about the detected nucleosomes, especially for the nucleosomes with complex configurations where overlaps and noise exist. Meanwhile, they usually require some prior knowledge of nucleosomes as input, such as the size or the number of the unknown nucleosomes, which may significantly influence the detection results. In this paper, we propose a novel approach DPNuc for identifying nucleosome positions based on the Dirichlet process mixture model. In our method, Markov chain Monte Carlo (MCMC) simulations are employed to determine the mixture model with no need of prior knowledge about nucleosomes. Compared with three existing methods, our approach can provide more detailed information of the detected nucleosomes and can more reasonably reveal the real configurations of the chromosomes; especially, our approach performs better in the complex overlapping situations. By mapping the detected nucleosomes to a synthetic benchmark nucleosome map and two existing benchmark nucleosome maps, it is shown that our approach achieves a better performance in identifying nucleosome positions and gets a higher F-score. Finally, we show that our approach can more reliably detect the size distribution of nucleosomes.
A Unified Model for BDS Wide Area and Local Area Augmentation Positioning Based on Raw Observations.
Tu, Rui; Zhang, Rui; Lu, Cuixian; Zhang, Pengfei; Liu, Jinhai; Lu, Xiaochun
2017-03-03
In this study, a unified model for BeiDou Navigation Satellite System (BDS) wide area and local area augmentation positioning based on raw observations has been proposed. Applying this model, both the Real-Time Kinematic (RTK) and Precise Point Positioning (PPP) service can be realized by performing different corrections at the user end. This algorithm was assessed and validated with the BDS data collected at four regional stations from Day of Year (DOY) 080 to 083 of 2016. When the users are located within the local reference network, the fast and high precision RTK service can be achieved using the regional observation corrections, revealing a convergence time of about several seconds and a precision of about 2-3 cm. For the users out of the regional reference network, the global broadcast State-Space Represented (SSR) corrections can be utilized to realize the global PPP service which shows a convergence time of about 25 min for achieving an accuracy of 10 cm. With this unified model, it can not only integrate the Network RTK (NRTK) and PPP into a seamless positioning service, but also recover the ionosphere Vertical Total Electronic Content (VTEC) and Differential Code Bias (DCB) values that are useful for the ionosphere monitoring and modeling.
A Unified Model for BDS Wide Area and Local Area Augmentation Positioning Based on Raw Observations
Tu, Rui; Zhang, Rui; Lu, Cuixian; Zhang, Pengfei; Liu, Jinhai; Lu, Xiaochun
2017-01-01
In this study, a unified model for BeiDou Navigation Satellite System (BDS) wide area and local area augmentation positioning based on raw observations has been proposed. Applying this model, both the Real-Time Kinematic (RTK) and Precise Point Positioning (PPP) service can be realized by performing different corrections at the user end. This algorithm was assessed and validated with the BDS data collected at four regional stations from Day of Year (DOY) 080 to 083 of 2016. When the users are located within the local reference network, the fast and high precision RTK service can be achieved using the regional observation corrections, revealing a convergence time of about several seconds and a precision of about 2–3 cm. For the users out of the regional reference network, the global broadcast State-Space Represented (SSR) corrections can be utilized to realize the global PPP service which shows a convergence time of about 25 min for achieving an accuracy of 10 cm. With this unified model, it can not only integrate the Network RTK (NRTK) and PPP into a seamless positioning service, but also recover the ionosphere Vertical Total Electronic Content (VTEC) and Differential Code Bias (DCB) values that are useful for the ionosphere monitoring and modeling. PMID:28273814
Implement the RFID position based system of automatic tablets packaging machine for patient safety.
Chang, Ching-Hsiang; Lai, Yeong-Lin; Chen, Chih-Cheng
2012-12-01
Patient safety has been regarded as the most important quality policy of hospital management. The medicine dispensing definitely plays an influential role in the Joint Commission International Accreditation Standards. The problem we are going to discuss in this paper is that the function of detecting mistakes does not exist in the Automatic Tablets packaging machine (ATPM) in the hospital pharmacy department when the pharmacists implement the replenishment of cassettes. In this situation, there are higher possibilities of placing the wrong cassettes back to the wrong positions, so that the human errors will lead to a crucial impact on total inpatients undoubtedly. Therefore, this study aims to design the RFID (Radio frequency identification) position based system (PBS) for the ATPM with passive high frequency (HF) model. At first, we placed the HF tags on each cassette and installed the HF readers on the cabinets for each position. Then, the system works on the reading loop to verify ID numbers and positions on each cassette. Next, the system would detect whether the orbit opens or not and controls the readers' working power consumption for drug storage temperature. Finally, we use the RFID PBS of the ATPM to achieve the goal of avoiding the medication errors at any time for patient safety.
Quantum computation for quantum chemistry
NASA Astrophysics Data System (ADS)
Aspuru-Guzik, Alan
2010-03-01
Numerically exact simulation of quantum systems on classical computers is in general, an intractable computational problem. Computational chemists have made progress in the development of approximate methods to tackle complex chemical problems. The downside of these approximate methods is that their failure for certain important cases such as long-range charge transfer states in the case of traditional density functional theory. In 1982, Richard Feynman suggested that a quantum device should be able to simulate quantum systems (in our case, molecules) exactly using quantum computers in a tractable fashion. Our group has been working in the development of quantum chemistry algorithms for quantum devices. In this talk, I will describe how quantum computers can be employed to carry out numerically exact quantum chemistry and chemical reaction dynamics calculations, as well as molecular properties. Finally, I will describe our recent experimental quantum computation of the energy of the hydrogen molecule using an optical quantum computer.
Pfeiffer, P.; Sanz, M.
2016-07-06
Technology based on memristors, resistors with memory whose resistance depends on the history of the crossing charges, has lately enhanced the classical paradigm of computation with neuromorphic architectures. However, in contrast to the known quantized models of passive circuit elements, such as inductors, capacitors or resistors, the design and realization of a quantum memristor is still missing. Here, we introduce the concept of a quantum memristor as a quantum dissipative device, whose decoherence mechanism is controlled by a continuous-measurement feedback scheme, which accounts for the memory. Indeed, we provide numerical simulations showing that memory effects actually persist in the quantum regime. Our quantization method, specifically designed for superconducting circuits, may be extended to other quantum platforms, allowing for memristor-type constructions in different quantum technologies. As a result, the proposed quantum memristor is then a building block for neuromorphic quantum computation and quantum simulations of non-Markovian systems.
Pfeiffer, P.; Egusquiza, I. L.; Di Ventra, M.; Sanz, M.; Solano, E.
2016-01-01
Technology based on memristors, resistors with memory whose resistance depends on the history of the crossing charges, has lately enhanced the classical paradigm of computation with neuromorphic architectures. However, in contrast to the known quantized models of passive circuit elements, such as inductors, capacitors or resistors, the design and realization of a quantum memristor is still missing. Here, we introduce the concept of a quantum memristor as a quantum dissipative device, whose decoherence mechanism is controlled by a continuous-measurement feedback scheme, which accounts for the memory. Indeed, we provide numerical simulations showing that memory effects actually persist in the quantum regime. Our quantization method, specifically designed for superconducting circuits, may be extended to other quantum platforms, allowing for memristor-type constructions in different quantum technologies. The proposed quantum memristor is then a building block for neuromorphic quantum computation and quantum simulations of non-Markovian systems. PMID:27381511
Quantum Error Correction with Biased Noise
NASA Astrophysics Data System (ADS)
Brooks, Peter
Quantum computing offers powerful new techniques for speeding up the calculation of many classically intractable problems. Quantum algorithms can allow for the efficient simulation of physical systems, with applications to basic research, chemical modeling, and drug discovery; other algorithms have important implications for cryptography and internet security. At the same time, building a quantum computer is a daunting task, requiring the coherent manipulation of systems with many quantum degrees of freedom while preventing environmental noise from interacting too strongly with the system. Fortunately, we know that, under reasonable assumptions, we can use the techniques of quantum error correction and fault tolerance to achieve an arbitrary reduction in the noise level. In this thesis, we look at how additional information about the structure of noise, or "noise bias," can improve or alter the performance of techniques in quantum error correction and fault tolerance. In Chapter 2, we explore the possibility of designing certain quantum gates to be extremely robust with respect to errors in their operation. This naturally leads to structured noise where certain gates can be implemented in a protected manner, allowing the user to focus their protection on the noisier unprotected operations. In Chapter 3, we examine how to tailor error-correcting codes and fault-tolerant quantum circuits in the presence of dephasing biased noise, where dephasing errors are far more common than bit-flip errors. By using an appropriately asymmetric code, we demonstrate the ability to improve the amount of error reduction and decrease the physical resources required for error correction. In Chapter 4, we analyze a variety of protocols for distilling magic states, which enable universal quantum computation, in the presence of faulty Clifford operations. Here again there is a hierarchy of noise levels, with a fixed error rate for faulty gates, and a second rate for errors in the distilled
NASA Astrophysics Data System (ADS)
Ohori, Daisuke; Fukuyama, Atsuhiko; Thomas, Cedric; Higo, Akio; Samukawa, Seiji; Ikari, Tetsuo
2016-09-01
We demonstrated that the lattice-matched GaAs quantum nanodisks (QNDs) embedded in an AlGaAs matrix were fabricated by our original top-down nanoprocess. Lattice-matched GaAs QNDs are very attractive in quantum cryptography because the spin relaxation time of QNDs might be longer than that of strained quantum dots. Quantum levels of QNDs were investigated by the photoluminescence (PL) technique. The minimum diameter and thickness of QNDs were 7 and 8 nm, respectively. PL peaks of QNDs at 1.64 and 1.66 eV were observed to be higher than that of multiple quantum wells (MQWs) observed at 1.57 eV. It is suggested that these peaks are due to the diameter distribution of QNDs. The calculated quantum levels were in good agreement with the present experimental results. The observation of the PL peaks from QNDs demonstrates that the quantum level is strongly confined not only in the perpendicular direction but also in the lateral direction.
Completely device-independent quantum key distribution
NASA Astrophysics Data System (ADS)
Aguilar, Edgar A.; Ramanathan, Ravishankar; Kofler, Johannes; Pawłowski, Marcin
2016-08-01
Quantum key distribution (QKD) is a provably secure way for two distant parties to establish a common secret key, which then can be used in a classical cryptographic scheme. Using quantum entanglement, one can reduce the necessary assumptions that the parties have to make about their devices, giving rise to device-independent QKD (DIQKD). However, in all existing protocols to date the parties need to have an initial (at least partially) random seed as a resource. In this work, we show that this requirement can be dropped. Using recent advances in the fields of randomness amplification and randomness expansion, we demonstrate that it is sufficient for the message the parties want to communicate to be (partially) unknown to the adversaries—an assumption without which any type of cryptography would be pointless to begin with. One party can use her secret message to locally generate a secret sequence of bits, which can then be openly used by herself and the other party in a DIQKD protocol. Hence our work reduces the requirements needed to perform secure DIQKD and establish safe communication.
Quantum robots and quantum computers
Benioff, P.
1998-07-01
Validation of a presumably universal theory, such as quantum mechanics, requires a quantum mechanical description of systems that carry out theoretical calculations and systems that carry out experiments. The description of quantum computers is under active development. No description of systems to carry out experiments has been given. A small step in this direction is taken here by giving a description of quantum robots as mobile systems with on board quantum computers that interact with different environments. Some properties of these systems are discussed. A specific model based on the literature descriptions of quantum Turing machines is presented.
NASA Astrophysics Data System (ADS)
Crease, Robert P.
2012-06-01
Fresh from his appearance on the latest Physics World podcast, which examined the enduring popularity of books about quantum mechanics, Robert P Crease surveys the many tour guides to the quantum world.
Zurek, Wojciech H
2008-01-01
Quantum Darwinism - proliferation, in the environment, of multiple records of selected states of the system (its information-theoretic progeny) - explains how quantum fragility of individual state can lead to classical robustness of their multitude.
Pfeiffer, P.; Egusquiza, I. L.; Di Ventra, M.; ...
2016-07-06
Technology based on memristors, resistors with memory whose resistance depends on the history of the crossing charges, has lately enhanced the classical paradigm of computation with neuromorphic architectures. However, in contrast to the known quantized models of passive circuit elements, such as inductors, capacitors or resistors, the design and realization of a quantum memristor is still missing. Here, we introduce the concept of a quantum memristor as a quantum dissipative device, whose decoherence mechanism is controlled by a continuous-measurement feedback scheme, which accounts for the memory. Indeed, we provide numerical simulations showing that memory effects actually persist in the quantummore » regime. Our quantization method, specifically designed for superconducting circuits, may be extended to other quantum platforms, allowing for memristor-type constructions in different quantum technologies. As a result, the proposed quantum memristor is then a building block for neuromorphic quantum computation and quantum simulations of non-Markovian systems.« less
1994-08-15
Notre Dame was concerned with a variety of quantum transport in mesoscopic structures. This research was funded by the Air Force Office of Scientific...Research under Grant No. AFOSR-91-0211. The major issues examined included quantum transport in high magnetic fields and modulated channels, Coulomb...lifetimes in quasi-1D structures, quantum transport experiments in metals, the mesoscopic photovoltaic effect, and new techniques for fabricating quantum structures in semiconductors.
Loss-tolerant quantum secure positioning with weak laser sources
Lim, Charles Ci Wen; Xu, Feihu; Siopsis, George; ...
2016-09-14
Quantum position verification (QPV) is the art of verifying the geographical location of an untrusted party. It has recently been shown that the widely studied Bennett & Brassard 1984 (BB84) QPV protocol is insecure after the 3 dB loss point assuming local operations and classical communication (LOCC) adversaries. Here in this paper, we propose a time-reversed entanglement swapping QPV protocol (based on measurement-device-independent quantum cryptography) that is highly robust against quantum channel loss. First, assuming ideal qubit sources, we show that the protocol is secure against LOCC adversaries for any quantum channel loss, thereby overcoming the 3 dB loss limit.more » Then, we analyze the security of the protocol in a more practical setting involving weak laser sources and linear optics. Lastly, in this setting, we find that the security only degrades by an additive constant and the protocol is able to verify positions up to 47 dB channel loss.« less
Minimal input sets determining phase-covariant and universal quantum cloning
NASA Astrophysics Data System (ADS)
Jing, Li; Wang, Yi-Nan; Shi, Han-Duo; Mu, Liang-Zhu; Fan, Heng
2012-12-01
We study the minimal input sets which can determine completely the universal and the phase-covariant quantum cloning machines. We find that the universal quantum cloning machine, which can copy an arbitrary input qubit to two identical copies, however, can be determined completely by only four input states located at the four vertices of a tetrahedron in a Bloch sphere. The phase-covariant quantum cloning machine, which can create two copies from an arbitrary qubit located on the equator of the Bloch sphere, can be determined by three qubits located symmetrically on the equator of the Bloch sphere with equal relative phase. These results sharpen further the well-known results that Bennett-Brassard 1984 protocol (BB84) states and six states used in quantum cryptography can determine completely the phase-covariant and universal quantum cloning machines. This can simplify the testing procedure of whether the quantum clone machines are successful or not; namely, we only need to check that the minimal input sets can be cloned optimally, which can ensure that the quantum clone machines can work well for all input states.
NASA Astrophysics Data System (ADS)
Moulick, Subhayan Roy; Panigrahi, Prasanta K.
2016-06-01
We propose the idea of a quantum cheque scheme, a cryptographic protocol in which any legitimate client of a trusted bank can issue a cheque, that cannot be counterfeited or altered in anyway, and can be verified by a bank or any of its branches. We formally define a quantum cheque and present the first unconditionally secure quantum cheque scheme and show it to be secure against any no-signalling adversary. The proposed quantum cheque scheme can been perceived as the quantum analog of Electronic Data Interchange, as an alternate for current e-Payment Gateways.
NASA Astrophysics Data System (ADS)
Brown, Matthew J.
2014-02-01
The framework of quantum frames can help unravel some of the interpretive difficulties i the foundation of quantum mechanics. In this paper, I begin by tracing the origins of this concept in Bohr's discussion of quantum theory and his theory of complementarity. Engaging with various interpreters and followers of Bohr, I argue that the correct account of quantum frames must be extended beyond literal space-time reference frames to frames defined by relations between a quantum system and the exosystem or external physical frame, of which measurement contexts are a particularly important example. This approach provides superior solutions to key EPR-type measurement and locality paradoxes.
NASA Astrophysics Data System (ADS)
Zurek, Wojciech Hubert
2009-03-01
Quantum Darwinism describes the proliferation, in the environment, of multiple records of selected states of a quantum system. It explains how the quantum fragility of a state of a single quantum system can lead to the classical robustness of states in their correlated multitude; shows how effective `wave-packet collapse' arises as a result of the proliferation throughout the environment of imprints of the state of the system; and provides a framework for the derivation of Born's rule, which relates the probabilities of detecting states to their amplitudes. Taken together, these three advances mark considerable progress towards settling the quantum measurement problem.
Geodesic paths and topological charges in quantum systems
NASA Astrophysics Data System (ADS)
Grangeiro Souza Barbosa Lima, Tiago Aecio
This dissertation focuses on one question: how should one drive an experimentally prepared state of a generic quantum system into a different target-state, simultaneously minimizing energy dissipation and maximizing the fidelity between the target and evolved-states? We develop optimal adiabatic driving protocols for general quantum systems, and show that these are geodesic paths. Geometric ideas have always played a fundamental role in the understanding and unification of physical phenomena, and the recent discovery of topological insulators has drawn great interest to topology from the field of condensed matter physics. Here, we discuss the quantum geometric tensor, a mathematical object that encodes geometrical and topological properties of a quantum system. It is related to the fidelity susceptibility (an important quantity regarding quantum phase transitions) and to the Berry curvature, which enables topological characterization through Berry phases. A refined understanding of the interplay between geometry and topology in quantum mechanics is of direct relevance to several emergent technologies, such as quantum computers, quantum cryptography, and quantum sensors. As a demonstration of how powerful geometric and topological ideas can become when combined, we present the results of an experiment that we recently proposed. This experimental work was done at the Google Quantum Lab, where researchers were able to visualize the topological nature of a two-qubit system in sharp detail, a startling contrast with earlier methods. To achieve this feat, the optimal protocols described in this dissertation were used, allowing for a great improvement on the experimental apparatus, without the need for technical engineering advances. Expanding the existing literature on the quantum geometric tensor using notions from differential geometry and topology, we build on the subject nowadays known as quantum geometry. We discuss how slowly changing a parameter of a quantum
Network technologies for O-band quantum telecommunications
NASA Astrophysics Data System (ADS)
Hall, Matthew A.
We have developed and characterized the preliminary network components necessary to realize practical quantum telecommunications in the 1310-nm O-band of the existing fiber optic infrastructure. Quantum network components available, at classical-telecommunicationsspeed, in the O-band would allow single-photon-level quantum data to be multiplexed with the bright 1550-nm C-band data that the telecommunications infrastructure already supports, therefore enabling quantum information---be it for quantum computing, cryptography, games or other purposes---to be easily distributed to remote parties. Two necessary network components are presented: a high-quality source of O-band entangled photon pairs and a switch capable of routing single photons while preserving the entanglement between the photon and its partner. The pairs are created in standard optical fiber, allowing for near-lossless coupling to the existing telecommunications infrastructure. The method used is also scalable, both in creating future identical sources and operating at much higher repetition rates. Such higher rates will ensure that a meaningful number of entangled photon pairs survive distribution, which is inherently lossy (though fiber optics minimize this loss over long distances). The other component required to establish a network more advanced than a point-to-point link is a single-photon switch. In order to successfully implement such a switch for the quantum data of interest, the design must be able to switch single-photon level signals with very low loss and near unity probability of success. It is capable of operating at network speeds while preserving the photon's quantum state.
Practical quantum key distribution protocol without monitoring signal disturbance
NASA Astrophysics Data System (ADS)
Sasaki, Toshihiko; Yamamoto, Yoshihisa; Koashi, Masato
2014-05-01
Quantum cryptography exploits the fundamental laws of quantum mechanics to provide a secure way to exchange private information. Such an exchange requires a common random bit sequence, called a key, to be shared secretly between the sender and the receiver. The basic idea behind quantum key distribution (QKD) has widely been understood as the property that any attempt to distinguish encoded quantum states causes a disturbance in the signal. As a result, implementation of a QKD protocol involves an estimation of the experimental parameters influenced by the eavesdropper's intervention, which is achieved by randomly sampling the signal. If the estimation of many parameters with high precision is required, the portion of the signal that is sacrificed increases, thus decreasing the efficiency of the protocol. Here we propose a QKD protocol based on an entirely different principle. The sender encodes a bit sequence onto non-orthogonal quantum states and the receiver randomly dictates how a single bit should be calculated from the sequence. The eavesdropper, who is unable to learn the whole of the sequence, cannot guess the bit value correctly. An achievable rate of secure key distribution is calculated by considering complementary choices between quantum measurements of two conjugate observables. We found that a practical implementation using a laser pulse train achieves a key rate comparable to a decoy-state QKD protocol, an often-used technique for lasers. It also has a better tolerance of bit errors and of finite-sized-key effects. We anticipate that this finding will give new insight into how the probabilistic nature of quantum mechanics can be related to secure communication, and will facilitate the simple and efficient use of conventional lasers for QKD.
Quantum random bit generation using energy fluctuations in stimulated Raman scattering.
Bustard, Philip J; England, Duncan G; Nunn, Josh; Moffatt, Doug; Spanner, Michael; Lausten, Rune; Sussman, Benjamin J
2013-12-02
Random number sequences are a critical resource in modern information processing systems, with applications in cryptography, numerical simulation, and data sampling. We introduce a quantum random number generator based on the measurement of pulse energy quantum fluctuations in Stokes light generated by spontaneously-initiated stimulated Raman scattering. Bright Stokes pulse energy fluctuations up to five times the mean energy are measured with fast photodiodes and converted to unbiased random binary strings. Since the pulse energy is a continuous variable, multiple bits can be extracted from a single measurement. Our approach can be generalized to a wide range of Raman active materials; here we demonstrate a prototype using the optical phonon line in bulk diamond.
Quantum games as quantum types
NASA Astrophysics Data System (ADS)
Delbecque, Yannick
In this thesis, we present a new model for higher-order quantum programming languages. The proposed model is an adaptation of the probabilistic game semantics developed by Danos and Harmer [DH02]: we expand it with quantum strategies which enable one to represent quantum states and quantum operations. Some of the basic properties of these strategies are established and then used to construct denotational semantics for three quantum programming languages. The first of these languages is a formalisation of the measurement calculus proposed by Danos et al. [DKP07]. The other two are new: they are higher-order quantum programming languages. Previous attempts to define a denotational semantics for higher-order quantum programming languages have failed. We identify some of the key reasons for this and base the design of our higher-order languages on these observations. The game semantics proposed in this thesis is the first denotational semantics for a lambda-calculus equipped with quantum types and with extra operations which allow one to program quantum algorithms. The results presented validate the two different approaches used in the design of these two new higher-order languages: a first one where quantum states are used through references and a second one where they are introduced as constants in the language. The quantum strategies presented in this thesis allow one to understand the constraints that must be imposed on quantum type systems with higher-order types. The most significant constraint is the fact that abstraction over part of the tensor product of many unknown quantum states must not be allowed. Quantum strategies are a new mathematical model which describes the interaction between classical and quantum data using system-environment dialogues. The interactions between the different parts of a quantum system are described using the rich structure generated by composition of strategies. This approach has enough generality to be put in relation with other
NASA Astrophysics Data System (ADS)
Wang, Huiquan; Wu, Junjie; He, Hongjuan; Tang, Yuhua
2016-09-01
Studies on two-particle quantum walks show that the spatial interaction between walkers will dynamically generate complex entanglement. However, those entanglement states are usually on a large state space and their evolutions are complex. It makes the entanglement states generated by quantum walk difficult to be applied directly in many applications of quantum information, such as quantum teleportation and quantum cryptography. In this paper, we firstly analyse a localization phenomena of two-particle quantum walk and then introduce how to use it to generate a Bell state. We will show that one special superposition component of the walkers' state is localized on the root vertex if a certain interaction exists between walkers. This localization is interesting because it is contrary to our knowledge that quantum walk spreads faster than its classical counterpart. More interestingly, the localized component is a Bell state in the coin space of two walkers. By this method, we can obtain a Bell state easily from the quantum walk with spatial interaction by a local measurement, which is required in many applications. Through simulations, we verify that this method is able to generate the Bell state 1/√{2}(|A rangle _1|Arangle _2 ± |Brangle _1|Brangle _2) in the coin space of two walkers with fidelity greater than 99.99999 % in theory, and we have at least a 50 % probability to obtain the expected Bell state after a proper local measurement.
NASA Astrophysics Data System (ADS)
Levy, Amikam; Diósi, Lajos; Kosloff, Ronnie
2016-05-01
In this work we present the concept of a quantum flywheel coupled to a quantum heat engine. The flywheel stores useful work in its energy levels, while additional power is extracted continuously from the device. Generally, the energy exchange between a quantum engine and a quantized work repository is accompanied by heat, which degrades the charging efficiency. Specifically when the quantum harmonic oscillator acts as a work repository, quantum and thermal fluctuations dominate the dynamics. Quantum monitoring and feedback control are applied to the flywheel in order to reach steady state and regulate its operation. To maximize the charging efficiency one needs a balance between the information gained by measuring the system and the information fed back to the system. The dynamics of the flywheel are described by a stochastic master equation that accounts for the engine, the external driving, the measurement, and the feedback operations.
NASA Astrophysics Data System (ADS)
Braun, Daniel; Giraud, Olivier; Braun, Peter A.
2010-03-01
We introduce and study a measure of ``quantumness'' of a quantum state based on its Hilbert-Schmidt distance from the set of classical states. ``Classical states'' were defined earlier as states for which a positive P-function exists, i.e. they are mixtures of coherent states [1]. We study invariance properties of the measure, upper bounds, and its relation to entanglement measures. We evaluate the quantumness of a number of physically interesting states and show that for any physical system in thermal equilibrium there is a finite critical temperature above which quantumness vanishes. We then use the measure for identifying the ``most quantum'' states. Such states are expected to be potentially most useful for quantum information theoretical applications. We find these states explicitly for low-dimensional spin-systems, and show that they possess beautiful, highly symmetric Majorana representations. [4pt] [1] Classicality of spin states, Olivier Giraud, Petr Braun, and Daniel Braun, Phys. Rev. A 78, 042112 (2008)
Reddy, Alavalapati Goutham; Das, Ashok Kumar; Odelu, Vanga; Yoo, Kee-Young
2016-01-01
Biometric based authentication protocols for multi-server architectures have gained momentum in recent times due to advancements in wireless technologies and associated constraints. Lu et al. recently proposed a robust biometric based authentication with key agreement protocol for a multi-server environment using smart cards. They claimed that their protocol is efficient and resistant to prominent security attacks. The careful investigation of this paper proves that Lu et al.'s protocol does not provide user anonymity, perfect forward secrecy and is susceptible to server and user impersonation attacks, man-in-middle attacks and clock synchronization problems. In addition, this paper proposes an enhanced biometric based authentication with key-agreement protocol for multi-server architecture based on elliptic curve cryptography using smartcards. We proved that the proposed protocol achieves mutual authentication using Burrows-Abadi-Needham (BAN) logic. The formal security of the proposed protocol is verified using the AVISPA (Automated Validation of Internet Security Protocols and Applications) tool to show that our protocol can withstand active and passive attacks. The formal and informal security analyses and performance analysis demonstrates that the proposed protocol is robust and efficient compared to Lu et al.'s protocol and existing similar protocols.
Reddy, Alavalapati Goutham; Das, Ashok Kumar; Odelu, Vanga; Yoo, Kee-Young
2016-01-01
Biometric based authentication protocols for multi-server architectures have gained momentum in recent times due to advancements in wireless technologies and associated constraints. Lu et al. recently proposed a robust biometric based authentication with key agreement protocol for a multi-server environment using smart cards. They claimed that their protocol is efficient and resistant to prominent security attacks. The careful investigation of this paper proves that Lu et al.’s protocol does not provide user anonymity, perfect forward secrecy and is susceptible to server and user impersonation attacks, man-in-middle attacks and clock synchronization problems. In addition, this paper proposes an enhanced biometric based authentication with key-agreement protocol for multi-server architecture based on elliptic curve cryptography using smartcards. We proved that the proposed protocol achieves mutual authentication using Burrows-Abadi-Needham (BAN) logic. The formal security of the proposed protocol is verified using the AVISPA (Automated Validation of Internet Security Protocols and Applications) tool to show that our protocol can withstand active and passive attacks. The formal and informal security analyses and performance analysis demonstrates that the proposed protocol is robust and efficient compared to Lu et al.’s protocol and existing similar protocols. PMID:27163786
2016-03-24
This included optimizing the MBE growth conditions of a near-surface quantum wells with emission around 1500nm and fabrication of arrays of various...antennas and near-surface quantum-confined structures. This included optimizing the molecular beam epitaxy growth conditions of a near-surface quantum...due to the single process epitaxial growth , increases the interaction. Low densities of indium islands have been shown to increase the
NASA Astrophysics Data System (ADS)
Lanzagorta, Marco; Jitrik, Oliverio; Uhlmann, Jeffrey; Venegas, Salvador
2016-05-01
A major scientific thrust from recent years has been to try to harness quantum phenomena to increase the performance of a wide variety of information processing devices. In particular, quantum radar has emerged as an intriguing theoretical concept that could revolutionize electromagnetic standoff sensing. In this paper we will discuss how the techniques developed for quantum radar could also be used towards the design of novel seismographs able to detect small ground vibrations., We use a hypothetical earthquake warning system in order to compare quantum seismography with traditional seismographic techniques.
NASA Astrophysics Data System (ADS)
Tartakovskii, Alexander
2012-07-01
Part I. Nanostructure Design and Structural Properties of Epitaxially Grown Quantum Dots and Nanowires: 1. Growth of III/V semiconductor quantum dots C. Schneider, S. Hofling and A. Forchel; 2. Single semiconductor quantum dots in nanowires: growth, optics, and devices M. E. Reimer, N. Akopian, M. Barkelid, G. Bulgarini, R. Heeres, M. Hocevar, B. J. Witek, E. Bakkers and V. Zwiller; 3. Atomic scale analysis of self-assembled quantum dots by cross-sectional scanning tunneling microscopy and atom probe tomography J. G. Keizer and P. M. Koenraad; Part II. Manipulation of Individual Quantum States in Quantum Dots Using Optical Techniques: 4. Studies of the hole spin in self-assembled quantum dots using optical techniques B. D. Gerardot and R. J. Warburton; 5. Resonance fluorescence from a single quantum dot A. N. Vamivakas, C. Matthiesen, Y. Zhao, C.-Y. Lu and M. Atature; 6. Coherent control of quantum dot excitons using ultra-fast optical techniques A. J. Ramsay and A. M. Fox; 7. Optical probing of holes in quantum dot molecules: structure, symmetry, and spin M. F. Doty and J. I. Climente; Part III. Optical Properties of Quantum Dots in Photonic Cavities and Plasmon-Coupled Dots: 8. Deterministic light-matter coupling using single quantum dots P. Senellart; 9. Quantum dots in photonic crystal cavities A. Faraon, D. Englund, I. Fushman, A. Majumdar and J. Vukovic; 10. Photon statistics in quantum dot micropillar emission M. Asmann and M. Bayer; 11. Nanoplasmonics with colloidal quantum dots V. Temnov and U. Woggon; Part IV. Quantum Dot Nano-Laboratory: Magnetic Ions and Nuclear Spins in a Dot: 12. Dynamics and optical control of an individual Mn spin in a quantum dot L. Besombes, C. Le Gall, H. Boukari and H. Mariette; 13. Optical spectroscopy of InAs/GaAs quantum dots doped with a single Mn atom O. Krebs and A. Lemaitre; 14. Nuclear spin effects in quantum dot optics B. Urbaszek, B. Eble, T. Amand and X. Marie; Part V. Electron Transport in Quantum Dots Fabricated by
Generation of Bi-partite Polarization Correlation using Coherent States for Quantum Communication
NASA Astrophysics Data System (ADS)
Bollen, Viktor; Meng Sua, Yong; Fook Lee, Kim
2010-03-01
We present a novel scheme to generate bi-partite polarization correlation using coherent states for quantum communication. The scheme can be used for entanglement based quantum cryptography, where the bi-partite correlation will be protected by quantum noise. We perform experimental measurement on two independent coherent states with low mean photon numbers. A coherent state with polarization H is mixed with another coherent state with polarization V through a beam splitter. Polarization correlation is manipulated by using a quarter wave plate and a linear polarizer at each output of the beam splitter. The product signal obtained from the output modes contains bi-partite correlation and other noise terms. We obtain the bi-partite correlation function by employing mean-value measurement based on Stapp's formulation on the product signal, where the noise term is then averaged to zero due to randomness of quantum phase noise. The bi-partite correlation obtained by using two coherent states is quantum correlation because coherent states with low mean photon numbers are involved and the correlations are protected by randomness of quantum noise as inherited by mean photon number fluctuation and its associated phase fluctuation. Preparations for four types of coherent-state polarization correlation functions are also outlined.
Graph State-Based Quantum Secret Sharing with the Chinese Remainder Theorem
NASA Astrophysics Data System (ADS)
Guo, Ying; Luo, Peng; Wang, Yijun
2016-11-01
Quantum secret sharing (QSS) is a significant quantum cryptography technology in the literature. Dividing an initial secret into several sub-secrets which are then transferred to other legal participants so that it can be securely recovered in a collaboration fashion. In this paper, we develop a quantum route selection based on the encoded quantum graph state, thus enabling the practical QSS scheme in the small-scale complex quantum network. Legal participants are conveniently designated with the quantum route selection using the entanglement of the encoded graph states. Each participant holds a vertex of the graph state so that legal participants are selected through performing operations on specific vertices. The Chinese remainder theorem (CRT) strengthens the security of the recovering process of the initial secret among the legal participants. The security is ensured by the entanglement of the encoded graph states that are cooperatively prepared and shared by legal users beforehand with the sub-secrets embedded in the CRT over finite fields.
Dissipative quantum computing with open quantum walks
Sinayskiy, Ilya; Petruccione, Francesco
2014-12-04
An open quantum walk approach to the implementation of a dissipative quantum computing scheme is presented. The formalism is demonstrated for the example of an open quantum walk implementation of a 3 qubit quantum circuit consisting of 10 gates.
Maximal success probabilities of linear-optical quantum gates
NASA Astrophysics Data System (ADS)
Uskov, Dmitry B.; Kaplan, Lev; Smith, A. Matthew; Huver, Sean D.; Dowling, Jonathan P.
2009-04-01
Numerical optimization is used to design linear-optical devices that implement a desired quantum gate with perfect fidelity, while maximizing the success rate. For the two-qubit controlled-sign [or controlled NOT (CNOT)] gate, we provide numerical evidence that the maximum success rate is S=2/27 using two unentangled ancilla resources; interestingly, additional ancilla resources do not increase the success rate. For the three-qubit Toffoli gate, we show that perfect fidelity is obtained with only three unentangled ancilla photons—less than in any existing scheme—with a maximum S=0.00340 . This compares well to S=(2/27)2/2≈0.00274 , obtainable by combining two CNOT gates and a passive quantum filter [T. C. Ralph, K. J. Resch, and A. Gilchrist, Phys. Rev. A 75, 022313 (2007)]. The general optimization approach can easily be applied to other areas of interest, such as quantum error correction, cryptography, and metrology [M. M. Wilde and D. B. Uskov, Phys. Rev. A 79, 022305 (2009); G. A. Durkin and J. P. Dowling, Phys. Rev. Lett. 99, 070801 (2007)].
Generation of entanglement in quantum parametric oscillators using phase control
Gonzalez-Henao, J. C.; Pugliese, E.; Euzzor, S.; Abdalah, S.F.; Meucci, R.; Roversi, J. A.
2015-01-01
The control of quantum entanglement in systems in contact with environment plays an important role in information processing, cryptography and quantum computing. However, interactions with the environment, even when very weak, entail decoherence in the system with consequent loss of entanglement. Here we consider a system of two coupled oscillators in contact with a common heat bath and with a time dependent oscillation frequency. The possibility to control the entanglement of the oscillators by means of an external sinusoidal perturbation applied to the oscillation frequency has been theoretically explored. We demonstrate that the oscillators become entangled exactly in the region where the classical counterpart is unstable, otherwise when the classical system is stable, entanglement is not possible. Therefore, we can control the entanglement swapping from stable to unstable regions by adjusting amplitude and phase of our external controller. We also show that the entanglement rate is approximately proportional to the real part of the Floquet coefficient of the classical counterpart of the oscillators. Our results have the intriguing peculiarity of manipulating quantum information operating on a classical system. PMID:26286485
Pure sources and efficient detectors for optical quantum information processing
NASA Astrophysics Data System (ADS)
Zielnicki, Kevin
Over the last sixty years, classical information theory has revolutionized the understanding of the nature of information, and how it can be quantified and manipulated. Quantum information processing extends these lessons to quantum systems, where the properties of intrinsic uncertainty and entanglement fundamentally defy classical explanation. This growing field has many potential applications, including computing, cryptography, communication, and metrology. As inherently mobile quantum particles, photons are likely to play an important role in any mature large-scale quantum information processing system. However, the available methods for producing and detecting complex multi-photon states place practical limits on the feasibility of sophisticated optical quantum information processing experiments. In a typical quantum information protocol, a source first produces an interesting or useful quantum state (or set of states), perhaps involving superposition or entanglement. Then, some manipulations are performed on this state, perhaps involving quantum logic gates which further manipulate or entangle the intial state. Finally, the state must be detected, obtaining some desired measurement result, e.g., for secure communication or computationally efficient factoring. The work presented here concerns the first and last stages of this process as they relate to photons: sources and detectors. Our work on sources is based on the need for optimized non-classical states of light delivered at high rates, particularly of single photons in a pure quantum state. We seek to better understand the properties of spontaneous parameteric downconversion (SPDC) sources of photon pairs, and in doing so, produce such an optimized source. We report an SPDC source which produces pure heralded single photons with little or no spectral filtering, allowing a significant rate enhancement. Our work on detectors is based on the need to reliably measure single-photon states. We have focused on
NASA Technical Reports Server (NTRS)
Abrams, D.; Williams, C.
1999-01-01
This thesis describes several new quantum algorithms. These include a polynomial time algorithm that uses a quantum fast Fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases for which all know classical algorithms require exponential time.
NASA Technical Reports Server (NTRS)
Lee, H.; Kok, P.; Dowling, J. P.
2002-01-01
This paper addresses the formal equivalence between the Mach-Zehnder interferometer, the Ramsey spectroscope, and a specific quantum logical gate. Based on this equivalence we introduce the quantum Rosetta Stone, and we describe a projective measurement scheme for generating the desired correlations between the interferometric input states in order to achieve Heisenberg-limited sensitivity.
NASA Astrophysics Data System (ADS)
Baaquie, Belal E.
2004-11-01
Financial mathematics is currently almost completely dominated by stochastic calculus. Presenting a completely independent approach, this book applies the mathematical and conceptual formalism of quantum mechanics and quantum field theory (with particular emphasis on the path integral) to the theory of options and to the modeling of interest rates. Many new results, accordingly, emerge from the author's perspective.
NASA Astrophysics Data System (ADS)
Casati, Giulio; Chirikov, Boris
1995-04-01
Preface; Acknowledgments; Introduction: 1. The legacy of chaos in quantum mechanics G. Casati and B. V. Chirikov; Part I. Classical Chaos and Quantum Localization: 2. Stochastic behaviour of a quantum pendulum under a periodic perturbation G. Casati, B. V. Chirikov, F. M. Izrailev and J. Ford; 3. Quantum dynamics of a nonintegrable system D. R. Grempel, R. E. Prange and S. E. Fishman; 4. Excitation of molecular rotation by periodic microwave pulses. A testing ground for Anderson localization R. Blümel, S. Fishman and U. Smilansky; 5. Localization of diffusive excitation in multi-level systems D. K. Shepelyansky; 6. Classical and quantum chaos for a kicked top F. Haake, M. Kus and R. Scharf; 7. Self-similarity in quantum dynamics L. E. Reichl and L. Haoming; 8. Time irreversibility of classically chaotic quantum dynamics K. Ikeda; 9. Effect of noise on time-dependent quantum chaos E. Ott, T. M. Antonsen Jr and J. D. Hanson; 10. Dynamical localization, dissipation and noise R. F. Graham; 11. Maximum entropy models and quantum transmission in disordered systems J.-L. Pichard and M. Sanquer; 12. Solid state 'atoms' in intense oscillating fields M. S. Sherwin; Part II. Atoms in Strong Fields: 13. Localization of classically chaotic diffusion for hydrogen atoms in microwave fields J. E. Bayfield, G. Casati, I. Guarneri and D. W. Sokol; 14. Inhibition of quantum transport due to 'scars' of unstable periodic orbits R. V. Jensen, M. M. Sanders, M. Saraceno and B. Sundaram; 15. Rubidium Rydberg atoms in strong fields G. Benson, G. Raithel and H. Walther; 16. Diamagnetic Rydberg atom: confrontation of calculated and observed spectra C.-H. Iu, G. R. Welch, M. M. Kash, D. Kleppner, D. Delande and J. C. Gay; 17. Semiclassical approximation for the quantum states of a hydrogen atom in a magnetic field near the ionization limit M. Y. Kuchiev and O. P. Sushkov; 18. The semiclassical helium atom D. Wintgen, K. Richter and G. Tanner; 19. Stretched helium: a model for quantum chaos
NASA Astrophysics Data System (ADS)
Casati, Giulio; Chirikov, Boris
2006-11-01
Preface; Acknowledgments; Introduction: 1. The legacy of chaos in quantum mechanics G. Casati and B. V. Chirikov; Part I. Classical Chaos and Quantum Localization: 2. Stochastic behaviour of a quantum pendulum under a periodic perturbation G. Casati, B. V. Chirikov, F. M. Izrailev and J. Ford; 3. Quantum dynamics of a nonintegrable system D. R. Grempel, R. E. Prange and S. E. Fishman; 4. Excitation of molecular rotation by periodic microwave pulses. A testing ground for Anderson localization R. Blümel, S. Fishman and U. Smilansky; 5. Localization of diffusive excitation in multi-level systems D. K. Shepelyansky; 6. Classical and quantum chaos for a kicked top F. Haake, M. Kus and R. Scharf; 7. Self-similarity in quantum dynamics L. E. Reichl and L. Haoming; 8. Time irreversibility of classically chaotic quantum dynamics K. Ikeda; 9. Effect of noise on time-dependent quantum chaos E. Ott, T. M. Antonsen Jr and J. D. Hanson; 10. Dynamical localization, dissipation and noise R. F. Graham; 11. Maximum entropy models and quantum transmission in disordered systems J.-L. Pichard and M. Sanquer; 12. Solid state 'atoms' in intense oscillating fields M. S. Sherwin; Part II. Atoms in Strong Fields: 13. Localization of classically chaotic diffusion for hydrogen atoms in microwave fields J. E. Bayfield, G. Casati, I. Guarneri and D. W. Sokol; 14. Inhibition of quantum transport due to 'scars' of unstable periodic orbits R. V. Jensen, M. M. Sanders, M. Saraceno and B. Sundaram; 15. Rubidium Rydberg atoms in strong fields G. Benson, G. Raithel and H. Walther; 16. Diamagnetic Rydberg atom: confrontation of calculated and observed spectra C.-H. Iu, G. R. Welch, M. M. Kash, D. Kleppner, D. Delande and J. C. Gay; 17. Semiclassical approximation for the quantum states of a hydrogen atom in a magnetic field near the ionization limit M. Y. Kuchiev and O. P. Sushkov; 18. The semiclassical helium atom D. Wintgen, K. Richter and G. Tanner; 19. Stretched helium: a model for quantum chaos
2010-03-04
1227–1230 (2009). 31. Olmschenk, S. et al. Quantum teleportation between distant matter qubits. Science 323, 486–489 (2009). 32. Dür, W., Briegel, H...REVIEWS Quantum computers T. D. Ladd1{, F. Jelezko2, R. Laflamme3,4,5, Y. Nakamura6,7, C. Monroe8,9 & J. L. O’Brien10 Over the past several decades... quantum information science has emerged to seek answers to the question: can we gain some advantage by storing, transmitting and processing
Noise and measurement errors in a practical two-state quantum bit commitment protocol
NASA Astrophysics Data System (ADS)
Loura, Ricardo; Almeida, Álvaro J.; André, Paulo S.; Pinto, Armando N.; Mateus, Paulo; Paunković, Nikola
2014-05-01
We present a two-state practical quantum bit commitment protocol, the security of which is based on the current technological limitations, namely the nonexistence of either stable long-term quantum memories or nondemolition measurements. For an optical realization of the protocol, we model the errors, which occur due to the noise and equipment (source, fibers, and detectors) imperfections, accumulated during emission, transmission, and measurement of photons. The optical part is modeled as a combination of a depolarizing channel (white noise), unitary evolution (e.g., systematic rotation of the polarization axis of photons), and two other basis-dependent channels, namely the phase- and bit-flip channels. We analyze quantitatively the effects of noise using two common information-theoretic measures of probability distribution distinguishability: the fidelity and the relative entropy. In particular, we discuss the optimal cheating strategy and show that it is always advantageous for a cheating agent to add some amount of white noise—the particular effect not being present in standard quantum security protocols. We also analyze the protocol's security when the use of (im)perfect nondemolition measurements and noisy or bounded quantum memories is allowed. Finally, we discuss errors occurring due to a finite detector efficiency, dark counts, and imperfect single-photon sources, and we show that the effects are the same as those of standard quantum cryptography.
Bit-string oblivious transfer based on quantum state computational distinguishability
NASA Astrophysics Data System (ADS)
Souto, A.; Mateus, P.; Adão, P.; Paunković, N.
2015-04-01
Oblivious transfer protocol is a basic building block in cryptography and is used to transfer information from a sender to a receiver in such a way that, at the end of the protocol, the sender does not know if the receiver got the message or not. Since Shor's quantum algorithm appeared, the security of most of the classical cryptographic schemes has been compromised, as they rely on the fact that factoring is infeasible. To overcome this, quantum mechanics has been used intensively in the past decades, and alternatives resistant to quantum attacks have been developed in order to fulfill the (potential) lack of security of a significant number of classical schemes. In this paper, we present a quantum computationally secure protocol for bit-string oblivious transfer between two parties, under the assumption of quantum hardness of state distinguishability and the constraint of performing at most few-qubit measurements (leaving open the question of general attacks performed on all qubits involved). The protocol is feasible, in the sense that it is implementable in polynomial time.
Quantum entanglement generation in trapped ions using coherent and dissipative methods
NASA Astrophysics Data System (ADS)
Lin, Yiheng
Entangled states are a key resource in fundamental quantum physics, quantum cryptography, and quantum computation. In this thesis, we focus on the demonstrations of two novel methods to generate entanglement. First, we implement dissipative production of a maximally entangled steady state on two trapped ions. Dissipative and coherent processes are combined and implemented in a continuous time-independent fashion, analogous to optical pumping of atomic states, continuously driving the system towards the steady entangled state. With this method, we obtain a Bell state fidelity up to 0.89(2). Second, we propose and demonstrate a novel coherent process to confine quantum evolution in a subspace between an initial separable state and the target entangled state. We demonstrate this scheme on two and three ions obtaining a Bell state fidelity up to 0.992(2). Both of these methods are robust against certain types of experimental noise and decoherence. Additionally, we demonstrate sympathetic cooling of ion chains to near the ground state of motion with an electromagnetically-induced-transparency (EIT) method. This results in roughly an order of magnitude faster cooling time while using significantly lower laser power compared to the conventional resolved sideband cooling method. These techniques may be helpful for scaled-up quantum computing.
Ladd, T D; Jelezko, F; Laflamme, R; Nakamura, Y; Monroe, C; O'Brien, J L
2010-03-04
Over the past several decades, quantum information science has emerged to seek answers to the question: can we gain some advantage by storing, transmitting and processing information encoded in systems that exhibit unique quantum properties? Today it is understood that the answer is yes, and many research groups around the world are working towards the highly ambitious technological goal of building a quantum computer, which would dramatically improve computational power for particular tasks. A number of physical systems, spanning much of modern physics, are being developed for quantum computation. However, it remains unclear which technology, if any, will ultimately prove successful. Here we describe the latest developments for each of the leading approaches and explain the major challenges for the future.
NASA Astrophysics Data System (ADS)
Gaidash, A. A.; Egorov, V. I.; Gleim, A. V.
2016-08-01
Quantum cryptography allows distributing secure keys between two users so that any performed eavesdropping attempt would be immediately discovered. However, in practice an eavesdropper can obtain key information from multi-photon states when attenuated laser radiation is used as a source of quantum states. In order to prevent actions of an eavesdropper, it is generally suggested to implement special cryptographic protocols, like decoy states or SARG04. In this paper, we describe an alternative method based on monitoring photon number statistics after detection. We provide a useful rule of thumb to estimate approximate order of difference of expected distribution and distribution in case of attack. Formula for calculating a minimum value of total pulses or time-gaps to resolve attack is shown. Also formulas for actual fraction of raw key known to Eve were derived. This method can therefore be used with any system and even combining with mentioned special protocols.
NASA Astrophysics Data System (ADS)
Stapp, Henry P.
2012-05-01
Robert Griffiths has recently addressed, within the framework of a `consistent quantum theory' that he has developed, the issue of whether, as is often claimed, quantum mechanics entails a need for faster-than-light transfers of information over long distances. He argues that the putative proofs of this property that involve hidden variables include in their premises some essentially classical-physics-type assumptions that are not entailed by the precepts of quantum mechanics. Thus whatever is proved is not a feature of quantum mechanics, but is a property of a theory that tries to combine quantum theory with quasi-classical features that go beyond what is entailed by quantum theory itself. One cannot logically prove properties of a system by establishing, instead, properties of a system modified by adding properties alien to the original system. Hence Griffiths' rejection of hidden-variable-based proofs is logically warranted. Griffiths mentions the existence of a certain alternative proof that does not involve hidden variables, and that uses only macroscopically described observable properties. He notes that he had examined in his book proofs of this general kind, and concluded that they provide no evidence for nonlocal influences. But he did not examine the particular proof that he cites. An examination of that particular proof by the method specified by his `consistent quantum theory' shows that the cited proof is valid within that restrictive version of quantum theory. An added section responds to Griffiths' reply, which cites general possibilities of ambiguities that might make what is to be proved ill-defined, and hence render the pertinent `consistent framework' ill defined. But the vagaries that he cites do not upset the proof in question, which, both by its physical formulation and by explicit identification, specify the framework to be used. Griffiths confirms the validity of the proof insofar as that pertinent framework is used. The section also shows
Quantum technology: the second quantum revolution.
Dowling, Jonathan P; Milburn, Gerard J
2003-08-15
We are currently in the midst of a second quantum revolution. The first quantum revolution gave us new rules that govern physical reality. The second quantum revolution will take these rules and use them to develop new technologies. In this review we discuss the principles upon which quantum technology is based and the tools required to develop it. We discuss a number of examples of research programs that could deliver quantum technologies in coming decades including: quantum information technology, quantum electromechanical systems, coherent quantum electronics, quantum optics and coherent matter technology.
Quantum correlations and distinguishability of quantum states
NASA Astrophysics Data System (ADS)
Spehner, Dominique
2014-07-01
A survey of various concepts in quantum information is given, with a main emphasis on the distinguishability of quantum states and quantum correlations. Covered topics include generalized and least square measurements, state discrimination, quantum relative entropies, the Bures distance on the set of quantum states, the quantum Fisher information, the quantum Chernoff bound, bipartite entanglement, the quantum discord, and geometrical measures of quantum correlations. The article is intended both for physicists interested not only by collections of results but also by the mathematical methods justifying them, and for mathematicians looking for an up-to-date introductory course on these subjects, which are mainly developed in the physics literature.
NASA Astrophysics Data System (ADS)
Commins, Eugene D.
2014-10-01
Preface; 1. Introduction; 2. Mathematical preliminaries; 3. The rules of quantum mechanics; 4. The connection between the fundamental rules and wave mechanics; 5. Further illustrations of the rules of quantum mechanics; 6. Further developments in one-dimensional wave mechanics; 7. The theory of angular momentum; 8. Wave mechanics in three dimensions: hydrogenic atoms; 9. Time-independent approximations for bound state problems; 10. Applications of static perturbation theory; 11. Identical particles; 12. Atomic structure; 13. Molecules; 14. The stability of matter; 15. Photons; 16. Interaction of non-relativistic charged particles and radiation; 17. Further topics in perturbation theory; 18. Scattering; 19. Special relativity and quantum mechanics: the Klein-Gordon equation; 20. The Dirac equation; 21. Interaction of a relativistic spin 1/2 particle with an external electromagnetic field; 22. The Dirac field; 23. Interaction between relativistic electrons, positrons, and photons; 24. The quantum mechanics of weak interactions; 25. The quantum measurement problem; Appendix A: useful inequalities for quantum mechanics; Appendix B: Bell's inequality; Appendix C: spin of the photon: vector spherical waves; Works cited; Bibliography; Index.
NASA Astrophysics Data System (ADS)
Slysz, W.; Wegrzecki, M.; Bar, J.; Grabiec, P.; Górska, M.; Latta, C.; Zwiller, V.; Pearlman, A.; Cross, A.; Korneev, A.; Kouminov, P.; Smirnov, K.; Voronov, B.; Gol'tsman, G.; Verevkin, A.; Currie, M.; Sobolewski, R.
2005-09-01
We present the design and performance of a novel, two-channel single-photon receiver, based on two fiber-coupled NbN superconducting single-photon detectors (SSPDs). The SSPDs are nanostructured superconducting meanders covering an area of 100 μm2 and are known for ultrafast and efficient counting of single, visible-to-infrared photons. Their operation has been explained within a phenomenological hot-electron photoresponse model. Our receiver is intended for fiber-based quantum cryptography and communication systems, operational at near-infrared (NIR) telecommunication wavelengths, λ = 1.3 μm and λ = 1.55 μm. Coupling between the NbN detector and a single-mode optical fiber was achieved using a specially designed, micromechanical photoresist ring, positioned directly over the SSPD active area. The positioning accuracy of the ring was below 1 μm. The receiver with SSPDs was placed (immersed) in a standard liquid-helium transport Dewar and kept without interruption for over two months at 4.2 K. At the same time, the optical fiber inputs and electrical outputs were kept at room temperature. Our best system reached a system quantum efficiency of up to 0.3 % in the NIR radiation range, with the detector coupling efficiency of about 30 %. The response time was measured to be about 250 ps and was limited by our read-out electronics. The measured jitter was close to 35 ps. The presented performance parameters show that our NIR single photon detectors are suitable for practical quantum cryptography and for applications in quantum-correlation experiments.
Quantum Particles From Quantum Information
NASA Astrophysics Data System (ADS)
Görnitz, T.; Schomäcker, U.
2012-08-01
Many problems in modern physics demonstrate that for a fundamental entity a more general conception than quantum particles or quantum fields are necessary. These concepts cannot explain the phenomena of dark energy or the mind-body-interaction. Instead of any kind of "small elementary building bricks", the Protyposis, an abstract and absolute quantum information, free of special denotation and open for some purport, gives the solution in the search for a fundamental substance. However, as long as at least relativistic particles are not constructed from the Protyposis, such an idea would remain in the range of natural philosophy. Therefore, the construction of relativistic particles without and with rest mass from quantum information is shown.
Quantum Computing for Quantum Chemistry
2010-09-01
random walks as the decoherence became strong. Recent experiments on photosynthetic light -harvesting complexes observed long-lived excitonic coherences...by the light -harvesting complex. In Environment-assisted quantum walks in energy transfer of photosynthetic complexes, J. Chem. Phys. 129 (2008...a decohered quantum walk. Motivated by the experiments on the Fenna-Matthews-Olson (FMO) light -harvesting complex of green sulfur bacteria, we
NASA Astrophysics Data System (ADS)
Oppenheim, Jonathan; Horodecki, Michał
2005-10-01
Quantum information is a valuable resource which can be encrypted in order to protect it. We consider the size of the one-time pad that is needed to protect quantum information in a number of cases. The situation is dramatically different from the classical case: we prove that one can recycle the one-time pad without compromising security. The protocol for recycling relies on detecting whether eavesdropping has occurred, and further relies on the fact that information contained in the encrypted quantum state cannot be fully accessed. We prove the security of recycling rates when authentication of quantum states is accepted, and when it is rejected. We note that recycling schemes respect a general law of cryptography which we introduce relating the size of private keys, sent qubits, and encrypted messages. We discuss applications for encryption of quantum information in light of the resources needed for teleportation. Potential uses include the protection of resources such as entanglement and the memory of quantum computers. We also introduce another application: encrypted secret sharing and find that one can even reuse the private key that is used to encrypt a classical message. In a number of cases, one finds that the amount of private key needed for authentication or protection is smaller than in the general case.
Oppenheim, Jonathan; Horodecki, Michal
2005-10-15
Quantum information is a valuable resource which can be encrypted in order to protect it. We consider the size of the one-time pad that is needed to protect quantum information in a number of cases. The situation is dramatically different from the classical case: we prove that one can recycle the one-time pad without compromising security. The protocol for recycling relies on detecting whether eavesdropping has occurred, and further relies on the fact that information contained in the encrypted quantum state cannot be fully accessed. We prove the security of recycling rates when authentication of quantum states is accepted, and when it is rejected. We note that recycling schemes respect a general law of cryptography which we introduce relating the size of private keys, sent qubits, and encrypted messages. We discuss applications for encryption of quantum information in light of the resources needed for teleportation. Potential uses include the protection of resources such as entanglement and the memory of quantum computers. We also introduce another application: encrypted secret sharing and find that one can even reuse the private key that is used to encrypt a classical message. In a number of cases, one finds that the amount of private key needed for authentication or protection is smaller than in the general case.
Introduction to Quantum Simulation
NASA Technical Reports Server (NTRS)
Williams, Colin P.
2005-01-01
This viewgraph presentation addresses the problem of efficiently simulating the evolution of a quantum system. The contents include: 1) Quantum Simulation; 2) Extracting Answers from Quantum Simulations; 3) Quantum Fourier Transform; 4) Eigenvalue Estimation; 5) Fermionic Simulations.
Quantum Transmemetic Intelligence
NASA Astrophysics Data System (ADS)
Piotrowski, Edward W.; Sładkowski, Jan
The following sections are included: * Introduction * A Quantum Model of Free Will * Quantum Acquisition of Knowledge * Thinking as a Quantum Algorithm * Counterfactual Measurement as a Model of Intuition * Quantum Modification of Freud's Model of Consciousness * Conclusion * Acknowledgements * References
Quantum Physics for Beginners.
ERIC Educational Resources Information Center
Strand, J.
1981-01-01
Suggests a new approach for teaching secondary school quantum physics. Reviews traditional approaches and presents some characteristics of the three-part "Quantum Physics for Beginners" project, including: quantum physics, quantum mechanics, and a short historical survey. (SK)
Loss-tolerant measurement-device-independent quantum private queries
NASA Astrophysics Data System (ADS)
Zhao, Liang-Yuan; Yin, Zhen-Qiang; Chen, Wei; Qian, Yong-Jun; Zhang, Chun-Mei; Guo, Guang-Can; Han, Zheng-Fu
2017-01-01
Quantum private queries (QPQ) is an important cryptography protocol aiming to protect both the user’s and database’s privacy when the database is queried privately. Recently, a variety of practical QPQ protocols based on quantum key distribution (QKD) have been proposed. However, for QKD-based QPQ the user’s imperfect detectors can be subjected to some detector- side-channel attacks launched by the dishonest owner of the database. Here, we present a simple example that shows how the detector-blinding attack can damage the security of QKD-based QPQ completely. To remove all the known and unknown detector side channels, we propose a solution of measurement-device-independent QPQ (MDI-QPQ) with single- photon sources. The security of the proposed protocol has been analyzed under some typical attacks. Moreover, we prove that its security is completely loss independent. The results show that practical QPQ will remain the same degree of privacy as before even with seriously uncharacterized detectors.
Loss-tolerant measurement-device-independent quantum private queries
Zhao, Liang-Yuan; Yin, Zhen-Qiang; Chen, Wei; Qian, Yong-Jun; Zhang, Chun-Mei; Guo, Guang-Can; Han, Zheng-Fu
2017-01-01
Quantum private queries (QPQ) is an important cryptography protocol aiming to protect both the user’s and database’s privacy when the database is queried privately. Recently, a variety of practical QPQ protocols based on quantum key distribution (QKD) have been proposed. However, for QKD-based QPQ the user’s imperfect detectors can be subjected to some detector- side-channel attacks launched by the dishonest owner of the database. Here, we present a simple example that shows how the detector-blinding attack can damage the security of QKD-based QPQ completely. To remove all the known and unknown detector side channels, we propose a solution of measurement-device-independent QPQ (MDI-QPQ) with single- photon sources. The security of the proposed protocol has been analyzed under some typical attacks. Moreover, we prove that its security is completely loss independent. The results show that practical QPQ will remain the same degree of privacy as before even with seriously uncharacterized detectors. PMID:28051101
NASA Astrophysics Data System (ADS)
Tsubota, Makoto; Kobayashi, Michikazu; Takeuchi, Hiromitsu
2013-01-01
Quantum hydrodynamics in superfluid helium and atomic Bose-Einstein condensates (BECs) has been recently one of the most important topics in low temperature physics. In these systems, a macroscopic wave function (order parameter) appears because of Bose-Einstein condensation, which creates quantized vortices. Turbulence consisting of quantized vortices is called quantum turbulence (QT). The study of quantized vortices and QT has increased in intensity for two reasons. The first is that recent studies of QT are considerably advanced over older studies, which were chiefly limited to thermal counterflow in 4He, which has no analog with classical traditional turbulence, whereas new studies on QT are focused on a comparison between QT and classical turbulence. The second reason is the realization of atomic BECs in 1995, for which modern optical techniques enable the direct control and visualization of the condensate and can even change the interaction; such direct control is impossible in other quantum condensates like superfluid helium and superconductors. Our group has made many important theoretical and numerical contributions to the field of quantum hydrodynamics of both superfluid helium and atomic BECs. In this article, we review some of the important topics in detail. The topics of quantum hydrodynamics are diverse, so we have not attempted to cover all these topics in this article. We also ensure that the scope of this article does not overlap with our recent review article (arXiv:1004.5458), “Quantized vortices in superfluid helium and atomic Bose-Einstein condensates”, and other review articles.
Kendon, Viv
2014-12-04
Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. Recent results showing quantum walks are “universal for quantum computation” relate to algorithms, to be run on quantum computers. We consider whether an experimental implementation of a quantum walk could provide useful computation before we have a universal quantum computer.
Wang, Junru; Wang, Cong; Cao, Jiajia; Liu, Xiaoqing; Yao, Yuhua; Dai, Qi
2015-01-10
Many efficient methods have been proposed to advance protein structural class prediction, but there are still some challenges where additional insight or technology is needed for low-similarity sequences. In this work, we schemed out a new prediction method for low-similarity datasets using reduced PSSM and position-based secondary structural features. We evaluated the proposed method with four experiments and compared it with the available competing prediction methods. The results indicate that the proposed method achieved the best performance among the evaluated methods, with overall accuracy 3-5% higher than the existing best-performing method. This paper also found that the reduced alphabets with size 13 simplify PSSM structures efficiently while reserving its maximal information. This understanding can be used to design more powerful prediction methods for protein structural class.
Javed, Mohammed; Solanki, Manish; Sinha, Anshika; Shukla, Lata Israni
2017-02-15
The conserved miR168 family is evaluated for position based nucleotide preference in higher plants. The mature miRNA sequences include miR168-5p and miR168-3p, were obtained from miRBase (v21, June 2014) for 15 families (28 plants) containing a-c subfamilies. The preferred position based nucleotide sequences were obtained for miR168-5p and miR168-3p using Data Analysis in Molecular Biology and Evolution (DAMBE). miR168-5p shows same nucleotides at positions 1-6, 8-9, 11-12, 15-17 and 19. Also, miR168-3p is present in 3 families (10 plants) shows the same nucleotide at position 1-11, 13-15 and 17-21. Our work suggests that miR168 family has conserved sequence in higher plants. The miR168-5p was subjected to cross kingdom analysis using psRNATarget. The seed region position 2-8 shows 70-95% pairing and cleavage site at position 10-14 were analysed for the base preference, in which pairing with the targets showed 80-96% Watson Crick pairing. The 123 targets in human transcriptome were identified showing 58% cleavage and 41% translation repression. Earlier reported Low density lipoprotein receptor adaptor protein 1(LDLRAP1) target validated for miR168a obtained from rice origin, could also be targeted from miR168 from any other plant sources. The randomly selected 10 targets include some important genes like RPL34, ATXN1, AKAPI3 and ALS2 and is involved in transcription, cell trafficking, cell metabolism and neurodegenerative disorder. This paper provides DAMBE analysis for miR168 across the plant kingdom and identification of new cross kingdom targets for miR168 using psRNATarget.
NASA Astrophysics Data System (ADS)
Skrbek, L.
2011-12-01
We review physical properties of quantum fluids He II and 3He-B, where quantum turbulence (QT) has been studied experimentally. Basic properties of QT in these working fluids are discussed within the phenomenological two-fluid model introduced by Landau. We consider counterflows in which the normal and superfluid components flow against each other, as well as co-flows in which the direction of the two fluids is the same. We pay special attention to the important case of zero temperature limit, where QT represents an interesting and probably the simplest prototype of three-dimensional turbulence in fluids. Experimental techniques to explore QT such as second sound attenuation, Andreev reflection, NMR, ion propagation are briefly introduced and results of various experiments on so-called Vinen QT and Kolmogorov QT both in He II and 3He are discussed, emphasizing similarities and differences between classical and quantum turbulence.
NASA Astrophysics Data System (ADS)
Sassoli de Bianchi, Massimiliano
2013-09-01
In a letter to Born, Einstein wrote [42]: "Quantum mechanics is certainly imposing. But an inner voice tells me that it is not yet the real thing. The theory says a lot, but does not really bring us any closer to the secret of the 'old one.' I, at any rate, am convinced that He does not throw dice." In this paper we take seriously Einstein's famous metaphor, and show that we can gain considerable insight into quantum mechanics by doing something as simple as rolling dice. More precisely, we show how to perform measurements on a single die, to create typical quantum interference effects, and how to connect (entangle) two identical dice, to maximally violate Bell's inequality.
NASA Astrophysics Data System (ADS)
Feng, Chao-Jun; Li, Xin-Zhou
In this paper, we will give a short review on quantum spring, which is a Casimir effect from the helix boundary condition that proposed in our earlier works. The Casimir force parallel to the axis of the helix behaves very much like the force on a spring that obeys the Hooke's law when the ratio r of the pitch to the circumference of the helix is small, but in this case, the force comes from a quantum effect, so we would like to call it quantum spring. On the other hand, the force perpendicular to the axis decreases monotonously with the increasing of the ratio r. Both forces are attractive and their behaviors are the same in two and three dimensions.
NASA Astrophysics Data System (ADS)
Baaquie, Belal E.
2007-09-01
Foreword; Preface; Acknowledgements; 1. Synopsis; Part I. Fundamental Concepts of Finance: 2. Introduction to finance; 3. Derivative securities; Part II. Systems with Finite Number of Degrees of Freedom: 4. Hamiltonians and stock options; 5. Path integrals and stock options; 6. Stochastic interest rates' Hamiltonians and path integrals; Part III. Quantum Field Theory of Interest Rates Models: 7. Quantum field theory of forward interest rates; 8. Empirical forward interest rates and field theory models; 9. Field theory of Treasury Bonds' derivatives and hedging; 10. Field theory Hamiltonian of forward interest rates; 11. Conclusions; Appendix A: mathematical background; Brief glossary of financial terms; Brief glossary of physics terms; List of main symbols; References; Index.
Lincoln, Don
2014-10-24
The laws of quantum mechanics and relativity are quite perplexing however it is when the two theories are merged that things get really confusing. This combined theory predicts that empty space isn’t empty at all – it’s a seething and bubbling cauldron of matter and antimatter particles springing into existence before disappearing back into nothingness. Scientists call this complicated state of affairs “quantum foam.” In this video, Fermilab’s Dr. Don Lincoln discusses this mind-bending idea and sketches some of the experiments that have convinced scientists that this crazy prediction is actually true.
NASA Astrophysics Data System (ADS)
Sych, Denis; Leuchs, Gerd
2015-12-01
Classical physics allows for the existence of pairs of absolutely identical systems. Pairwise application of identical measurements to each of those systems always leads to exactly alike results irrespectively of the choice of measurements. Here we ask a question how the picture looks like in the quantum domain. Surprisingly, we get a counterintuitive outcome. Pairwise application of identical (but a priori unknown) measurements cannot always lead to exactly alike results. We interpret this as quantum uniqueness—a feature that has no classical analog.
Blind Quantum Signature with Blind Quantum Computation
NASA Astrophysics Data System (ADS)
Li, Wei; Shi, Ronghua; Guo, Ying
2017-04-01
Blind quantum computation allows a client without quantum abilities to interact with a quantum server to perform a unconditional secure computing protocol, while protecting client's privacy. Motivated by confidentiality of blind quantum computation, a blind quantum signature scheme is designed with laconic structure. Different from the traditional signature schemes, the signing and verifying operations are performed through measurement-based quantum computation. Inputs of blind quantum computation are securely controlled with multi-qubit entangled states. The unique signature of the transmitted message is generated by the signer without leaking information in imperfect channels. Whereas, the receiver can verify the validity of the signature using the quantum matching algorithm. The security is guaranteed by entanglement of quantum system for blind quantum computation. It provides a potential practical application for e-commerce in the cloud computing and first-generation quantum computation.
Blind Quantum Signature with Blind Quantum Computation
NASA Astrophysics Data System (ADS)
Li, Wei; Shi, Ronghua; Guo, Ying
2016-12-01
Blind quantum computation allows a client without quantum abilities to interact with a quantum server to perform a unconditional secure computing protocol, while protecting client's privacy. Motivated by confidentiality of blind quantum computation, a blind quantum signature scheme is designed with laconic structure. Different from the traditional signature schemes, the signing and verifying operations are performed through measurement-based quantum computation. Inputs of blind quantum computation are securely controlled with multi-qubit entangled states. The unique signature of the transmitted message is generated by the signer without leaking information in imperfect channels. Whereas, the receiver can verify the validity of the signature using the quantum matching algorithm. The security is guaranteed by entanglement of quantum system for blind quantum computation. It provides a potential practical application for e-commerce in the cloud computing and first-generation quantum computation.
Electron quantum optics as quantum signal processing
NASA Astrophysics Data System (ADS)
Roussel, B.; Cabart, C.; Fève, G.; Thibierge, E.; Degiovanni, P.
2017-03-01
The recent developments of electron quantum optics in quantum Hall edge channels have given us new ways to probe the behavior of electrons in quantum conductors. It has brought new quantities called electronic coherences under the spotlight. In this paper, we explore the relations between electron quantum optics and signal processing through a global review of the various methods for accessing single- and two-electron coherences in electron quantum optics. We interpret electron quantum optics interference experiments as analog signal processing converting quantum signals into experimentally observable quantities such as current averages and correlations. This point of view also gives us a procedure to obtain quantum information quantities from electron quantum optics coherences. We illustrate these ideas by discussing two mode entanglement in electron quantum optics. We also sketch how signal processing ideas may open new perspectives for representing electronic coherences in quantum conductors and understand the properties of the underlying many-body electronic state.
Quantum memory for images: A quantum hologram
Vasilyev, Denis V.; Sokolov, Ivan V.; Polzik, Eugene S.
2008-02-15
Matter-light quantum interface and quantum memory for light are important ingredients of quantum information protocols, such as quantum networks, distributed quantum computation, etc. [P. Zoller et al., Eur. Phys. J. D 36, 203 (2005)]. In this paper we present a spatially multimode scheme for quantum memory for light, which we call a quantum hologram. Our approach uses a multiatom ensemble which has been shown to be efficient for a single spatial mode quantum memory. Due to the multiatom nature of the ensemble and to the optical parallelism it is capable of storing many spatial modes, a feature critical for the present proposal. A quantum hologram with the fidelity exceeding that of classical hologram will be able to store quantum features of an image, such as multimode superposition and entangled quantum states, something that a standard hologram is unable to achieve.
Attacks exploiting deviation of mean photon number in quantum key distribution and coin tossing
NASA Astrophysics Data System (ADS)
Sajeed, Shihan; Radchenko, Igor; Kaiser, Sarah; Bourgoin, Jean-Philippe; Pappa, Anna; Monat, Laurent; Legré, Matthieu; Makarov, Vadim
2015-03-01
The security of quantum communication using a weak coherent source requires an accurate knowledge of the source's mean photon number. Finite calibration precision or an active manipulation by an attacker may cause the actual emitted photon number to deviate from the known value. We model effects of this deviation on the security of three quantum communication protocols: the Bennett-Brassard 1984 (BB84) quantum key distribution (QKD) protocol without decoy states, Scarani-Acín-Ribordy-Gisin 2004 (SARG04) QKD protocol, and a coin-tossing protocol. For QKD we model both a strong attack using technology possible in principle and a realistic attack bounded by today's technology. To maintain the mean photon number in two-way systems, such as plug-and-play and relativistic quantum cryptography schemes, bright pulse energy incoming from the communication channel must be monitored. Implementation of a monitoring detector has largely been ignored so far, except for ID Quantique's commercial QKD system Clavis2. We scrutinize this implementation for security problems and show that designing a hack-proof pulse-energy-measuring detector is far from trivial. Indeed, the first implementation has three serious flaws confirmed experimentally, each of which may be exploited in a cleverly constructed Trojan-horse attack. We discuss requirements for a loophole-free implementation of the monitoring detector.
Quantum learning without quantum memory.
Sentís, G; Calsamiglia, J; Muñoz-Tapia, R; Bagan, E
2012-01-01
A quantum learning machine for binary classification of qubit states that does not require quantum memory is introduced and shown to perform with the minimum error rate allowed by quantum mechanics for any size of the training set. This result is shown to be robust under (an arbitrary amount of) noise and under (statistical) variations in the composition of the training set, provided it is large enough. This machine can be used an arbitrary number of times without retraining. Its required classical memory grows only logarithmically with the number of training qubits, while its excess risk decreases as the inverse of this number, and twice as fast as the excess risk of an "estimate-and-discriminate" machine, which estimates the states of the training qubits and classifies the data qubit with a discrimination protocol tailored to the obtained estimates.
Quantum learning without quantum memory
NASA Astrophysics Data System (ADS)
Sentís, G.; Calsamiglia, J.; Muñoz-Tapia, R.; Bagan, E.
2012-10-01
A quantum learning machine for binary classification of qubit states that does not require quantum memory is introduced and shown to perform with the minimum error rate allowed by quantum mechanics for any size of the training set. This result is shown to be robust under (an arbitrary amount of) noise and under (statistical) variations in the composition of the training set, provided it is large enough. This machine can be used an arbitrary number of times without retraining. Its required classical memory grows only logarithmically with the number of training qubits, while its excess risk decreases as the inverse of this number, and twice as fast as the excess risk of an ``estimate-and-discriminate'' machine, which estimates the states of the training qubits and classifies the data qubit with a discrimination protocol tailored to the obtained estimates.
Quantum Speedup by Quantum Annealing
NASA Astrophysics Data System (ADS)
Somma, Rolando D.; Nagaj, Daniel; Kieferová, Mária
2012-08-01
We study the glued-trees problem from A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. Spielman, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (ACM, San Diego, CA, 2003), p. 59. in the adiabatic model of quantum computing and provide an annealing schedule to solve an oracular problem exponentially faster than classically possible. The Hamiltonians involved in the quantum annealing do not suffer from the so-called sign problem. Unlike the typical scenario, our schedule is efficient even though the minimum energy gap of the Hamiltonians is exponentially small in the problem size. We discuss generalizations based on initial-state randomization to avoid some slowdowns in adiabatic quantum computing due to small gaps.
NASA Astrophysics Data System (ADS)
Lanzagorta, Marco O.; Gomez, Richard B.; Uhlmann, Jeffrey K.
2003-08-01
In recent years, computer graphics has emerged as a critical component of the scientific and engineering process, and it is recognized as an important computer science research area. Computer graphics are extensively used for a variety of aerospace and defense training systems and by Hollywood's special effects companies. All these applications require the computer graphics systems to produce high quality renderings of extremely large data sets in short periods of time. Much research has been done in "classical computing" toward the development of efficient methods and techniques to reduce the rendering time required for large datasets. Quantum Computing's unique algorithmic features offer the possibility of speeding up some of the known rendering algorithms currently used in computer graphics. In this paper we discuss possible implementations of quantum rendering algorithms. In particular, we concentrate on the implementation of Grover's quantum search algorithm for Z-buffering, ray-tracing, radiosity, and scene management techniques. We also compare the theoretical performance between the classical and quantum versions of the algorithms.
NASA Astrophysics Data System (ADS)
Tsubota, Makoto
2008-11-01
The present article reviews the recent developments in the physics of quantum turbulence. Quantum turbulence (QT) was discovered in superfluid 4He in the 1950s, and the research has tended toward a new direction since the mid 90s. The similarities and differences between quantum and classical turbulence have become an important area of research. QT is comprised of quantized vortices that are definite topological defects, being expected to yield a model of turbulence that is much simpler than the classical model. The general introduction of the issue and a brief review on classical turbulence are followed by a description of the dynamics of quantized vortices. Then, we discuss the energy spectrum of QT at very low temperatures. At low wavenumbers, the energy is transferred through the Richardson cascade of quantized vortices, and the spectrum obeys the Kolmogorov law, which is the most important statistical law in turbulence; this classical region shows the similarity to conventional turbulence. At higher wavenumbers, the energy is transferred by the Kelvin-wave cascade on each vortex. This quantum regime depends strongly on the nature of each quantized vortex. The possible dissipation mechanism is discussed. Finally, important new experimental studies, which include investigations into temperature-dependent transition to QT, dissipation at very low temperatures, QT created by vibrating structures, and visualization of QT, are reviewed. The present article concludes with a brief look at QT in atomic Bose-Einstein condensates.
Sassoli de Bianchi, Massimiliano
2013-09-15
In a letter to Born, Einstein wrote [42]: “Quantum mechanics is certainly imposing. But an inner voice tells me that it is not yet the real thing. The theory says a lot, but does not really bring us any closer to the secret of the ‘old one.’ I, at any rate, am convinced that He does not throw dice.” In this paper we take seriously Einstein’s famous metaphor, and show that we can gain considerable insight into quantum mechanics by doing something as simple as rolling dice. More precisely, we show how to perform measurements on a single die, to create typical quantum interference effects, and how to connect (entangle) two identical dice, to maximally violate Bell’s inequality. -- Highlights: •Rolling a die is a quantum process admitting a Hilbert space representation. •Rolling experiments with a single die can produce interference effects. •Two connected dice can violate Bell’s inequality. •Correlations need to be created by the measurement, to violate Bell’s inequality.
NASA Technical Reports Server (NTRS)
Dowling, Jonathan P.
2000-01-01
Recently, several researchers, including yours truly, have been able to demonstrate theoretically that quantum photon entanglement has the potential to also revolutionize the entire field of optical interferometry, by providing many orders of magnitude improvement in interferometer sensitivity. The quantum entangled photon interferometer approach is very general and applies to many types of interferometers. In particular, without nonlocal entanglement, a generic classical interferometer has a statistical-sampling shot-noise limited sensitivity that scales like 1/Sqrt[N], where N is the number of particles (photons, electrons, atoms, neutrons) passing through the interferometer per unit time. However, if carefully prepared quantum correlations are engineered between the particles, then the interferometer sensitivity improves by a factor of Sqrt[N] (square root of N) to scale like 1/N, which is the limit imposed by the Heisenberg Uncertainty Principle. For optical (laser) interferometers operating at milliwatts of optical power, this quantum sensitivity boost corresponds to an eight-order-of-magnitude improvement of signal to noise. Applications are to tests of General Relativity such as ground and orbiting optical interferometers for gravity wave detection, Laser Interferometer Gravity Observatory (LIGO) and the European Laser Interferometer Space Antenna (LISA), respectively.
Visser, M. )
1991-01-15
This paper presents an application of quantum-mechanical principles to a microscopic variant of the traversable wormholes recently introduced by Morris and Thorne. The analysis, based on the surgical grafting of two Reissner-Nordstroem spacetimes, proceeds by using a minisuperspace model to approximate the geometry of these wormholes. The thin shell'' formalism is applied to this minisuperspace model to extract the effective Lagrangian appropriate to this one-degree-of-freedom system. This effective Lagrangian is then quantized and the wave function for the wormhole is explicitly exhibited. A slightly more general class of wormholes---corresponding to the addition of some dust'' to the wormhole throat---is analyzed by recourse to WKB techniques. In all cases discussed in this paper, the expectation value of the wormhole radius is calculated to be of the order of the Planck length. Accordingly, though these quantum wormholes are of considerable theoretical interest they do not appear to be useful as a means for interstellar travel. The results of this paper may also have a bearing on the question of topological fluctuations in quantum gravity. These calculations serve to suggest that topology-changing effects might in fact be {ital suppressed} by quantum-gravity effects.
NASA Astrophysics Data System (ADS)
Maślanka, K.
A model of reality based on quantum fields, but with a classical treatment of gravity, is inconsistent. Finding a solution has proved extremely difficult, possibly due to the beauty and conceptual simplicity of general relativity. There is a variety of approaches to a consistent theory of quntum gravity. At present, it seems that superstring theory is the most promising candidate.
New Approaches to Quantum Computing using Nuclear Magnetic Resonance Spectroscopy
Colvin, M; Krishnan, V V
2003-02-07
The power of a quantum computer (QC) relies on the fundamental concept of the superposition in quantum mechanics and thus allowing an inherent large-scale parallelization of computation. In a QC, binary information embodied in a quantum system, such as spin degrees of freedom of a spin-1/2 particle forms the qubits (quantum mechanical bits), over which appropriate logical gates perform the computation. In classical computers, the basic unit of information is the bit, which can take a value of either 0 or 1. Bits are connected together by logic gates to form logic circuits to implement complex logical operations. The expansion of modern computers has been driven by the developments of faster, smaller and cheaper logic gates. As the size of the logic gates become smaller toward the level of atomic dimensions, the performance of such a system is no longer considered classical but is rather governed by quantum mechanics. Quantum computers offer the potentially superior prospect of solving computational problems that are intractable to classical computers such as efficient database searches and cryptography. A variety of algorithms have been developed recently, most notably Shor's algorithm for factorizing long numbers into prime factors in polynomial time and Grover's quantum search algorithm. The algorithms that were of only theoretical interest as recently, until several methods were proposed to build an experimental QC. These methods include, trapped ions, cavity-QED, coupled quantum dots, Josephson junctions, spin resonance transistors, linear optics and nuclear magnetic resonance. Nuclear magnetic resonance (NMR) is uniquely capable of constructing small QCs and several algorithms have been implemented successfully. NMR-QC differs from other implementations in one important way that it is not a single QC, but a statistical ensemble of them. Thus, quantum computing based on NMR is considered as ensemble quantum computing. In NMR quantum computing, the spins with
2008-07-02
solution of certain problems for which the communication needs do not dominate. A similar situation prevails in the quantum world. Quantum teleportation and...REPORT Quantum Search and Beyond 14. ABSTRACT 16. SECURITY CLASSIFICATION OF: Ten years ago, the quantum search algorithm was designed to provide a way...P.O. Box 12211 Research Triangle Park, NC 27709-2211 15. SUBJECT TERMS quantum searching - partial quantum searching, fixed-point quantum
Efficient quantum walk on a quantum processor
NASA Astrophysics Data System (ADS)
Qiang, Xiaogang; Loke, Thomas; Montanaro, Ashley; Aungskunsiri, Kanin; Zhou, Xiaoqi; O'Brien, Jeremy L.; Wang, Jingbo B.; Matthews, Jonathan C. F.
2016-05-01
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle, we experimentally implement the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor.
Efficient quantum walk on a quantum processor
Qiang, Xiaogang; Loke, Thomas; Montanaro, Ashley; Aungskunsiri, Kanin; Zhou, Xiaoqi; O'Brien, Jeremy L.; Wang, Jingbo B.; Matthews, Jonathan C. F.
2016-01-01
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle, we experimentally implement the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor. PMID:27146471
Quantum Secure Dialogue with Quantum Encryption
NASA Astrophysics Data System (ADS)
Ye, Tian-Yu
2014-09-01
How to solve the information leakage problem has become the research focus of quantum dialogue. In this paper, in order to overcome the information leakage problem in quantum dialogue, a novel approach for sharing the initial quantum state privately between communicators, i.e., quantum encryption sharing, is proposed by utilizing the idea of quantum encryption. The proposed protocol uses EPR pairs as the private quantum key to encrypt and decrypt the traveling photons, which can be repeatedly used after rotation. Due to quantum encryption sharing, the public announcement on the state of the initial quantum state is omitted, thus the information leakage problem is overcome. The information-theoretical efficiency of the proposed protocol is nearly 100%, much higher than previous information leakage resistant quantum dialogue protocols. Moreover, the proposed protocol only needs single-photon measurements and nearly uses single photons as quantum resource so that it is convenient to implement in practice.
Efficient quantum walk on a quantum processor.
Qiang, Xiaogang; Loke, Thomas; Montanaro, Ashley; Aungskunsiri, Kanin; Zhou, Xiaoqi; O'Brien, Jeremy L; Wang, Jingbo B; Matthews, Jonathan C F
2016-05-05
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle, we experimentally implement the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor.
Hybrid cryptography key management.
Draelos, Timothy John; Torgerson, Mark Dolan; Neumann, William Douglas; Gallup, Donald R.; Collins, Michael Joseph; Beaver, Cheryl Lynn
2003-11-01
Wireless communication networks are highly resource-constrained; thus many security protocols which work in other settings may not be efficient enough for use in wireless environments. This report considers a variety of cryptographic techniques which enable secure, authenticated communication when resources such as processor speed, battery power, memory, and bandwidth are tightly limited.
Small circuits for cryptography.
Torgerson, Mark Dolan; Draelos, Timothy John; Schroeppel, Richard Crabtree; Miller, Russell D.; Anderson, William Erik
2005-10-01
This report examines a number of hardware circuit design issues associated with implementing certain functions in FPGA and ASIC technologies. Here we show circuit designs for AES and SHA-1 that have an extremely small hardware footprint, yet show reasonably good performance characteristics as compared to the state of the art designs found in the literature. Our AES performance numbers are fueled by an optimized composite field S-box design for the Stratix chipset. Our SHA-1 designs use register packing and feedback functionalities of the Stratix LE, which reduce the logic element usage by as much as 72% as compared to other SHA-1 designs.
Quantum decision tree classifier
NASA Astrophysics Data System (ADS)
Lu, Songfeng; Braunstein, Samuel L.
2013-11-01
We study the quantum version of a decision tree classifier to fill the gap between quantum computation and machine learning. The quantum entropy impurity criterion which is used to determine which node should be split is presented in the paper. By using the quantum fidelity measure between two quantum states, we cluster the training data into subclasses so that the quantum decision tree can manipulate quantum states. We also propose algorithms constructing the quantum decision tree and searching for a target class over the tree for a new quantum object.
Adiabatically implementing quantum gates
Sun, Jie; Lu, Songfeng Liu, Fang
2014-06-14
We show that, through the approach of quantum adiabatic evolution, all of the usual quantum gates can be implemented efficiently, yielding running time of order O(1). This may be considered as a useful alternative to the standard quantum computing approach, which involves quantum gates transforming quantum states during the computing process.
Quantum gate decomposition algorithms.
Slepoy, Alexander
2006-07-01
Quantum computing algorithms can be conveniently expressed in a format of a quantum logical circuits. Such circuits consist of sequential coupled operations, termed ''quantum gates'', or quantum analogs of bits called qubits. We review a recently proposed method [1] for constructing general ''quantum gates'' operating on an qubits, as composed of a sequence of generic elementary ''gates''.
NASA Astrophysics Data System (ADS)
Boixo, Sergio; Somma, Rolando; Barnum, Howard
2008-03-01
We develop a quantum algorithm to solve combinatorial optimization problems through quantum simulation of a classical annealing process. Our algorithm combines techniques from quantum walks and quantum phase estimation, and can be viewed as the quantum analogue of the discrete-time Markov Chain Monte Carlo implementation of classical simulated annealing.
NASA Astrophysics Data System (ADS)
Lo, C. F.; Kiang, D.
2003-12-01
Based upon a modification of Li et al.'s "minimal" quantization rules (Phys. Lett. A306(2002) 73), we investigate the quantum version of the Cournot and Bertrand oligopoly. In the Cournot oligopoly, the profit of each of the N firms at the Nash equilibrium point rises monotonically with the measure of the quantum entanglement. Only at maximal entanglement, however, does the Nash equilibrium point coincide with the Pareto optimal point. In the Bertrand case, the Bertrand Paradox remains for finite entanglement (i.e., the perfectly competitive stage is reached for any N>=2), whereas with maximal entanglement each of the N firms will still have a non-zero shared profit. Hence, the Bertrand Paradox is completely resolved. Furthermore, a perfectly competitive market is reached asymptotically for N → ∞ in both the Cournot and Bertrand oligopoly.
Stapp, H.P.
1988-04-01
It is argued that the validity of the predictions of quantum theory in certain spin-correlation experiments entails a violation of Einstein's locality idea that no causal influence can act outside the forward light cone. First, two preliminary arguments suggesting such a violation are reviewed. They both depend, in intermediate stages, on the idea that the results of certain unperformed experiments are physically determinate. The second argument is entangled also with the problem of the meaning of physical reality. A new argument having neither of these characteristics is constructed. It is based strictly on the orthodox ideas of Bohr and Heisenberg, and has no realistic elements, or other ingredients, that are alien to orthodox quantum thinking.
Lincoln, Don
2016-07-12
The laws of quantum mechanics and relativity are quite perplexing however it is when the two theories are merged that things get really confusing. This combined theory predicts that empty space isnât empty at all â itâs a seething and bubbling cauldron of matter and antimatter particles springing into existence before disappearing back into nothingness. Scientists call this complicated state of affairs âquantum foam.â In this video, Fermilabâs Dr. Don Lincoln discusses this mind-bending idea and sketches some of the experiments that have convinced scientists that this crazy prediction is actually true.
1998-04-01
information representation and processing technology, although faster than the wheels and gears of the Charles Babbage computation machine, is still in...the same computational complexity class as the Babbage machine, with bits of information represented by entities which obey classical (non-quantum...nuclear double resonances Charles M Bowden and Jonathan P. Dowling Weapons Sciences Directorate, AMSMI-RD-WS-ST Missile Research, Development, and
NASA Astrophysics Data System (ADS)
Murdin, P.
2000-11-01
A development of quantum theory that was initiated in the 1920s by Werner Heisenberg (1901-76) and Erwin Schrödinger (1887-1961). The theory drew on a proposal made in 1925 Prince Louis de Broglie (1892-1987), that particles have wavelike properties (the wave-particle duality) and that an electron, for example, could in some respects be regarded as a wave with a wavelength that depended on its mo...
Efficient Quantum Information Processing via Quantum Compressions
NASA Astrophysics Data System (ADS)
Deng, Y.; Luo, M. X.; Ma, S. Y.
2016-01-01
Our purpose is to improve the quantum transmission efficiency and reduce the resource cost by quantum compressions. The lossless quantum compression is accomplished using invertible quantum transformations and applied to the quantum teleportation and the simultaneous transmission over quantum butterfly networks. New schemes can greatly reduce the entanglement cost, and partially solve transmission conflictions over common links. Moreover, the local compression scheme is useful for approximate entanglement creations from pre-shared entanglements. This special task has not been addressed because of the quantum no-cloning theorem. Our scheme depends on the local quantum compression and the bipartite entanglement transfer. Simulations show the success probability is greatly dependent of the minimal entanglement coefficient. These results may be useful in general quantum network communication.
Stapp, Henry
2011-11-10
Robert Griffiths has recently addressed, within the framework of a ‘consistent quantum theory’ (CQT) that he has developed, the issue of whether, as is often claimed, quantum mechanics entails a need for faster-than-light transfers of information over long distances. He argues, on the basis of his examination of certain arguments that claim to demonstrate the existence of such nonlocal influences, that such influences do not exist. However, his examination was restricted mainly to hidden-variable-based arguments that include in their premises some essentially classical-physics-type assumptions that are fundamentally incompatible with the precepts of quantum physics. One cannot logically prove properties of a system by attributing to the system properties alien to that system. Hence Griffiths’ rejection of hidden-variable-based proofs is logically warranted. Griffiths mentions the existence of a certain alternative proof that does not involve hidden variables, and that uses only macroscopically described observable properties. He notes that he had examined in his book proofs of this general kind, and concluded that they provide no evidence for nonlocal influences. But he did not examine the particular proof that he cites. An examination of that particular proof by the method specified by his ‘consistent quantum theory’ shows that the cited proof is valid within that restrictive framework. This necessary existence, within the ‘consistent’ framework, of long range essentially instantaneous influences refutes the claim made by Griffiths that his ‘consistent’ framework is superior to the orthodox quantum theory of von Neumann because it does not entail instantaneous influences. An added section responds to Griffiths’ reply, which cites a litany of ambiguities that seem to restrict, devastatingly, the scope of his CQT formalism, apparently to buttress his claim that my use of that formalism to validate the nonlocality theorem is flawed. But the
NASA Astrophysics Data System (ADS)
Hayden, Patrick; Myers, Robert
2017-01-01
Patrick Hayden and Robert Myers describe how the study of “qubits”, quantum bits of information, may hold the key to uniting quantum theory and general relativity into a unified theory of quantum gravity
Quantum probability and quantum decision-making.
Yukalov, V I; Sornette, D
2016-01-13
A rigorous general definition of quantum probability is given, which is valid not only for elementary events but also for composite events, for operationally testable measurements as well as for inconclusive measurements, and also for non-commuting observables in addition to commutative observables. Our proposed definition of quantum probability makes it possible to describe quantum measurements and quantum decision-making on the same common mathematical footing. Conditions are formulated for the case when quantum decision theory reduces to its classical counterpart and for the situation where the use of quantum decision theory is necessary.
Quantum Correlations Evolution Asymmetry in Quantum Channels
NASA Astrophysics Data System (ADS)
Li, Meng; Huang, Yun-Feng; Guo, Guang-Can
2017-03-01
It was demonstrated that the entanglement evolution of a specially designed quantum state in the bistochastic channel is asymmetric. In this work, we generalize the study of the quantum correlations, including entanglement and quantum discord, evolution asymmetry to various quantum channels. We found that the asymmetry of entanglement and quantum discord only occurs in some special quantum channels, and the behavior of the entanglement evolution may be quite different from the behavior of the quantum discord evolution. To quantum entanglement, in some channels it decreases monotonously with the increase of the quantum channel intensity. In some other channels, when we increase the intensity of the quantum channel, it decreases at first, then keeps zero for some time, and then rises up. To quantum discord, the evolution becomes more complex and you may find that it evolutes unsmoothly at some points. These results illustrate the strong dependence of the quantum correlations evolution on the property of the quantum channels. Supported by the National Natural Science Foundation of China under Grant Nos. 61327901, 61490711, 61225025, 11474268, and the Fundamental Research Funds for the Central Universities under Grant No. WK2470000018
Position-momentum uncertainty relations in the presence of quantum memory
Furrer, Fabian; Berta, Mario; Tomamichel, Marco; Scholz, Volkher B.; Christandl, Matthias
2014-12-15
A prominent formulation of the uncertainty principle identifies the fundamental quantum feature that no particle may be prepared with certain outcomes for both position and momentum measurements. Often the statistical uncertainties are thereby measured in terms of entropies providing a clear operational interpretation in information theory and cryptography. Recently, entropic uncertainty relations have been used to show that the uncertainty can be reduced in the presence of entanglement and to prove security of quantum cryptographic tasks. However, much of this recent progress has been focused on observables with only a finite number of outcomes not including Heisenberg’s original setting of position and momentum observables. Here, we show entropic uncertainty relations for general observables with discrete but infinite or continuous spectrum that take into account the power of an entangled observer. As an illustration, we evaluate the uncertainty relations for position and momentum measurements, which is operationally significant in that it implies security of a quantum key distribution scheme based on homodyne detection of squeezed Gaussian states.
NASA Astrophysics Data System (ADS)
Mukhanov, V. F.
2016-10-01
In March 2013, following an accurate processing of available measurement data, the Planck Scientific Collaboration published the highest-resolution photograph ever of the early Universe when it was only a few hundred thousand years old. The photograph showed galactic seeds in sufficient detail to test some nontrivial theoretical predictions made more than thirty years ago. Most amazing was that all predictions were confirmed to be remarkably accurate. With no exaggeration, we may consider it established experimentally that quantum physics, which is normally assumed to be relevant on the atomic and subatomic scale, also works on the scale of the entire Universe, determining its structure with all its galaxies, stars, and planets.
Quantum teleportation of optical quantum gates.
Bartlett, Stephen D; Munro, William J
2003-03-21
We show that a universal set of gates for quantum computation with optics can be quantum teleported through the use of EPR entangled states, homodyne detection, and linear optics and squeezing operations conditioned on measurement outcomes. This scheme may be used for fault-tolerant quantum computation in any optical scheme (qubit or continuous-variable). The teleportation of nondeterministic nonlinear gates employed in linear optics quantum computation is discussed.
An On-Demand Optical Quantum Random Number Generator with In-Future Action and Ultra-Fast Response
Stipčević, Mario; Ursin, Rupert
2015-01-01
Random numbers are essential for our modern information based society e.g. in cryptography. Unlike frequently used pseudo-random generators, physical random number generators do not depend on complex algorithms but rather on a physicsal process to provide true randomness. Quantum random number generators (QRNG) do rely on a process, wich can be described by a probabilistic theory only, even in principle. Here we present a conceptualy simple implementation, which offers a 100% efficiency of producing a random bit upon a request and simultaneously exhibits an ultra low latency. A careful technical and statistical analysis demonstrates its robustness against imperfections of the actual implemented technology and enables to quickly estimate randomness of very long sequences. Generated random numbers pass standard statistical tests without any post-processing. The setup described, as well as the theory presented here, demonstrate the maturity and overall understanding of the technology. PMID:26057576
An On-Demand Optical Quantum Random Number Generator with In-Future Action and Ultra-Fast Response.
Stipčević, Mario; Ursin, Rupert
2015-06-09
Random numbers are essential for our modern information based society e.g. in cryptography. Unlike frequently used pseudo-random generators, physical random number generators do not depend on complex algorithms but rather on a physical process to provide true randomness. Quantum random number generators (QRNG) do rely on a process, which can be described by a probabilistic theory only, even in principle. Here we present a conceptually simple implementation, which offers a 100% efficiency of producing a random bit upon a request and simultaneously exhibits an ultra low latency. A careful technical and statistical analysis demonstrates its robustness against imperfections of the actual implemented technology and enables to quickly estimate randomness of very long sequences. Generated random numbers pass standard statistical tests without any post-processing. The setup described, as well as the theory presented here, demonstrate the maturity and overall understanding of the technology.
Quantum Steganography and Quantum Error-Correction
ERIC Educational Resources Information Center
Shaw, Bilal A.
2010-01-01
Quantum error-correcting codes have been the cornerstone of research in quantum information science (QIS) for more than a decade. Without their conception, quantum computers would be a footnote in the history of science. When researchers embraced the idea that we live in a world where the effects of a noisy environment cannot completely be…
Quantum Hall effect in quantum electrodynamics
Penin, Alexander A.
2009-03-15
We consider the quantum Hall effect in quantum electrodynamics and find a deviation from the quantum-mechanical prediction for the Hall conductivity due to radiative antiscreening of electric charge in an external magnetic field. A weak dependence of the universal von Klitzing constant on the magnetic field strength, which can possibly be observed in a dedicated experiment, is predicted.
NASA Astrophysics Data System (ADS)
Lidar, Daniel A.; Brun, Todd A.
2013-09-01
Prologue; Preface; Part I. Background: 1. Introduction to decoherence and noise in open quantum systems Daniel Lidar and Todd Brun; 2. Introduction to quantum error correction Dave Bacon; 3. Introduction to decoherence-free subspaces and noiseless subsystems Daniel Lidar; 4. Introduction to quantum dynamical decoupling Lorenza Viola; 5. Introduction to quantum fault tolerance Panos Aliferis; Part II. Generalized Approaches to Quantum Error Correction: 6. Operator quantum error correction David Kribs and David Poulin; 7. Entanglement-assisted quantum error-correcting codes Todd Brun and Min-Hsiu Hsieh; 8. Continuous-time quantum error correction Ognyan Oreshkov; Part III. Advanced Quantum Codes: 9. Quantum convolutional codes Mark Wilde; 10. Non-additive quantum codes Markus Grassl and Martin Rötteler; 11. Iterative quantum coding systems David Poulin; 12. Algebraic quantum coding theory Andreas Klappenecker; 13. Optimization-based quantum error correction Andrew Fletcher; Part IV. Advanced Dynamical Decoupling: 14. High order dynamical decoupling Zhen-Yu Wang and Ren-Bao Liu; 15. Combinatorial approaches to dynamical decoupling Martin Rötteler and Pawel Wocjan; Part V. Alternative Quantum Computation Approaches: 16. Holonomic quantum computation Paolo Zanardi; 17. Fault tolerance for holonomic quantum computation Ognyan Oreshkov, Todd Brun and Daniel Lidar; 18. Fault tolerant measurement-based quantum computing Debbie Leung; Part VI. Topological Methods: 19. Topological codes Héctor Bombín; 20. Fault tolerant topological cluster state quantum computing Austin Fowler and Kovid Goyal; Part VII. Applications and Implementations: 21. Experimental quantum error correction Dave Bacon; 22. Experimental dynamical decoupling Lorenza Viola; 23. Architectures Jacob Taylor; 24. Error correction in quantum communication Mark Wilde; Part VIII. Critical Evaluation of Fault Tolerance: 25. Hamiltonian methods in QEC and fault tolerance Eduardo Novais, Eduardo Mucciolo and
Quantum Walk Schemes for Universal Quantum Computation
NASA Astrophysics Data System (ADS)
Underwood, Michael S.
Random walks are a powerful tool for the efficient implementation of algorithms in classical computation. Their quantum-mechanical analogues, called quantum walks, hold similar promise. Quantum walks provide a model of quantum computation that has recently been shown to be equivalent in power to the standard circuit model. As in the classical case, quantum walks take place on graphs and can undergo discrete or continuous evolution, though quantum evolution is unitary and therefore deterministic until a measurement is made. This thesis considers the usefulness of continuous-time quantum walks to quantum computation from the perspectives of both their fundamental power under various formulations, and their applicability in practical experiments. In one extant scheme, logical gates are effected by scattering processes. The results of an exhaustive search for single-qubit operations in this model are presented. It is shown that the number of distinct operations increases exponentially with the number of vertices in the scattering graph. A catalogue of all graphs on up to nine vertices that implement single-qubit unitaries at a specific set of momenta is included in an appendix. I develop a novel scheme for universal quantum computation called the discontinuous quantum walk, in which a continuous-time quantum walker takes discrete steps of evolution via perfect quantum state transfer through small 'widget' graphs. The discontinuous quantum-walk scheme requires an exponentially sized graph, as do prior discrete and continuous schemes. To eliminate the inefficient vertex resource requirement, a computation scheme based on multiple discontinuous walkers is presented. In this model, n interacting walkers inhabiting a graph with 2n vertices can implement an arbitrary quantum computation on an input of length n, an exponential savings over previous universal quantum walk schemes. This is the first quantum walk scheme that allows for the application of quantum error correction
NASA Astrophysics Data System (ADS)
Oriti, Daniele
2009-03-01
Preface; Part I. Fundamental Ideas and General Formalisms: 1. Unfinished revolution C. Rovelli; 2. The fundamental nature of space and time G. 't Hooft; 3. Does locality fail at intermediate length scales R. Sorkin; 4. Prolegomena to any future quantum gravity J. Stachel; 5. Spacetime symmetries in histories canonical gravity N. Savvidou; 6. Categorical geometry and the mathematical foundations of quantum gravity L. Crane; 7. Emergent relativity O. Dreyer; 8. Asymptotic safety R. Percacci; 9. New directions in background independent quantum gravity F. Markopoulou; Questions and answers; Part II: 10. Gauge/gravity duality G. Horowitz and J. Polchinski; 11. String theory, holography and quantum gravity T. Banks; 12. String field theory W. Taylor; Questions and answers; Part III: 13. Loop Quantum Gravity T. Thiemann; 14. Covariant loop quantum gravity? E. LIvine; 15. The spin foam representation of loop quantum gravity A. Perez; 16. 3-dimensional spin foam quantum gravity L. Freidel; 17. The group field theory approach to quantum gravity D. Oriti; Questions and answers; Part IV. Discrete Quantum Gravity: 18. Quantum gravity: the art of building spacetime J. Ambjørn, J. Jurkiewicz and R. Loll; 19. Quantum Regge calculations R. Williams; 20. Consistent discretizations as a road to quantum gravity R. Gambini and J. Pullin; 21. The causal set approach to quantum gravity J. Henson; Questions and answers; Part V. Effective Models and Quantum Gravity Phenomenology: 22. Quantum gravity phenomenology G. Amelino-Camelia; 23. Quantum gravity and precision tests C. Burgess; 24. Algebraic approach to quantum gravity II: non-commutative spacetime F. Girelli; 25. Doubly special relativity J. Kowalski-Glikman; 26. From quantum reference frames to deformed special relativity F. Girelli; 27. Lorentz invariance violation and its role in quantum gravity phenomenology J. Collins, A. Perez and D. Sudarsky; 28. Generic predictions of quantum theories of gravity L. Smolin; Questions and
Quantum algorithms for quantum field theories.
Jordan, Stephen P; Lee, Keith S M; Preskill, John
2012-06-01
Quantum field theory reconciles quantum mechanics and special relativity, and plays a central role in many areas of physics. We developed a quantum algorithm to compute relativistic scattering probabilities in a massive quantum field theory with quartic self-interactions (φ(4) theory) in spacetime of four and fewer dimensions. Its run time is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. In the strong-coupling and high-precision regimes, our quantum algorithm achieves exponential speedup over the fastest known classical algorithm.
2012-02-01
for constructing quantum gates. In [Miller11b] we detailed the use of multiplexing to simulate quantum teleportation . One alternative to multiplexing...LABORATORY INFORMATION DIRECTORATE QUANTUM INFORMATION SCIENCE FEBRUARY 2012 FINAL TECHNICAL REPORT ROME, NY...YYYY) FEB 2012 2. REPORT TYPE Final Technical Report 3. DATES COVERED (From - To) OCT 2009 – SEP 2011 4. TITLE AND SUBTITLE QUANTUM INFORMATION
Bohmian quantum mechanics with quantum trajectories
NASA Astrophysics Data System (ADS)
Jeong, Yeuncheol
The quantum trajectory method in the hydrodynamical formulation of Madelung-Bohm-Takabayasi quantum mechanics is an example of showing the cognitive importance of scientific illustrations and metaphors, especially, in this case, in computational quantum chemistry and electrical engineering. The method involves several numerical schemes of solving a set of hydrodynamical equations of motion for probability density fluids, based on the propagation of those probability density trajectories. The quantum trajectory method gives rise to, for example, an authentic quantum electron transport theory of motion to, among others, classically-minded applied scientists who probably have less of a commitment to traditional quantum mechanics. They were not the usual audience of quantum mechanics and simply choose to use a non-Copenhagen type interpretation to their advantage. Thus, the metaphysical issues physicists had a trouble with are not the main concern of the scientists. With the advantages of a visual and illustrative trajectory, the quantum theory of motion by Bohm effectively bridges quantum and classical physics, especially, in the mesoscale domain. Without having an abrupt shift in actions and beliefs from the classical to the quantum world, scientists and engineers are able to enjoy human cognitive capacities extended into the quantum mechanical domain.
A quantum-quantum Metropolis algorithm.
Yung, Man-Hong; Aspuru-Guzik, Alán
2012-01-17
The classical Metropolis sampling method is a cornerstone of many statistical modeling applications that range from physics, chemistry, and biology to economics. This method is particularly suitable for sampling the thermal distributions of classical systems. The challenge of extending this method to the simulation of arbitrary quantum systems is that, in general, eigenstates of quantum Hamiltonians cannot be obtained efficiently with a classical computer. However, this challenge can be overcome by quantum computers. Here, we present a quantum algorithm which fully generalizes the classical Metropolis algorithm to the quantum domain. The meaning of quantum generalization is twofold: The proposed algorithm is not only applicable to both classical and quantum systems, but also offers a quantum speedup relative to the classical counterpart. Furthermore, unlike the classical method of quantum Monte Carlo, this quantum algorithm does not suffer from the negative-sign problem associated with fermionic systems. Applications of this algorithm include the study of low-temperature properties of quantum systems, such as the Hubbard model, and preparing the thermal states of sizable molecules to simulate, for example, chemical reactions at an arbitrary temperature.
Uncertainty under quantum measures and quantum memory
NASA Astrophysics Data System (ADS)
Xiao, Yunlong; Jing, Naihuan; Li-Jost, Xianqing
2017-04-01
The uncertainty principle restricts potential information one gains about physical properties of the measured particle. However, if the particle is prepared in entanglement with a quantum memory, the corresponding entropic uncertainty relation will vary. Based on the knowledge of correlations between the measured particle and quantum memory, we have investigated the entropic uncertainty relations for two and multiple measurements and generalized the lower bounds on the sum of Shannon entropies without quantum side information to those that allow quantum memory. In particular, we have obtained generalization of Kaniewski-Tomamichel-Wehner's bound for effective measures and majorization bounds for noneffective measures to allow quantum side information. Furthermore, we have derived several strong bounds for the entropic uncertainty relations in the presence of quantum memory for two and multiple measurements. Finally, potential applications of our results to entanglement witnesses are discussed via the entropic uncertainty relation in the absence of quantum memory.
Quantum signatures of chaos or quantum chaos?
NASA Astrophysics Data System (ADS)
Bunakov, V. E.
2016-11-01
A critical analysis of the present-day concept of chaos in quantum systems as nothing but a "quantum signature" of chaos in classical mechanics is given. In contrast to the existing semi-intuitive guesses, a definition of classical and quantum chaos is proposed on the basis of the Liouville-Arnold theorem: a quantum chaotic system featuring N degrees of freedom should have M < N independent first integrals of motion (good quantum numbers) specified by the symmetry of the Hamiltonian of the system. Quantitative measures of quantum chaos that, in the classical limit, go over to the Lyapunov exponent and the classical stability parameter are proposed. The proposed criteria of quantum chaos are applied to solving standard problems of modern dynamical chaos theory.
Secure quantum signatures using insecure quantum channels
NASA Astrophysics Data System (ADS)
Amiri, Ryan; Wallden, Petros; Kent, Adrian; Andersson, Erika
2016-03-01
Digital signatures are widely used in modern communication to guarantee authenticity and transferability of messages. The security of currently used classical schemes relies on computational assumptions. We present a quantum signature scheme that does not require trusted quantum channels. We prove that it is unconditionally secure against the most general coherent attacks, and show that it requires the transmission of significantly fewer quantum states than previous schemes. We also show that the quantum channel noise threshold for our scheme is less strict than for distilling a secure key using quantum key distribution. This shows that "direct" quantum signature schemes can be preferable to signature schemes relying on secret shared keys generated using quantum key distribution.
Optimal Blind Quantum Computation
NASA Astrophysics Data System (ADS)
Mantri, Atul; Pérez-Delgado, Carlos A.; Fitzsimons, Joseph F.
2013-12-01
Blind quantum computation allows a client with limited quantum capabilities to interact with a remote quantum computer to perform an arbitrary quantum computation, while keeping the description of that computation hidden from the remote quantum computer. While a number of protocols have been proposed in recent years, little is currently understood about the resources necessary to accomplish the task. Here, we present general techniques for upper and lower bounding the quantum communication necessary to perform blind quantum computation, and use these techniques to establish concrete bounds for common choices of the client’s quantum capabilities. Our results show that the universal blind quantum computation protocol of Broadbent, Fitzsimons, and Kashefi, comes within a factor of (8)/(3) of optimal when the client is restricted to preparing single qubits. However, we describe a generalization of this protocol which requires exponentially less quantum communication when the client has a more sophisticated device.
Randomness: Quantum versus classical
NASA Astrophysics Data System (ADS)
Khrennikov, Andrei
2016-05-01
Recent tremendous development of quantum information theory has led to a number of quantum technological projects, e.g. quantum random generators. This development had stimulated a new wave of interest in quantum foundations. One of the most intriguing problems of quantum foundations is the elaboration of a consistent and commonly accepted interpretation of a quantum state. Closely related problem is the clarification of the notion of quantum randomness and its interrelation with classical randomness. In this short review, we shall discuss basics of classical theory of randomness (which by itself is very complex and characterized by diversity of approaches) and compare it with irreducible quantum randomness. We also discuss briefly “digital philosophy”, its role in physics (classical and quantum) and its coupling to the information interpretation of quantum mechanics (QM).
Diagrammatic quantum mechanics
NASA Astrophysics Data System (ADS)
Kauffman, Louis H.; Lomonaco, Samuel J.
2015-05-01
This paper explores how diagrams of quantum processes can be used for modeling and for quantum epistemology. The paper is a continuation of the discussion where we began this formulation. Here we give examples of quantum networks that represent unitary transformations by dint of coherence conditions that constitute a new form of non-locality. Local quantum devices interconnected in space can form a global quantum system when appropriate coherence conditions are maintained.
NASA Astrophysics Data System (ADS)
Durt, Thomas
2014-03-01
We shall present certain experiments aimed at testing the Markovian nature of the quantum statistical distributions and comment their results, which confirmed the standard quantum interpretation. We shall also show how certain sophisticated experiments that were realized in the framework of quantum optics during the last decade in order to test fundamental effects such as quantum non-locality also lead us to eliminate certain (non-Markovian and non-local) alternatives to the standard quantum theory.
McCaskey, Alexander J.
2016-11-18
There is a lack of state-of-the-art HPC simulation tools for simulating general quantum computing. Furthermore, there are no real software tools that integrate current quantum computers into existing classical HPC workflows. This product, the Quantum Virtual Machine (QVM), solves this problem by providing an extensible framework for pluggable virtual, or physical, quantum processing units (QPUs). It enables the execution of low level quantum assembly codes and returns the results of such executions.
NASA Astrophysics Data System (ADS)
Bojowald, Martin
The universe, ultimately, is to be described by quantum theory. Quantum aspects of all there is, including space and time, may not be significant for many purposes, but are crucial for some. And so a quantum description of cosmology is required for a complete and consistent worldview. At any rate, even if we were not directly interested in regimes where quantum cosmology plays a role, a complete physical description could not stop at a stage before the whole universe is reached. Quantum theory is essential in the microphysics of particles, atoms, molecules, solids, white dwarfs and neutron stars. Why should one expect this ladder of scales to end at a certain size? If regimes are sufficiently violent and energetic, quantum effects are non-negligible even on scales of the whole cosmos; this is realized at least once in the history of the universe: at the big bang where the classical theory of general relativity would make energy densities diverge.
Quantum optics, cavity QED, and quantum optomechanics
NASA Astrophysics Data System (ADS)
Meystre, Pierre
2013-05-01
Quantum optomechanics provides a universal tool to achieve the quantum control of mechanical motion. It does that in devices spanning a vast range of parameters, with mechanical frequencies from a few Hertz to GHz, and with masses from 10-20 g to several kilos. Its underlying ideas can be traced back to the study of gravitational wave antennas, quantum optics, cavity QED and laser cooling which, when combined with the recent availability of advanced micromechanical and nanomechanical devices, opens a path to the realization of macroscopic mechanical systems that operate deep in the quantum regime. At the fundamental level this development paves the way to experiments that will lead to a more profound understanding of quantum mechanics; and from the point of view of applications, quantum optomechanical techniques will provide motion and force sensing near the fundamental limit imposed by quantum mechanics (quantum metrology) and significantly expand the toolbox of quantum information science. After a brief summary of key historical developments, the talk will give a broad overview of the current state of the art of quantum optomechanics, and comment on future prospects both in applied and in fundamental science. Work supported by NSF, ARO and the DARPA QuASAR and ORCHID programs.
Expected number of quantum channels in quantum networks.
Chen, Xi; Wang, He-Ming; Ji, Dan-Tong; Mu, Liang-Zhu; Fan, Heng
2015-07-15
Quantum communication between nodes in quantum networks plays an important role in quantum information processing. Here, we proposed the use of the expected number of quantum channels as a measure of the efficiency of quantum communication for quantum networks. This measure quantified the amount of quantum information that can be teleported between nodes in a quantum network, which differs from classical case in that the quantum channels will be consumed if teleportation is performed. We further demonstrated that the expected number of quantum channels represents local correlations depicted by effective circles. Significantly, capacity of quantum communication of quantum networks quantified by ENQC is independent of distance for the communicating nodes, if the effective circles of communication nodes are not overlapped. The expected number of quantum channels can be enhanced through transformations of the lattice configurations of quantum networks via entanglement swapping. Our results can shed lights on the study of quantum communication in quantum networks.
Reliable quantum communication over a quantum relay channel
Gyongyosi, Laszlo; Imre, Sandor
2014-12-04
We show that reliable quantum communication over an unreliable quantum relay channels is possible. The coding scheme combines the results on the superadditivity of quantum channels and the efficient quantum coding approaches.
NASA Astrophysics Data System (ADS)
Alvarez-Rodriguez, U.; Sanz, M.; Lamata, L.; Solano, E.
2015-07-01
Quantum information provides fundamentally different computational resources than classical information. We prove that there is no unitary protocol able to add unknown quantum states belonging to different Hilbert spaces. This is an inherent restriction of quantum physics that is related to the impossibility of copying an arbitrary quantum state, i.e., the no-cloning theorem. Moreover, we demonstrate that a quantum adder, in absence of an ancillary system, is also forbidden for a known orthonormal basis. This allows us to propose an approximate quantum adder that could be implemented in the lab. Finally, we discuss the distinct character of the forbidden quantum adder for quantum states and the allowed quantum adder for density matrices.
Tang, Jiang; Liu, Huan; Zhitomirsky, David; Hoogland, Sjoerd; Wang, Xihua; Furukawa, Melissa; Levina, Larissa; Sargent, Edward H
2012-09-12
Colloidal quantum dot solids combine convenient solution-processing with quantum size effect tuning, offering avenues to high-efficiency multijunction cells based on a single materials synthesis and processing platform. The highest-performing colloidal quantum dot rectifying devices reported to date have relied on a junction between a quantum-tuned absorber and a bulk material (e.g., TiO(2)); however, quantum tuning of the absorber then requires complete redesign of the bulk acceptor, compromising the benefits of facile quantum tuning. Here we report rectifying junctions constructed entirely using inherently band-aligned quantum-tuned materials. Realizing these quantum junction diodes relied upon the creation of an n-type quantum dot solid having a clean bandgap. We combine stable, chemically compatible, high-performance n-type and p-type materials to create the first quantum junction solar cells. We present a family of photovoltaic devices having widely tuned bandgaps of 0.6-1.6 eV that excel where conventional quantum-to-bulk devices fail to perform. Devices having optimal single-junction bandgaps exhibit certified AM1.5 solar power conversion efficiencies of 5.4%. Control over doping in quantum solids, and the successful integration of these materials to form stable quantum junctions, offers a powerful new degree of freedom to colloidal quantum dot optoelectronics.
Interfacing external quantum devices to a universal quantum computer.
Lagana, Antonio A; Lohe, Max A; von Smekal, Lorenz
2011-01-01
We present a scheme to use external quantum devices using the universal quantum computer previously constructed. We thereby show how the universal quantum computer can utilize networked quantum information resources to carry out local computations. Such information may come from specialized quantum devices or even from remote universal quantum computers. We show how to accomplish this by devising universal quantum computer programs that implement well known oracle based quantum algorithms, namely the Deutsch, Deutsch-Jozsa, and the Grover algorithms using external black-box quantum oracle devices. In the process, we demonstrate a method to map existing quantum algorithms onto the universal quantum computer.
Quantum Estimation Methods for Quantum Illumination
NASA Astrophysics Data System (ADS)
Sanz, M.; Las Heras, U.; García-Ripoll, J. J.; Solano, E.; Di Candia, R.
2017-02-01
Quantum illumination consists in shining quantum light on a target region immersed in a bright thermal bath with the aim of detecting the presence of a possible low-reflective object. If the signal is entangled with the receiver, then a suitable choice of the measurement offers a gain with respect to the optimal classical protocol employing coherent states. Here, we tackle this detection problem by using quantum estimation techniques to measure the reflectivity parameter of the object, showing an enhancement in the signal-to-noise ratio up to 3 dB with respect to the classical case when implementing only local measurements. Our approach employs the quantum Fisher information to provide an upper bound for the error probability, supplies the concrete estimator saturating the bound, and extends the quantum illumination protocol to non-Gaussian states. As an example, we show how Schrödinger's cat states may be used for quantum illumination.
Quantum Estimation Methods for Quantum Illumination.
Sanz, M; Las Heras, U; García-Ripoll, J J; Solano, E; Di Candia, R
2017-02-17
Quantum illumination consists in shining quantum light on a target region immersed in a bright thermal bath with the aim of detecting the presence of a possible low-reflective object. If the signal is entangled with the receiver, then a suitable choice of the measurement offers a gain with respect to the optimal classical protocol employing coherent states. Here, we tackle this detection problem by using quantum estimation techniques to measure the reflectivity parameter of the object, showing an enhancement in the signal-to-noise ratio up to 3 dB with respect to the classical case when implementing only local measurements. Our approach employs the quantum Fisher information to provide an upper bound for the error probability, supplies the concrete estimator saturating the bound, and extends the quantum illumination protocol to non-Gaussian states. As an example, we show how Schrödinger's cat states may be used for quantum illumination.
Quantum thermodynamics of general quantum processes.
Binder, Felix; Vinjanampathy, Sai; Modi, Kavan; Goold, John
2015-03-01
Accurately describing work extraction from a quantum system is a central objective for the extension of thermodynamics to individual quantum systems. The concepts of work and heat are surprisingly subtle when generalizations are made to arbitrary quantum states. We formulate an operational thermodynamics suitable for application to an open quantum system undergoing quantum evolution under a general quantum process by which we mean a completely positive and trace-preserving map. We derive an operational first law of thermodynamics for such processes and show consistency with the second law. We show that heat, from the first law, is positive when the input state of the map majorizes the output state. Moreover, the change in entropy is also positive for the same majorization condition. This makes a strong connection between the two operational laws of thermodynamics.
Open Quantum Walks and Dissipative Quantum Computing
NASA Astrophysics Data System (ADS)
Petruccione, Francesco
2012-02-01
Open Quantum Walks (OQWs) have been recently introduced as quantum Markov chains on graphs [S. Attal, F. Petruccione, C. Sabot, and I. Sinayskiy, E-print: http://hal.archives-ouvertes.fr/hal-00581553/fr/]. The formulation of the OQWs is exclusively based upon the non-unitary dynamics induced by the environment. It will be shown that OQWs are a very useful tool for the formulation of dissipative quantum computing and quantum state preparation. In particular, it will be shown how to implement single qubit gates and the CNOT gate as OQWs on fully connected graphs. Also, OQWS make possible the dissipative quantum state preparation of arbitrary single qubit states and of all two-qubit Bell states. Finally, it will be shown how to reformulate efficiently a discrete time version of dissipative quantum computing in the language of OQWs.
NASA Astrophysics Data System (ADS)
Schaden, Martin
2002-12-01
Quantum theory is used to model secondary financial markets. Contrary to stochastic descriptions, the formalism emphasizes the importance of trading in determining the value of a security. All possible realizations of investors holding securities and cash is taken as the basis of the Hilbert space of market states. The temporal evolution of an isolated market is unitary in this space. Linear operators representing basic financial transactions such as cash transfer and the buying or selling of securities are constructed and simple model Hamiltonians that generate the temporal evolution due to cash flows and the trading of securities are proposed. The Hamiltonian describing financial transactions becomes local when the profit/loss from trading is small compared to the turnover. This approximation may describe a highly liquid and efficient stock market. The lognormal probability distribution for the price of a stock with a variance that is proportional to the elapsed time is reproduced for an equilibrium market. The asymptotic volatility of a stock in this case is related to the long-term probability that it is traded.
Quantum information causality.
Pitalúa-García, Damián
2013-05-24
How much information can a transmitted physical system fundamentally communicate? We introduce the principle of quantum information causality, which states the maximum amount of quantum information that a quantum system can communicate as a function of its dimension, independently of any previously shared quantum physical resources. We present a new quantum information task, whose success probability is upper bounded by the new principle, and show that an optimal strategy to perform it combines the quantum teleportation and superdense coding protocols with a task that has classical inputs.
Quantum Kolmogorov complexity and bounded quantum memory
Miyadera, Takayuki
2011-04-15
The effect of bounded quantum memory in a primitive information protocol has been examined using the quantum Kolmogorov complexity as a measure of information. We employed a toy two-party protocol in which Bob, by using a bounded quantum memory and an unbounded classical memory, estimates a message that was encoded in qubits by Alice in one of the bases X or Z. Our theorem gave a nontrivial effect of the memory boundedness. In addition, a generalization of the uncertainty principle in the presence of quantum memory has been obtained.
Work and quantum phase transitions: quantum latency.
Mascarenhas, E; Bragança, H; Dorner, R; França Santos, M; Vedral, V; Modi, K; Goold, J
2014-06-01
We study the physics of quantum phase transitions from the perspective of nonequilibrium thermodynamics. For first-order quantum phase transitions, we find that the average work done per quench in crossing the critical point is discontinuous. This leads us to introduce the quantum latent work in analogy with the classical latent heat of first order classical phase transitions. For second order quantum phase transitions the irreversible work is closely related to the fidelity susceptibility for weak sudden quenches of the system Hamiltonian. We demonstrate our ideas with numerical simulations of first, second, and infinite order phase transitions in various spin chain models.
Quantum optics. Gravity meets quantum physics
Adams, Bernhard W.
2015-02-27
Albert Einstein’s general theory of relativity is a classical formulation but a quantum mechanical description of gravitational forces is needed, not only to investigate the coupling of classical and quantum systems but simply to give a more complete description of our physical surroundings. In this issue of Nature Photonics, Wen-Te Liao and Sven Ahrens reveal a link between quantum and gravitational physics. They propose that in the quantum-optical effect of superradiance, the world line of electromagnetic radiation is changed by the presence of a gravitational field.
Quantum Darwinism in Quantum Brownian Motion
NASA Astrophysics Data System (ADS)
Blume-Kohout, Robin; Zurek, Wojciech H.
2008-12-01
Quantum Darwinism—the redundant encoding of information about a decohering system in its environment—was proposed to reconcile the quantum nature of our Universe with apparent classicality. We report the first study of the dynamics of quantum Darwinism in a realistic model of decoherence, quantum Brownian motion. Prepared in a highly squeezed state—a macroscopic superposition—the system leaves records whose redundancy increases rapidly with initial delocalization. Redundancy appears rapidly (on the decoherence time scale) and persists for a long time.
Quantum Darwinism in quantum Brownian motion.
Blume-Kohout, Robin; Zurek, Wojciech H
2008-12-12
Quantum Darwinism--the redundant encoding of information about a decohering system in its environment--was proposed to reconcile the quantum nature of our Universe with apparent classicality. We report the first study of the dynamics of quantum Darwinism in a realistic model of decoherence, quantum Brownian motion. Prepared in a highly squeezed state--a macroscopic superposition--the system leaves records whose redundancy increases rapidly with initial delocalization. Redundancy appears rapidly (on the decoherence time scale) and persists for a long time.
Converting Coherence to Quantum Correlations.
Ma, Jiajun; Yadin, Benjamin; Girolami, Davide; Vedral, Vlatko; Gu, Mile
2016-04-22
Recent results in quantum information theory characterize quantum coherence in the context of resource theories. Here, we study the relation between quantum coherence and quantum discord, a kind of quantum correlation which appears even in nonentangled states. We prove that the creation of quantum discord with multipartite incoherent operations is bounded by the amount of quantum coherence consumed in its subsystems during the process. We show how the interplay between quantum coherence consumption and creation of quantum discord works in the preparation of multipartite quantum correlated states and in the model of deterministic quantum computation with one qubit.
Practical security analysis of a quantum stream cipher by the Yuen 2000 protocol
Hirota, Osamu
2007-09-15
There exists a great gap between one-time pad with perfect secrecy and conventional mathematical encryption. The Yuen 2000 (Y00) protocol or {alpha}{eta} scheme may provide a protocol which covers from the conventional security to the ultimate one, depending on implementations. This paper presents the complexity-theoretic security analysis on some models of the Y00 protocol with nonlinear pseudo-random-number-generator and quantum noise diffusion mapping (QDM). Algebraic attacks and fast correlation attacks are applied with a model of the Y00 protocol with nonlinear filtering like the Toyocrypt stream cipher as the running key generator, and it is shown that these attacks in principle do not work on such models even when the mapping between running key and quantum state signal is fixed. In addition, a security property of the Y00 protocol with QDM is clarified. Consequently, we show that the Y00 protocol has a potential which cannot be realized by conventional cryptography and that it goes beyond mathematical encryption with physical encryption.
Necessary detection efficiencies for secure quantum key distribution and bound randomness
NASA Astrophysics Data System (ADS)
Acín, Antonio; Cavalcanti, Daniel; Passaro, Elsa; Pironio, Stefano; Skrzypczyk, Paul
2016-01-01
In recent years, several hacking attacks have broken the security of quantum cryptography implementations by exploiting the presence of losses and the ability of the eavesdropper to tune detection efficiencies. We present a simple attack of this form that applies to any protocol in which the key is constructed from the results of untrusted measurements performed on particles coming from an insecure source or channel. Because of its generality, the attack applies to a large class of protocols, from standard prepare-and-measure to device-independent schemes. Our attack gives bounds on the critical detection efficiencies necessary for secure quantum key distribution, which show that the implementation of most partly device-independent solutions is, from the point of view of detection efficiency, almost as demanding as fully device-independent ones. We also show how our attack implies the existence of a form of bound randomness, namely nonlocal correlations in which a nonsignalling eavesdropper can find out a posteriori the result of any implemented measurement.
Kendon, Vivien M; Nemoto, Kae; Munro, William J
2010-08-13
We briefly review what a quantum computer is, what it promises to do for us and why it is so hard to build one. Among the first applications anticipated to bear fruit is the quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data are encoded in the quantum computer. To perform a quantum simulation, the Hilbert space of the system to be simulated is mapped directly onto the Hilbert space of the (logical) qubits in the quantum computer. This type of direct correspondence is how data are encoded in a classical analogue computer. There is no binary encoding, and increasing precision becomes exponentially costly: an extra bit of precision doubles the size of the computer. This has important consequences for both the precision and error-correction requirements of quantum simulation, and significant open questions remain about its practicality. It also means that the quantum version of analogue computers, continuous-variable quantum computers, becomes an equally efficient architecture for quantum simulation. Lessons from past use of classical analogue computers can help us to build better quantum simulators in future.
Quantum mechanics and quantum information theory
NASA Astrophysics Data System (ADS)
van Camp, Wesley William
The principle aim of this dissertation is to investigate the philosophical application of quantum information theory to interpretational issues regarding the theory of quantum mechanics. Recently, quantum information theory has emerged as a potential source for such an interpretation. The main question with which this dissertation will be concerned is whether or not an information-theoretic interpretation can serve as a conceptually acceptable interpretation of quantum mechanics. It will be argued that some of the more obvious approaches -- that quantum information theory shows us that ultimately the world is made of information, and quantum Bayesianism -- fail as philosophical interpretations of quantum mechanics. However, the information-theoretic approach of Clifton, Bub, and Halvorson introduces Einstein's distinction between principle theories and constructive theories, arguing that quantum mechanics is best understood as an information-theoretic principle theory. While I argue that this particular approach fails, it does offer a viable new philosophical role for information theory. Specifically, an investigation of interpretationally successful principle theories such as Newtonian mechanics, special relativity, and general relativity, shows that the particular principles employed are necessary as constitutive elements of a framework which partially defines the basic explanatory concepts of space, time, and motion. Without such constitutive principles as preconditions for empirical meaning, scientific progress is hampered. It is argued that the philosophical issues in quantum mechanics stem from an analogous conceptual crisis. On the basis of this comparison, the best strategy for resolving these problems is to apply a similar sort of conceptual analysis to quantum mechanics so as to provide an appropriate set of constitutive principles clarifying the conceptual issues at stake. It is further argued that quantum information theory is ideally placed as a novel
Quantum Spread Spectrum Communication
Humble, Travis S
2010-01-01
We demonstrate that spectral teleportation can coherently dilate the spectral probability amplitude of a single photon. In preserving the encoded quantum information, this variant of teleportation subsequently enables a form of quantum spread spectrum communication.
NASA Astrophysics Data System (ADS)
Jennewein, Thomas; Higgins, Brendon
2013-03-01
Sending satellites equipped with quantum technologies into space will be the first step towards a global quantum-communication network. As Thomas Jennewein and Brendon Higgins explain, these systems will also enable physicists to test fundamental physics in new regimes.
NASA Astrophysics Data System (ADS)
2010-08-01
Can excitons be used to achieve scalable control of quantum light? Steffen Michaelis de Vasconcellos explained to Nature Photonics that the optoelectrical control of exciton qubits in quantum dots offers great promise.
NASA Astrophysics Data System (ADS)
Fiderer, Lukas J.; Kuś, Marek; Braun, Daniel
2016-09-01
We study mechanisms that allow one to synchronize the quantum phase of two qubits relative to a fixed basis. Starting from one qubit in a fixed reference state and the other in an unknown state, we find that, contrary to the impossibility of perfect quantum cloning, the quantum phase can be synchronized perfectly through a joined unitary operation. When both qubits are initially in a pure unknown state, perfect quantum-phase synchronization through unitary operations becomes impossible. In this situation we determine the maximum average quantum-phase synchronization fidelity and the distribution of relative phases and fidelities, and we identify optimal quantum circuits that achieve this maximum fidelity. A subset of these optimal quantum circuits enable perfect quantum-phase synchronization for a class of unknown initial states restricted to the equatorial plane of the Bloch sphere.
Quantum engineering: Diamond envy
NASA Astrophysics Data System (ADS)
Nunn, Joshua
2013-03-01
Nitrogen atoms trapped tens of nanometres apart in diamond can now be linked by quantum entanglement. This ability to produce and control entanglement in solid systems could enable powerful quantum computers.
Quantum dots as active material for quantum cascade lasers: comparison to quantum wells
NASA Astrophysics Data System (ADS)
Michael, Stephan; Chow, Weng W.; Schneider, Hans Christian
2016-03-01
We review a microscopic laser theory for quantum dots as active material for quantum cascade lasers, in which carrier collisions are treated at the level of quantum kinetic equations. The computed characteristics of such a quantum-dot active material are compared to a state-of-the-art quantum-well quantum cascade laser. We find that the current requirement to achieve a comparable gain-length product is reduced compared to that of the quantum-well quantum cascade laser.
Testing Nonassociative Quantum Mechanics.
Bojowald, Martin; Brahma, Suddhasattwa; Büyükçam, Umut
2015-11-27
The familiar concepts of state vectors and operators in quantum mechanics rely on associative products of observables. However, these notions do not apply to some exotic systems such as magnetic monopoles, which have long been known to lead to nonassociative algebras. Their quantum physics has remained obscure. This Letter presents the first derivation of potentially testable physical results in nonassociative quantum mechanics, based on effective potentials. They imply new effects which cannot be mimicked in usual quantum mechanics with standard magnetic fields.
Investigating Quantum Modulation States
2016-03-01
INVESTIGATING QUANTUM MODULATION STATES MARCH 2016 FINAL TECHNICAL REPORT APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED STINFO COPY AIR...3. DATES COVERED (From - To) OCT 2012 – SEP 2015 4. TITLE AND SUBTITLE INVESTIGATING QUANTUM MODULATION STATES 5a. CONTRACT NUMBER IN-HOUSE 5b...NOTES 14. ABSTRACT This effort was primarily concerned with quantum aspects of optical communications. Two quantum communications technologies were
Quantum Information Processing
2007-11-02
preparation, indicating, to our surprise, that standard quantum teleportation is *not* optimal for the transmission of states from Alice to Bob if...1 August 1998-1 August. 2001 4. TITLE AND SUBTITLE Quantum Information Processing 5. FUNDING NUMBERS DAAG55-98-C-0041 6. AUTHOR(S) David P... quantum entanglement in which the transmitted quantum state is known to Alice. Very recently, with A. Winter, a new, more efficient protocol for RSP has
Quantum computing and probability.
Ferry, David K
2009-11-25
Over the past two decades, quantum computing has become a popular and promising approach to trying to solve computationally difficult problems. Missing in many descriptions of quantum computing is just how probability enters into the process. Here, we discuss some simple examples of how uncertainty and probability enter, and how this and the ideas of quantum computing challenge our interpretations of quantum mechanics. It is found that this uncertainty can lead to intrinsic decoherence, and this raises challenges for error correction.
1990-07-20
elements of the density matrix . This leads us to a quantum kinetic theory . 3. QUANTUM KINETIC THEORY A quantum kinetic theory is expressed in terms of...the single-particle density matrix p(z, z’), or a mathematically equivalent object such as the Wigner dis- tribution function . The time evolution of p...mod- eled by elementary quantum theory because theform of the density matrix in equilibrium, p oc e- PH, assures us that the electrons actually occupy
Quantum Computing since Democritus
NASA Astrophysics Data System (ADS)
Aaronson, Scott
2013-03-01
1. Atoms and the void; 2. Sets; 3. Gödel, Turing, and friends; 4. Minds and machines; 5. Paleocomplexity; 6. P, NP, and friends; 7. Randomness; 8. Crypto; 9. Quantum; 10. Quantum computing; 11. Penrose; 12. Decoherence and hidden variables; 13. Proofs; 14. How big are quantum states?; 15. Skepticism of quantum computing; 16. Learning; 17. Interactive proofs and more; 18. Fun with the Anthropic Principle; 19. Free will; 20. Time travel; 21. Cosmology and complexity; 22. Ask me anything.
Quantum phenomena in superconductors
Clarke, J.
1987-08-01
This paper contains remarks by the author on aspects of macroscopic quantum phenomena in superconductors. Some topics discussed are: Superconducting low-inductance undulatory galvanometer (SLUGS), charge imbalance, cylindrical dc superconducting quantum interference device (SQUIDS), Geophysics, noise theory, magnetic resonance with SQUIDS, and macroscopic quantum tunneling. 23 refs., 4 figs. (LSP)
Quantum Boolean image denoising
NASA Astrophysics Data System (ADS)
Mastriani, Mario
2015-05-01
A quantum Boolean image processing methodology is presented in this work, with special emphasis in image denoising. A new approach for internal image representation is outlined together with two new interfaces: classical to quantum and quantum to classical. The new quantum Boolean image denoising called quantum Boolean mean filter works with computational basis states (CBS), exclusively. To achieve this, we first decompose the image into its three color components, i.e., red, green and blue. Then, we get the bitplanes for each color, e.g., 8 bits per pixel, i.e., 8 bitplanes per color. From now on, we will work with the bitplane corresponding to the most significant bit (MSB) of each color, exclusive manner. After a classical-to-quantum interface (which includes a classical inverter), we have a quantum Boolean version of the image within the quantum machine. This methodology allows us to avoid the problem of quantum measurement, which alters the results of the measured except in the case of CBS. Said so far is extended to quantum algorithms outside image processing too. After filtering of the inverted version of MSB (inside quantum machine), the result passes through a quantum-classical interface (which involves another classical inverter) and then proceeds to reassemble each color component and finally the ending filtered image. Finally, we discuss the more appropriate metrics for image denoising in a set of experimental results.
Quantum Griffiths Inequalities
NASA Astrophysics Data System (ADS)
Miyao, Tadahiro
2016-07-01
We present a general framework of Griffiths inequalities for quantum systems. Our approach is based on operator inequalities associated with self-dual cones and provides a consistent viewpoint of the Griffiths inequality. As examples, we discuss the quantum Ising model, quantum rotor model, Bose-Hubbard model, and Hubbard model. We present a model-independent structure that governs the correlation inequalities.
NASA Astrophysics Data System (ADS)
Iqbal, A.; Toor, A. H.
2002-03-01
We investigate the role of quantum mechanical effects in the central stability concept of evolutionary game theory, i.e., an evolutionarily stable strategy (ESS). Using two and three-player symmetric quantum games we show how the presence of quantum phenomenon of entanglement can be crucial to decide the course of evolutionary dynamics in a population of interacting individuals.
Quantum computing. Defining and detecting quantum speedup.
Rønnow, Troels F; Wang, Zhihui; Job, Joshua; Boixo, Sergio; Isakov, Sergei V; Wecker, David; Martinis, John M; Lidar, Daniel A; Troyer, Matthias
2014-07-25
The development of small-scale quantum devices raises the question of how to fairly assess and detect quantum speedup. Here, we show how to define and measure quantum speedup and how to avoid pitfalls that might mask or fake such a speedup. We illustrate our discussion with data from tests run on a D-Wave Two device with up to 503 qubits. By using random spin glass instances as a benchmark, we found no evidence of quantum speedup when the entire data set is considered and obtained inconclusive results when comparing subsets of instances on an instance-by-instance basis. Our results do not rule out the possibility of speedup for other classes of problems and illustrate the subtle nature of the quantum speedup question.
Quantum transport in ballistic quantum dots
NASA Astrophysics Data System (ADS)
Ferry, D. K.; Akis, R. A.; Pivin, D. P., Jr.; Bird, J. P.; Holmberg, N.; Badrieh, F.; Vasileska, D.
1998-10-01
Carriers in small 3D quantum boxes take us from unintentional qquantum dots in MOSFETs (arising from the doping fluctuations) tto single-electron quantum dots in semiconductor hheterostructures. In between these two extremes are the realm of oopen, ballistic quantum dots, in which the transport can be quite regular. Several issues must be considered in treating the transport in these dots, among which are: (1) phase coherence within the dot; (2) the transition between semi-classical and fully quantum transport, (3) the role of the contacts, vis-à-vis the fabricated boundaries, and (4) the actual versus internal boundaries. In this paper, we discuss these issues, including the primary observables in experiment, the intrinsic nature of oscillatory behavior in magnetic field and dot size, and the connection to semi-classical transport emphasizing the importance of the filtering by the input (and output) quantum point contacts.
Quantum Approach to Informatics
NASA Astrophysics Data System (ADS)
Stenholm, Stig; Suominen, Kalle-Antti
2005-08-01
An essential overview of quantum information Information, whether inscribed as a mark on a stone tablet or encoded as a magnetic domain on a hard drive, must be stored in a physical object and thus made subject to the laws of physics. Traditionally, information processing such as computation occurred in a framework governed by laws of classical physics. However, information can also be stored and processed using the states of matter described by non-classical quantum theory. Understanding this quantum information, a fundamentally different type of information, has been a major project of physicists and information theorists in recent years, and recent experimental research has started to yield promising results. Quantum Approach to Informatics fills the need for a concise introduction to this burgeoning new field, offering an intuitive approach for readers in both the physics and information science communities, as well as in related fields. Only a basic background in quantum theory is required, and the text keeps the focus on bringing this theory to bear on contemporary informatics. Instead of proofs and other highly formal structures, detailed examples present the material, making this a uniquely accessible introduction to quantum informatics. Topics covered include: * An introduction to quantum information and the qubit * Concepts and methods of quantum theory important for informatics * The application of information concepts to quantum physics * Quantum information processing and computing * Quantum gates * Error correction using quantum-based methods * Physical realizations of quantum computing circuits A helpful and economical resource for understanding this exciting new application of quantum theory to informatics, Quantum Approach to Informatics provides students and researchers in physics and information science, as well as other interested readers with some scientific background, with an essential overview of the field.
Quantum Optical Implementations of Quantum Computing and Quantum Informatics Protocols
2007-11-20
REPORT NUMBER Institute for Quantum Studies and Department of Physics Texas A&M University College Station, TX 77843- 4242 9. SPONSORING / MONITORING...September 30, 2007 Principal Investigators: Marlan 0. Scully and M. Subail Zubairy Institute for Quantum Studies and Department of Physics Texas A&M...Thus, N has a simple physical meaning: It is the ratio of the delay time of the buffer and the pulse duration and corresponds to the number of
Scalable optical quantum computer
Manykin, E A; Mel'nichenko, E V
2014-12-31
A way of designing a scalable optical quantum computer based on the photon echo effect is proposed. Individual rare earth ions Pr{sup 3+}, regularly located in the lattice of the orthosilicate (Y{sub 2}SiO{sub 5}) crystal, are suggested to be used as optical qubits. Operations with qubits are performed using coherent and incoherent laser pulses. The operation protocol includes both the method of measurement-based quantum computations and the technique of optical computations. Modern hybrid photon echo protocols, which provide a sufficient quantum efficiency when reading recorded states, are considered as most promising for quantum computations and communications. (quantum computer)
Quantum Operation Time Reversal
Crooks, Gavin E.
2008-03-25
The dynamics of an open quantum system can be described by a quantum operation: A linear, complete positive map of operators. Here, I exhibit a compact expression for the time reversal of a quantum operation, which is closely analogous to the time reversal of a classical Markov transition matrix. Since open quantum dynamics are stochastic, and not, in general, deterministic, the time reversal is not, in general, an inversion of the dynamics. Rather, the system relaxes toward equilibrium in both the forward and reverse time directions. The probability of a quantum trajectory and the conjugate, time reversed trajectory are related by the heat exchanged with the environment.
Quantum robots plus environments.
Benioff, P.
1998-07-23
A quantum robot is a mobile quantum system, including an on board quantum computer and needed ancillary systems, that interacts with an environment of quantum systems. Quantum robots carry out tasks whose goals include making specified changes in the state of the environment or carrying out measurements on the environment. The environments considered so far, oracles, data bases, and quantum registers, are seen to be special cases of environments considered here. It is also seen that a quantum robot should include a quantum computer and cannot be simply a multistate head. A model of quantum robots and their interactions is discussed in which each task, as a sequence of alternating computation and action phases,is described by a unitary single time step operator T {approx} T{sub a} + T{sub c} (discrete space and time are assumed). The overall system dynamics is described as a sum over paths of completed computation (T{sub c}) and action (T{sub a}) phases. A simple example of a task, measuring the distance between the quantum robot and a particle on a 1D lattice with quantum phase path dispersion present, is analyzed. A decision diagram for the task is presented and analyzed.
Superradiant Quantum Heat Engine.
Hardal, Ali Ü C; Müstecaplıoğlu, Özgür E
2015-08-11
Quantum physics revolutionized classical disciplines of mechanics, statistical physics, and electrodynamics. One branch of scientific knowledge however seems untouched: thermodynamics. Major motivation behind thermodynamics is to develop efficient heat engines. Technology has a trend to miniaturize engines, reaching to quantum regimes. Development of quantum heat engines (QHEs) requires emerging field of quantum thermodynamics. Studies of QHEs debate whether quantum coherence can be used as a resource. We explore an alternative where it can function as an effective catalyst. We propose a QHE which consists of a photon gas inside an optical cavity as the working fluid and quantum coherent atomic clusters as the fuel. Utilizing the superradiance, where a cluster can radiate quadratically faster than a single atom, we show that the work output becomes proportional to the square of the number of the atoms. In addition to practical value of cranking up QHE, our result is a fundamental difference of a quantum fuel from its classical counterpart.
NASA Astrophysics Data System (ADS)
Haven, Emmanuel; Khrennikov, Andrei
2013-01-01
Preface; Part I. Physics Concepts in Social Science? A Discussion: 1. Classical, statistical and quantum mechanics: all in one; 2. Econophysics: statistical physics and social science; 3. Quantum social science: a non-mathematical motivation; Part II. Mathematics and Physics Preliminaries: 4. Vector calculus and other mathematical preliminaries; 5. Basic elements of quantum mechanics; 6. Basic elements of Bohmian mechanics; Part III. Quantum Probabilistic Effects in Psychology: Basic Questions and Answers: 7. A brief overview; 8. Interference effects in psychology - an introduction; 9. A quantum-like model of decision making; Part IV. Other Quantum Probabilistic Effects in Economics, Finance and Brain Sciences: 10. Financial/economic theory in crisis; 11. Bohmian mechanics in finance and economics; 12. The Bohm-Vigier Model and path simulation; 13. Other applications to economic/financial theory; 14. The neurophysiological sources of quantum-like processing in the brain; Conclusion; Glossary; Index.
NASA Astrophysics Data System (ADS)
Cahill, Reginald T.
2002-10-01
So far proposed quantum computers use fragile and environmentally sensitive natural quantum systems. Here we explore the new notion that synthetic quantum systems suitable for quantum computation may be fabricated from smart nanostructures using topological excitations of a stochastic neural-type network that can mimic natural quantum systems. These developments are a technological application of process physics which is an information theory of reality in which space and quantum phenomena are emergent, and so indicates the deep origins of quantum phenomena. Analogous complex stochastic dynamical systems have recently been proposed within neurobiology to deal with the emergent complexity of biosystems, particularly the biodynamics of higher brain function. The reasons for analogous discoveries in fundamental physics and neurobiology are discussed.
Superradiant Quantum Heat Engine
Hardal, Ali Ü. C.; Müstecaplıoğlu, Özgür E.
2015-01-01
Quantum physics revolutionized classical disciplines of mechanics, statistical physics, and electrodynamics. One branch of scientific knowledge however seems untouched: thermodynamics. Major motivation behind thermodynamics is to develop efficient heat engines. Technology has a trend to miniaturize engines, reaching to quantum regimes. Development of quantum heat engines (QHEs) requires emerging field of quantum thermodynamics. Studies of QHEs debate whether quantum coherence can be used as a resource. We explore an alternative where it can function as an effective catalyst. We propose a QHE which consists of a photon gas inside an optical cavity as the working fluid and quantum coherent atomic clusters as the fuel. Utilizing the superradiance, where a cluster can radiate quadratically faster than a single atom, we show that the work output becomes proportional to the square of the number of the atoms. In addition to practical value of cranking up QHE, our result is a fundamental difference of a quantum fuel from its classical counterpart. PMID:26260797
Sorting quantum systems efficiently
Ionicioiu, Radu
2016-01-01
Measuring the state of a quantum system is a fundamental process in quantum mechanics and plays an essential role in quantum information and quantum technologies. One method to measure a quantum observable is to sort the system in different spatial modes according to the measured value, followed by single-particle detectors on each mode. Examples of quantum sorters are polarizing beam-splitters (PBS) – which direct photons according to their polarization – and Stern-Gerlach devices. Here we propose a general scheme to sort a quantum system according to the value of any d-dimensional degree of freedom, such as spin, orbital angular momentum (OAM), wavelength etc. Our scheme is universal, works at the single-particle level and has a theoretical efficiency of 100%. As an application we design an efficient OAM sorter consisting of a single multi-path interferometer which is suitable for a photonic chip implementation. PMID:27142705
NASA Astrophysics Data System (ADS)
Longair, Malcolm
2013-01-01
Part I. The Discovery of Quanta: 1. Physics and theoretical physics in 1895; 2. Planck and black-body radiation; 3. Einstein and quanta, 1900-1911; Part II. The Old Quantum Theory: 4. The Bohr model of the hydrogen atom; 5. Sommerfield and Ehrenfest - generalising the Bohr model; 6. Einstein coefficients, Bohr's correspondence principle and the first selection rules; 7. Understanding atomic spectra - additional quantum numbers; 8. Bohr's model of the periodic table and the origin of spin; 9. The wave-particle duality; Part III. The Discovery of Quantum Mechanics; 10. The collapse of the old quantum theory and the seeds of its regeneration; 11. The Heisenberg breakthrough; 12. Matrix mechanics; 13. Dirac's quantum mechanics; 14. Schrödinger and wave mechanics; 15. Reconciling matrix and wave mechanics; 16. Spin and quantum statistics; 17. The interpretation of quantum mechanics; 18. The aftermath; 19. Epilogue; Indices.
Quantum simulation of a quantum stochastic walk
NASA Astrophysics Data System (ADS)
Govia, Luke C. G.; Taketani, Bruno G.; Schuhmacher, Peter K.; Wilhelm, Frank K.
2017-03-01
The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk (QSW), which allows for incoherent movement of the walker, and therefore, directionality, is a generalization on the fully coherent quantum walk. While a QSW can always be described in Lindblad formalism, this does not mean that it can be microscopically derived in the standard weak-coupling limit under the Born–Markov approximation. This restricts the class of QSWs that can be experimentally realized in a simple manner. To circumvent this restriction, we introduce a technique to simulate open system evolution on a fully coherent quantum computer, using a quantum trajectories style approach. We apply this technique to a broad class of QSWs, and show that they can be simulated with minimal experimental resources. Our work opens the path towards the experimental realization of QSWs on large graphs with existing quantum technologies.
Recent progress of quantum annealing
Suzuki, Sei
2015-03-10
We review the recent progress of quantum annealing. Quantum annealing was proposed as a method to solve generic optimization problems. Recently a Canadian company has drawn a great deal of attention, as it has commercialized a quantum computer based on quantum annealing. Although the performance of quantum annealing is not sufficiently understood, it is likely that quantum annealing will be a practical method both on a conventional computer and on a quantum computer.
Quantum Information and Computing
NASA Astrophysics Data System (ADS)
Accardi, L.; Ohya, Masanori; Watanabe, N.
2006-03-01
Preface -- Coherent quantum control of [symbol]-atoms through the stochastic limit / L. Accardi, S. V. Kozyrev and A. N. Pechen -- Recent advances in quantum white noise calculus / L. Accardi and A. Boukas -- Control of quantum states by decoherence / L. Accardi and K. Imafuku -- Logical operations realized on the Ising chain of N qubits / M. Asano, N. Tateda and C. Ishii -- Joint extension of states of fermion subsystems / H. Araki -- Quantum filtering and optimal feedback control of a Gaussian quantum free particle / S. C. Edwards and V. P. Belavkin -- On existence of quantum zeno dynamics / P. Exner and T. Ichinose -- Invariant subspaces and control of decoherence / P. Facchi, V. L. Lepore and S. Pascazio -- Clauser-Horner inequality for electron counting statistics in multiterminal mesoscopic conductors / L. Faoro, F. Taddei and R. Fazio -- Fidelity of quantum teleportation model using beam splittings / K.-H. Fichtner, T. Miyadera and M. Ohya -- Quantum logical gates realized by beam splittings / W. Freudenberg ... [et al.] -- Information divergence for quantum channels / S. J. Hammersley and V. P. Belavkin -- On the uniqueness theorem in quantum information geometry / H. Hasegawa -- Noncanonical representations of a multi-dimensional Brownian motion / Y. Hibino -- Some of future directions of white noise theory / T. Hida -- Information, innovation and elemental random field / T. Hida -- Generalized quantum turing machine and its application to the SAT chaos algorithm / S. Iriyama, M. Ohya and I. Volovich -- A Stroboscopic approach to quantum tomography / A. Jamiolkowski -- Positive maps and separable states in matrix algebras / A. Kossakowski -- Simulating open quantum systems with trapped ions / S. Maniscalco -- A purification scheme and entanglement distillations / H. Nakazato, M. Unoki and K. Yuasa -- Generalized sectors and adjunctions to control micro-macro transitions / I. Ojima -- Saturation of an entropy bound and quantum Markov states / D. Petz -- An
Quantum coherence and quantum phase transitions
Li, Yan-Chao; Lin, Hai-Qing
2016-01-01
We study the connections between local quantum coherence (LQC) based on Wigner-Yanase skew information and quantum phase transitions (QPTs). When applied on the one-dimensional Hubbard, XY spin chain with three-spin interaction, and Su-Schrieffer-Heeger models, the LQC and its derivatives are used successfully to detect different types of QPTs in these spin and fermionic systems. Furthermore, the LQC is effective as the quantum discord (QD) in detecting QPTs at finite temperatures, where the entanglement has lost its effectiveness. We also demonstrate that the LQC can exhibit different behaviors in many forms compared with the QD. PMID:27193057
Quantum gravitational contributions to quantum electrodynamics.
Toms, David J
2010-11-04
Quantum electrodynamics describes the interactions of electrons and photons. Electric charge (the gauge coupling constant) is energy dependent, and there is a previous claim that charge is affected by gravity (described by general relativity) with the implication that the charge is reduced at high energies. However, that claim has been very controversial and the matter has not been settled. Here I report an analysis (free from the earlier controversies) demonstrating that quantum gravity corrections to quantum electrodynamics have a quadratic energy dependence that result in the electric charge vanishing at high energies, a result known as asymptotic freedom.
Standardization of quantum technologies and QKD activities within ETSI (Conference Presentation)
NASA Astrophysics Data System (ADS)
Lenhart, Gaby
2016-04-01
In order to establish new ICT technologies successfully on the market it is essential to build trust within any potential users. This is especially true for technologies which are based upon paradigms that are not yet familiar to these users, such as quantum technologies. Technical standards are an excellent means to offer a certain degree of legal reliability and technical interoperability that is required by industry for commercial take up. While such standards on the one hand must be clear enough to provide strict rules for implementers, on the other hand they also must remain flexible enough to not restrict progress in further research and development on the standardized technology. Hence such standards have to be produced by a wide variety of stakeholders taking into account all their different needs. The paper will provide some insight into the general mechanisms of standardization and their relation to quantum technologies. Alongside with the relevance of standardization as an enabler for certification of quantum based technologies it will explain its potential for securing intellectual property. In its first part paper will concentrate on the advantages of standardization and discuss fears some of the stakeholders share, in detail. The second part will focus on the technical work going on in ETSI in relation to quantum technologies. In 2008 ETSI created a standards work group on Quantum Key Distribution, the ETSI ISG QKD and more recently a group on Quantum-Safe Cryptography, the ETSI ISG QSC. A significant part of the technical work of these groups has already been published and will be introduced in the following. However a big share of work is still ongoing and lot more is planned for the future, as are continuous revisions and updates of the published specifications. This standardization work covers several levels: It starts of by problem statements in the form of use cases, from which technical requirements can be derived. These requirements then form
Cyclic networks of quantum gates
NASA Astrophysics Data System (ADS)
Cabauy, Peter
In this thesis we first give an introduction to the basic aspects of quantum computation followed by an analysis of networks of quantum logic gates where the qubit lines are loops (cyclic). Thus far, investigations into cyclic networks of quantum logic gates have not been examined (as far as we know) by the quantum information community. In our investigations of cyclic quantum networks we have studied simple, one and two qubit systems. The analysis includes: classifying networks into groups, the dynamics of the qubits in a cyclic quantum network, and the perturbation effects of an external qubit acting on a cyclic quantum network. The analysis will be followed by a discussion on quantum algorithms and quantum information processing with cyclic quantum networks, a novel implementation of a cyclic network quantum memory and a discussion of quantum sensors via cyclic quantum networks.
Staggered quantum walks with Hamiltonians
NASA Astrophysics Data System (ADS)
Portugal, R.; de Oliveira, M. C.; Moqadam, J. K.
2017-01-01
Quantum walks are recognizably useful for the development of new quantum algorithms, as well as for the investigation of several physical phenomena in quantum systems. Actual implementations of quantum walks face technological difficulties similar to the ones for quantum computers, though. Therefore, there is a strong motivation to develop new quantum-walk models which might be easier to implement. In this work we present an extension of the staggered quantum walk model that is fitted for physical implementations in terms of time-independent Hamiltonians. We demonstrate that this class of quantum walk includes the entire class of staggered quantum walk model, Szegedy's model, and an important subset of the coined model.