Continuous-variable quantum information

Last updated

Continuous-variable (CV) quantum information is the area of quantum information science that makes use of physical observables, like the strength of an electromagnetic field, whose numerical values belong to continuous intervals. [1] [2] [3] One primary application is quantum computing. In a sense, continuous-variable quantum computation is "analog", while quantum computation using qubits is "digital." In more technical terms, the former makes use of Hilbert spaces that are infinite-dimensional, while the Hilbert spaces for systems comprising collections of qubits are finite-dimensional. [4] One motivation for studying continuous-variable quantum computation is to understand what resources are necessary to make quantum computers more powerful than classical ones. [5]

Contents

Implementation

One approach to implementing continuous-variable quantum information protocols in the laboratory is through the techniques of quantum optics. [6] [7] [8] By modeling each mode of the electromagnetic field as a quantum harmonic oscillator with its associated creation and annihilation operators, one defines a canonically conjugate pair of variables for each mode, the so-called "quadratures", which play the role of position and momentum observables. These observables establish a phase space on which Wigner quasiprobability distributions can be defined. Quantum measurements on such a system can be performed using homodyne and heterodyne detectors.

Quantum teleportation of continuous-variable quantum information was achieved by optical methods in 1998. [9] [10] (Science deemed this experiment one of the "top 10" advances of the year. [11] ) In 2013, quantum-optics techniques were used to create a "cluster state", a type of preparation essential to one-way (measurement-based) quantum computation, involving over 10,000 entangled temporal modes, available two at a time. [12] In another implementation, 60 modes were simultaneously entangled in the frequency domain, in the optical frequency comb of an optical parametric oscillator. [13]

Another proposal is to modify the ion-trap quantum computer: instead of storing a single qubit in the internal energy levels of an ion, one could in principle use the position and momentum of the ion as continuous quantum variables. [14]

Applications

Continuous-variable quantum systems can be used for quantum cryptography, and in particular, quantum key distribution. [1] Quantum computing is another potential application, and a variety of approaches have been considered. [1] The first method, proposed by Seth Lloyd and Samuel L. Braunstein in 1999, was in the tradition of the circuit model: quantum logic gates are created by Hamiltonians that, in this case, are quadratic functions of the harmonic-oscillator quadratures. [5] Later, measurement-based quantum computation was adapted to the setting of infinite-dimensional Hilbert spaces. [15] [16] Yet a third model of continuous-variable quantum computation encodes finite-dimensional systems (collections of qubits) into infinite-dimensional ones. This model is due to Daniel Gottesman, Alexei Kitaev and John Preskill. [17]

Classical emulation

In all approaches to quantum computing, it is important to know whether a task under consideration can be carried out efficiently by a classical computer. An algorithm might be described in the language of quantum mechanics, but upon closer analysis, revealed to be implementable using only classical resources. Such an algorithm would not be taking full advantage of the extra possibilities made available by quantum physics. In the theory of quantum computation using finite-dimensional Hilbert spaces, the Gottesman–Knill theorem demonstrates that there exists a set of quantum processes that can be emulated efficiently on a classical computer. Generalizing this theorem to the continuous-variable case, it can be shown that, likewise, a class of continuous-variable quantum computations can be simulated using only classical analog computations. This class includes, in fact, some computational tasks that use quantum entanglement. [18] When the Wigner quasiprobability representations of all the quantities—states, time evolutions and measurements—involved in a computation are nonnegative, then they can be interpreted as ordinary probability distributions, indicating that the computation can be modeled as an essentially classical one. [15] This type of construction can be thought of as a continuum generalization of the Spekkens toy model. [19]

Computing continuous functions with discrete quantum systems

Occasionally, and somewhat confusingly, the term "continuous quantum computation" is used to refer to a different area of quantum computing: the study of how to use quantum systems having finite-dimensional Hilbert spaces to calculate or approximate the answers to mathematical questions involving continuous functions. A major motivation for investigating the quantum computation of continuous functions is that many scientific problems have mathematical formulations in terms of continuous quantities. [20] A second motivation is to explore and understand the ways in which quantum computers can be more capable or powerful than classical ones. The computational complexity of a problem can be quantified in terms of the minimal computational resources necessary to solve it. In quantum computing, resources include the number of qubits available to a computer and the number of queries that can be made to that computer. The classical complexity of many continuous problems is known. Therefore, when the quantum complexity of these problems is obtained, the question as to whether quantum computers are more powerful than classical can be answered. Furthermore, the degree of the improvement can be quantified. In contrast, the complexity of discrete problems is typically unknown. For example, the classical complexity of integer factorization is unknown.

One example of a scientific problem that is naturally expressed in continuous terms is path integration. The general technique of path integration has numerous applications including quantum mechanics, quantum chemistry, statistical mechanics, and computational finance. Because randomness is present throughout quantum theory, one typically requires that a quantum computational procedure yield the correct answer, not with certainty, but with high probability. For example, one might aim for a procedure that computes the correct answer with probability at least 3/4. One also specifies a degree of uncertainty, typically by setting the maximum acceptable error. Thus, the goal of a quantum computation could be to compute the numerical result of a path-integration problem to within an error of at most ε with probability 3/4 or more. In this context, it is known that quantum algorithms can outperform their classical counterparts, and the computational complexity of path integration, as measured by the number of times one would expect to have to query a quantum computer to get a good answer, grows as the inverse of ε. [21]

Other continuous problems for which quantum algorithms have been studied include finding matrix eigenvalues, [22] phase estimation, [23] the Sturm–Liouville eigenvalue problem, [24] solving differential equations with the Feynman–Kac formula, [25] initial value problems, [26] function approximation [27] high-dimensional integration., [28] and quantum cryptography [29]

See also

Related Research Articles

<span class="mw-page-title-main">Quantum computing</span> Computer hardware technology that uses quantum mechanics

A quantum computer is a computer that exploits quantum mechanical phenomena. On small scales, physical matter exhibits properties of both particles and waves, and quantum computing leverages this behavior using specialized hardware. Classical physics cannot explain the operation of these quantum devices, and a scalable quantum computer could perform some calculations exponentially faster than any modern "classical" computer. Theoretically a large-scale quantum computer could break some widely used encryption schemes and aid physicists in performing physical simulations; however, the current state of the art is largely experimental and impractical, with several obstacles to useful applications.

<span class="mw-page-title-main">Quantum teleportation</span> Physical phenomenon

Quantum teleportation is a technique for transferring quantum information from a sender at one location to a receiver some distance away. While teleportation is commonly portrayed in science fiction as a means to transfer physical objects from one location to the next, quantum teleportation only transfers quantum information. The sender does not have to know the particular quantum state being transferred. Moreover, the location of the recipient can be unknown, but to complete the quantum teleportation, classical information needs to be sent from sender to receiver. Because classical information needs to be sent, quantum teleportation cannot occur faster than the speed of light.

<span class="mw-page-title-main">Quantum entanglement</span> Correlation between quantum systems

Quantum entanglement is the phenomenon of a group of particles being generated, interacting, or sharing spatial proximity in such a way that the quantum state of each particle of the group cannot be described independently of the state of the others, including when the particles are separated by a large distance. The topic of quantum entanglement is at the heart of the disparity between classical and quantum physics: entanglement is a primary feature of quantum mechanics not present in classical mechanics.

In quantum computing, a quantum algorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation. A classical algorithm is a finite sequence of instructions, or a step-by-step procedure for solving a problem, where each step or instruction can be performed on a classical computer. Similarly, a quantum algorithm is a step-by-step procedure, where each of the steps can be performed on a quantum computer. Although all classical algorithms can also be performed on a quantum computer, the term quantum algorithm is generally reserved for algorithms that seem inherently quantum, or use some essential feature of quantum computation such as quantum superposition or quantum entanglement.

In the interpretation of quantum mechanics, a local hidden-variable theory is a hidden-variable theory that satisfies the principle of locality. These models attempt to account for the probabilistic features of quantum mechanics via the mechanism of underlying, but inaccessible variables, with the additional requirement that distant events be statistically independent.

Pieter Kok is a Dutch physicist and one of the co-developers of quantum interferometric optical lithography. His research specializations include linear optical implementations of quantum communication and computation protocols, quantum teleportation and the interpretation of quantum theory. He is a Professor of Theoretical Physics at the University of Sheffield.

In quantum mechanics, separable states are multipartite quantum states that can be written as a convex combination of product states. Product states are multipartite quantum states that can be written as a tensor product of states in each space. The physical intuition behind these definitions is that product states have no correlation between the different degrees of freedom, while separable states might have correlations, but all such correlations can be explained as due to a classical random variable, as opposed as being due to entanglement.

Reservoir computing is a framework for computation derived from recurrent neural network theory that maps input signals into higher dimensional computational spaces through the dynamics of a fixed, non-linear system called a reservoir. After the input signal is fed into the reservoir, which is treated as a "black box," a simple readout mechanism is trained to read the state of the reservoir and map it to the desired output. The first key benefit of this framework is that training is performed only at the readout stage, as the reservoir dynamics are fixed. The second is that the computational power of naturally available systems, both classical and quantum mechanical, can be used to reduce the effective computational cost.

Adiabatic quantum computation (AQC) is a form of quantum computing which relies on the adiabatic theorem to perform calculations and is closely related to quantum annealing.

Quantum cryptography is the science of exploiting quantum mechanical properties to perform cryptographic tasks. The best known example of quantum cryptography is quantum key distribution, which offers an information-theoretically secure solution to the key exchange problem. The advantage of quantum cryptography lies in the fact that it allows the completion of various cryptographic tasks that are proven or conjectured to be impossible using only classical communication. For example, it is impossible to copy data encoded in a quantum state. If one attempts to read the encoded data, the quantum state will be changed due to wave function collapse. This could be used to detect eavesdropping in quantum key distribution (QKD).

In quantum information theory, quantum discord is a measure of nonclassical correlations between two subsystems of a quantum system. It includes correlations that are due to quantum physical effects but do not necessarily involve quantum entanglement.

The noisy-storage model refers to a cryptographic model employed in quantum cryptography. It assumes that the quantum memory device of an attacker (adversary) trying to break the protocol is imperfect (noisy). The main goal of this model is to enable the secure implementation of two-party cryptographic primitives, such as bit commitment, oblivious transfer and secure identification.

Nicolas Jean Cerf is a Belgian physicist. He is professor of quantum mechanics and information theory at the Université Libre de Bruxelles and a member of the Royal Academies for Science and the Arts of Belgium. He received his Ph.D. at the Université Libre de Bruxelles in 1993, and was a researcher at the Université de Paris 11 and the California Institute of Technology. He is the director of the Center for Quantum Information and Computation at the Université Libre de Bruxelles.

Linear optical quantum computing or linear optics quantum computation (LOQC), also photonic quantum computing (PQC), is a paradigm of quantum computation, allowing (under certain conditions, described below) universal quantum computation. LOQC uses photons as information carriers, mainly uses linear optical elements, or optical instruments (including reciprocal mirrors and waveplates) to process quantum information, and uses photon detectors and quantum memories to detect and store quantum information.

<span class="mw-page-title-main">Quantum machine learning</span> Interdisciplinary research area at the intersection of quantum physics and machine learning

Quantum machine learning is the integration of quantum algorithms within machine learning programs.

In quantum computing, quantum supremacy or quantum advantage is the goal of demonstrating that a programmable quantum computer can solve a problem that no classical computer can solve in any feasible amount of time, irrespective of the usefulness of the problem. The term was coined by John Preskill in 2012, but the concept dates to Yuri Manin's 1980 and Richard Feynman's 1981 proposals of quantum computing.

In quantum computing, a qubit is a unit of information analogous to a bit in classical computing, but it is affected by quantum mechanical properties such as superposition and entanglement which allow qubits to be in some ways more powerful than classical bits for some tasks. Qubits are used in quantum circuits and quantum algorithms composed of quantum logic gates to solve computational problems, where they are used for input/output and intermediate computations.

Applying machine learning (ML) methods to the study of quantum systems is an emergent area of physics research. A basic example of this is quantum state tomography, where a quantum state is learned from measurement. Other examples include learning Hamiltonians, learning quantum phase transitions, and automatically generating new quantum experiments. ML is effective at processing large amounts of experimental or calculated data in order to characterize an unknown quantum system, making its application useful in contexts including quantum information theory, quantum technology development, and computational materials design. In this context, for example, it can be used as a tool to interpolate pre-calculated interatomic potentials, or directly solving the Schrödinger equation with a variational method.

The Eastin–Knill theorem is a no-go theorem that states: "No quantum error correcting code can have a continuous symmetry which acts transversely on physical qubits". In other words, no quantum error correcting code can transversely implement a universal gate set, where a transversal logical gate is one that can be implemented on a logical qubit by the independent action of separate physical gates on corresponding physical qubits.

This glossary of quantum computing is a list of definitions of terms and concepts used in quantum computing, its sub-disciplines, and related fields.

References

  1. 1 2 3 Weedbrook, Christian; Pirandola, Stefano; García-Patrón, Raúl; Cerf, Nicolas J.; Ralph, Timothy C.; Shapiro, Jeffrey H.; Lloyd, Seth (2012-05-01). "Gaussian quantum information". Reviews of Modern Physics. 84 (2): 621–669. arXiv: 1110.3234 . Bibcode:2012RvMP...84..621W. doi:10.1103/RevModPhys.84.621. S2CID   119250535.
  2. ↑ Braunstein, Samuel L.; van Loock, Peter (2005-06-29). "Quantum information with continuous variables". Reviews of Modern Physics . 77 (2): 513–577. arXiv: quant-ph/0410100 . Bibcode:2005RvMP...77..513B. doi:10.1103/RevModPhys.77.513. S2CID   118990906.
  3. ↑ Adesso, Gerardo; Ragy, Sammy; Lee, Antony R. (2014-03-12). "Continuous Variable Quantum Information: Gaussian States and Beyond". Open Systems & Information Dynamics . 21 (1n02): 1440001. arXiv: 1401.4679 . doi:10.1142/S1230161214400010. ISSN   1230-1612. S2CID   15318256.
  4. ↑ Braunstein, S. L.; Pati, A. K. (2012-12-06). Quantum Information with Continuous Variables. Springer Science & Business Media. CiteSeerX   10.1.1.762.4959 . doi:10.1007/978-94-015-1258-9. ISBN   9789401512589.
  5. 1 2 Lloyd, Seth; Braunstein, Samuel L. (1999-01-01). "Quantum Computation over Continuous Variables". Physical Review Letters . 82 (8): 1784–1787. arXiv: quant-ph/9810082 . Bibcode:1999PhRvL..82.1784L. doi:10.1103/PhysRevLett.82.1784. S2CID   119018466.
  6. ↑ Bartlett, Stephen D.; Sanders, Barry C. (2002-01-01). "Universal continuous-variable quantum computation: Requirement of optical nonlinearity for photon counting". Physical Review A . 65 (4): 042304. arXiv: quant-ph/0110039 . Bibcode:2002PhRvA..65d2304B. doi:10.1103/PhysRevA.65.042304. S2CID   118896298.
  7. ↑ Menicucci, Nicolas C.; Flammia, Steven T.; Pfister, Olivier (2008-07-14). "One-way quantum computing in the optical frequency comb". Physical Review Letters . 101 (13): 130501. arXiv: 0804.4468 . Bibcode:2008PhRvL.101m0501M. doi:10.1103/PhysRevLett.101.130501. PMID   18851426. S2CID   1307950.
  8. ↑ Tasca, D. S.; Gomes, R. M.; Toscano, F.; Souto Ribeiro, P. H.; Walborn, S. P. (2011-01-01). "Continuous-variable quantum computation with spatial degrees of freedom of photons". Physical Review A . 83 (5): 052325. arXiv: 1106.3049 . Bibcode:2011PhRvA..83e2325T. doi:10.1103/PhysRevA.83.052325. S2CID   118688635.
  9. ↑ Furusawa, A.; Sørensen, J. L.; Braunstein, S. L.; Fuchs, C. A.; Kimble, H. J.; Polzik, E. S. (1998-10-23). "Unconditional Quantum Teleportation". Science. 282 (5389): 706–709. Bibcode:1998Sci...282..706F. doi:10.1126/science.282.5389.706. ISSN   0036-8075. PMID   9784123.
  10. ↑ Braunstein, Samuel L.; Fuchs, Christopher A.; Kimble, H. J. (2000-02-01). "Criteria for continuous-variable quantum teleportation". Journal of Modern Optics. 47 (2–3): 267–278. arXiv: quant-ph/9910030 . Bibcode:2000JMOp...47..267B. doi:10.1080/09500340008244041. ISSN   0950-0340. S2CID   16713029.
  11. ↑ "The Runners-Up: The News and Editorial Staffs". Science. 282 (5397): 2157–2161. 1998-12-18. Bibcode:1998Sci...282.2157.. doi:10.1126/science.282.5397.2157. ISSN   0036-8075. S2CID   220101560.
  12. ↑ Yokoyama, Shota; Ukai, Ryuji; Armstrong, Seiji C.; Sornphiphatphong, Chanond; Kaji, Toshiyuki; Suzuki, Shigenari; Yoshikawa, Jun-ichi; Yonezawa, Hidehiro; Menicucci, Nicolas C. (2013). "Ultra-large-scale continuous-variable cluster states multiplexed in the time domain". Nature Photonics. 7 (12): 982–986. arXiv: 1306.3366 . Bibcode:2013NaPho...7..982Y. doi:10.1038/nphoton.2013.287. S2CID   53575929.
  13. ↑ Chen, Moran; Menicucci, Nicolas C.; Pfister, Olivier (2014-03-28). "Experimental realization of multipartite entanglement of 60 modes of a quantum optical frequency comb". Physical Review Letters . 112 (12): 120505. arXiv: 1311.2957 . Bibcode:2014PhRvL.112l0505C. doi:10.1103/PhysRevLett.112.120505. PMID   24724640. S2CID   18093254.
  14. ↑ Ortiz-Gutiérrez, Luis; Gabrielly, Bruna; Muñoz, Luis F.; Pereira, Kainã T.; Filgueiras, Jefferson G.; Villar, Alessandro S. (2017-08-15). "Continuous variables quantum computation over the vibrational modes of a single trapped ion". Optics Communications. 397: 166–174. arXiv: 1603.00065 . Bibcode:2017OptCo.397..166O. doi:10.1016/j.optcom.2017.04.011. S2CID   118617424.
  15. 1 2 Menicucci, Nicolas C.; van Loock, Peter; Gu, Mile; Weedbrook, Christian; Ralph, Timothy C.; Nielsen, Michael A. (2006-09-13). "Universal Quantum Computation with Continuous-Variable Cluster States". Physical Review Letters . 97 (11): 110501. arXiv: quant-ph/0605198 . Bibcode:2006PhRvL..97k0501M. doi:10.1103/PhysRevLett.97.110501. PMID   17025869. S2CID   14715751.
  16. ↑ Zhang, Jing; Braunstein, Samuel L. (2006-03-16). "Continuous-variable Gaussian analog of cluster states". Physical Review A. 73 (3): 032318. arXiv: quant-ph/0501112 . Bibcode:2006PhRvA..73c2318Z. doi:10.1103/PhysRevA.73.032318. S2CID   119511825.
  17. ↑ Gottesman, Daniel; Kitaev, Alexei; Preskill, John (2001-06-11). "Encoding a qubit in an oscillator". Physical Review A. 64 (1): 012310. arXiv: quant-ph/0008040 . Bibcode:2001PhRvA..64a2310G. doi:10.1103/PhysRevA.64.012310. S2CID   18995200.
  18. ↑ Bartlett, Stephen D.; Sanders, Barry C.; Braunstein, Samuel L.; Nemoto, Kae (2002-02-14). "Efficient Classical Simulation of Continuous Variable Quantum Information Processes". Physical Review Letters . 88 (9): 097904. arXiv: quant-ph/0109047 . Bibcode:2002PhRvL..88i7904B. doi:10.1103/PhysRevLett.88.097904. PMID   11864057. S2CID   2161585.
  19. ↑ Bartlett, Stephen D.; Rudolph, Terry; Spekkens, Robert W. (2012-07-10). "Reconstruction of Gaussian quantum mechanics from Liouville mechanics with an epistemic restriction". Physical Review A . 86 (1): 012103. arXiv: 1111.5057 . Bibcode:2012PhRvA..86a2103B. doi:10.1103/PhysRevA.86.012103. S2CID   119235025.
  20. ↑ Papageorgiou, A. "Continuous Quantum Computation: Project Description". quantum.cs.columbia.edu. Retrieved 2017-05-15.
  21. ↑ Traub, J. F.; Woźniakowski, H. (2002-10-01). "Path Integration on a Quantum Computer". Quantum Information Processing. 1 (5): 365–388. arXiv: quant-ph/0109113 . doi:10.1023/A:1023417813916. ISSN   1570-0755. S2CID   5821196.
  22. ↑ Jaksch, Peter; Papageorgiou, Anargyros (2003-12-19). "Eigenvector Approximation Leading to Exponential Speedup of Quantum Eigenvalue Calculation". Physical Review Letters. 91 (25): 257902. arXiv: quant-ph/0308016 . Bibcode:2003PhRvL..91y7902J. doi:10.1103/PhysRevLett.91.257902. PMID   14754158. S2CID   1855075.
  23. ↑ Bessen, Arvid J. (2005-04-08). "Lower bound for quantum phase estimation". Physical Review A. 71 (4): 042313. arXiv: quant-ph/0412008 . Bibcode:2005PhRvA..71d2313B. doi:10.1103/PhysRevA.71.042313. S2CID   118887469.
  24. ↑ Papageorgiou, A.; Woźniakowski, H (2005). "Classical and Quantum Complexity of the Sturm–Liouville Eigenvalue Problem". Quantum Information Processing. 4 (2): 87–127. arXiv: quant-ph/0502054 . Bibcode:2005quant.ph..2054P. doi:10.1007/s11128-005-4481-x. S2CID   11089349.
    Papageorgiou, A.; Woźniakowski, H. (2007-04-01). "The Sturm-Liouville Eigenvalue Problem and NP-Complete Problems in the Quantum Setting with Queries". Quantum Information Processing. 6 (2): 101–120. arXiv: quant-ph/0504191 . doi:10.1007/s11128-006-0043-0. ISSN   1570-0755. S2CID   7604869.
  25. ↑ Kwas, Marek (2004-10-18). "Complexity of multivariate Feynman-Kac path integration in randomized and quantum settings". arXiv: quant-ph/0410134 .
  26. ↑ Kacewicz, Bolesław (2004). "Randomized and quantum algorithms yield a speed-up for initial-value problems". Journal of Complexity. 20 (6): 821–834. arXiv: quant-ph/0311148 . doi:10.1016/j.jco.2004.05.002. S2CID   9949704.
    Szczesny, Marek (2006-12-12). "Randomized and Quantum Solution of Initial-Value Problems for Ordinary Differential Equations of Order k". arXiv: quant-ph/0612085 .
    Kacewicz, Bolesław (2005). "Improved bounds on the randomized and quantum complexity of initial-value problems". Journal of Complexity. 21 (5): 740–756. arXiv: quant-ph/0405018 . doi:10.1016/j.jco.2005.05.003. S2CID   5934254.
  27. ↑ Novak, Erich; Sloan, Ian H.; Woźniakowski, Henryk (2004-04-01). "Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers". Foundations of Computational Mathematics. 4 (2): 121–156. arXiv: quant-ph/0206023 . doi:10.1007/s10208-002-0074-6. ISSN   1615-3375. S2CID   10519614.
    Heinrich, Stefan (2004). "Quantum approximation I. Embeddings of finite-dimensional Lp spaces". Journal of Complexity. 20 (1): 5–26. arXiv: quant-ph/0305030 . doi:10.1016/j.jco.2003.08.002. S2CID   6044488.
    Heinrich, Stefan (2004). "Quantum approximation II. Sobolev embeddings". Journal of Complexity. 20 (1): 27–45. arXiv: quant-ph/0305031 . doi:10.1016/j.jco.2003.08.003. S2CID   6061625.
  28. ↑ Heinrich, Stefan (2002). "Quantum Summation with an Application to Integration". Journal of Complexity. 18 (1): 1–50. arXiv: quant-ph/0105116 . doi:10.1006/jcom.2001.0629. S2CID   14365504.
    Heinrich, Stefan (2003-02-01). "Quantum integration in Sobolev classes". Journal of Complexity. 19 (1): 19–42. arXiv: quant-ph/0112153 . doi:10.1016/S0885-064X(02)00008-0. S2CID   5471897.
    Novak, Erich (2001). "Quantum Complexity of Integration". Journal of Complexity. 17 (1): 2–16. arXiv: quant-ph/0008124 . doi:10.1006/jcom.2000.0566. S2CID   2271590.
  29. ↑ Mu, Yi (1996). "Shared cryptographic bits via quantized quadrature phase amplitudes of light". Journal of Optics Communication. 123 (1–3): 334–352. Bibcode:1996OptCo.123..344M. doi:10.1016/0030-4018(95)00688-5. S2CID   18374270.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.