## Abstract

We propose a quantum cryptography based on an algorithm for determining a function using continuous-variable entangled states. The security of our cryptography is based on the Ekert 1991 protocol, which uses an entangled state. Eavesdropping destroys the entangled state. Alice selects a secret function from the very large number of possible function types. Bob’s aim is to determine the selected function (a key) without an eavesdropper learning it. In order for both Alice and Bob to be able to select the same function classically, in the worst case Bob requires a very large number of queries to Alice. In the quantum case however, Bob requires just a single query. By measuring the single entangled state, which is sent to him by Alice, Bob can obtain the function that Alice has selected. This quantum key distribution method is faster than the very large number of classical queries that would be required in the classical case.

### Similar content being viewed by others

### Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.## References

Braunstein, S.L.: . Phys. Rev. Lett.

**80**, 4084 (1998)Braunstein, S.L.: . Nature (London)

**394**, 47 (1998)Lloyd, S., Braunstein, S.L.: . Phys. Rev. Lett.

**82**, 1784 (1999)Ralph, T.C.: . Phys. Rev. A

**61**, 010303(R) (1999)Hillery, M.: . Phys. Rev. A

**61**, 022309 (2000)Reid, M.D.: . Phys. Rev. A

**62**, 062308 (2000)Gottesman, D., Preskill, J.: . Phys. Rev. A

**63**, 022309 (2001)Grosshans, F., Grangier, P.: . Phys. Rev. Lett.

**88**, 057902 (2002)Bartlett, S.D., Sanders, B.C., Braunstein, S.L., Nemoto, K.: . Phys. Rev. Lett.

**88**, 097904 (2002)Nagata, K., Nakamura, T.: . Open Access Library J.

**2**, e1798 (2015)Nagata, K., Nakamura, T.: . Int. J. Theor. Phys.

**56**, 2086 (2017)Nagata, K., Nakamura, T., Farouk, A.: . Int. J. Theor. Phys.

**56**, 2887 (2017)Nguyen, D.M., Kim, S.: . Int. J. Theor. Phys.

**58**, 71 (2019)Nguyen, D.M., Kim, S.: . Int. J. Theor. Phys.

**58**, 2043 (2019)Diep, D.N., Giang, D.H.: . Int. J. Theor. Phys.

**56**, 2797 (2017)Nagata, K., Diep, D.N., Nakamura, T.: . Asian J. Math. Phys.

**4**(1), 7 (2020)Ekert, A.K.: . Phys. Rev. Lett.

**67**, 661 (1991)Nagata, K., Geurdes, H., Patro, S.K., Heidari, S., Farouk, A., Nakamura, T.: . Int. J. Theor. Phys.

**58**, 3694 (2019)

## Acknowledgments

We thank Professor Shahrokh Heidari, Professor Germano Resconi, Professor Santanu Kumar Patro, Professor Tadao Nakamura, Professor Jaewook Ahn, and Professor Han Geurdes for valuable comments.

## Author information

### Authors and Affiliations

### Corresponding author

## Ethics declarations

###
**Conflict of interests**

On behalf of all authors, the corresponding author states that there is no conflict of interest.

## Additional information

### Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## Appendix: The Phase Kick-Back Formation

### Appendix: The Phase Kick-Back Formation

We have the following formula by the phase kick-back formation [18]:

In what follows, we discuss the rationale behind the above relation (1). Consider the action of the *U*_{f} gate on the state |*x*〉|*ϕ*_{d}〉. Each summand in |*ϕ*_{d}〉 is of the form *ω*^{d−j}|*j*〉. We observe that

A variable *k* is introduced such that *f*(*x*) + *j* = *k*, from which it follows that *d* − *j* = *d* + *f*(*x*) − *k*. Thus, (2) becomes

If *k* < *d* we have that |*k* mod *d*〉 = |*k*〉 and thus the summands in |*ϕ*_{d}〉 for which *k* < *d* are transformed as follows:

On the other hand, as both *f*(*x*) and *j* are bounded from above by *d*, *k* is strictly less than 2*d*. Thus, when *d* ≤ *k* < 2*d*, we have |*k* mod *d*〉 = |*k* − *d*〉. Let *k* − *d* = *m*. We have

Hence, the summands in |*ϕ*_{d}〉 for which *k* ≥ *d* are transformed as follows:

Finally, regarding (4) and (6), we have

Therefore, the relation (1) holds.

## Rights and permissions

## About this article

### Cite this article

Diep, D.N., Nagata, K. & Wong, R. Continuous-Variable Quantum Computing and its Applications to Cryptography.
*Int J Theor Phys* **59**, 3184–3188 (2020). https://doi.org/10.1007/s10773-020-04571-5

Received:

Accepted:

Published:

Issue Date:

DOI: https://doi.org/10.1007/s10773-020-04571-5