IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v637y2024ics0378437124000372.html
   My bibliography  Save this article

Quantum one-time pad-based quantum homomorphic encryption schemes for circuits of the non-Clifford gates

Author

Listed:
  • Cheng, Zhen-Wen
  • Chen, Xiu-Bo
  • Xu, Gang
  • Ma, Li
  • Li, Zong-Peng

Abstract

Quantum homomorphic encryption can afford secure and convenient delegating computations for the client with weak computing power. The process of the server performing quantum gates on the client’s ciphertext is referred to as the homomorphic evaluation. At present, homomorphic evaluations of the group {H, S, T, controlled-X} for implementing universal quantum computations have been provided. However, except for T gate, there is little research on homomorphic evaluations of other non-Clifford gates, some of which can simplify quantum circuits. In order to optimize homomorphic evaluations of quantum circuits with complex computing functions, three quantum one-time pad-based quantum homomorphic encryption schemes for circuits of the non-Clifford gates are proposed in this paper. Firstly, we give homomorphic evaluations of V gate (the square root of X gate), V† gate, and controlled-Z gate in the Clifford gates. Secondly, for the non-Clifford gates, two methods for the homomorphic evaluation of controlled-V gate (or controlled-V† gate) and four methods for the homomorphic evaluation of Toffoli gate are presented in sequence. Among four homomorphic evaluation methods for Toffoli gate, the method based on Toffoli gate itself consumes the fewest auxiliary qubits and has the lowest evaluation circuit depth. Thirdly, three quantum homomorphic encryption schemes for the single-qubit gates, the double-qubit gates, and the triple-qubit gate are respectively proposed. Finally, inspired by the perfectly secure encryption technology of quantum one-time pad, we prove the security of the proposed schemes, enabling safer and faster completion of the client’s entrusted computations.

Suggested Citation

  • Cheng, Zhen-Wen & Chen, Xiu-Bo & Xu, Gang & Ma, Li & Li, Zong-Peng, 2024. "Quantum one-time pad-based quantum homomorphic encryption schemes for circuits of the non-Clifford gates," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 637(C).
  • Handle: RePEc:eee:phsmap:v:637:y:2024:i:c:s0378437124000372
    DOI: 10.1016/j.physa.2024.129529
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437124000372
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2024.129529?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kevin Marshall & Christian S. Jacobsen & Clemens Schäfermeier & Tobias Gehring & Christian Weedbrook & Ulrik L. Andersen, 2016. "Continuous-variable quantum computing on encrypted data," Nature Communications, Nature, vol. 7(1), pages 1-7, December.
    2. K. A. G. Fisher & A. Broadbent & L. K. Shalm & Z. Yan & J. Lavoie & R. Prevedel & T. Jennewein & K. J. Resch, 2014. "Quantum computing on encrypted data," Nature Communications, Nature, vol. 5(1), pages 1-7, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Beatrice Polacchi & Dominik Leichtle & Leonardo Limongi & Gonzalo Carvacho & Giorgio Milani & Nicolò Spagnolo & Marc Kaplan & Fabio Sciarrino & Elham Kashefi, 2023. "Multi-client distributed blind quantum computation with the Qline architecture," Nature Communications, Nature, vol. 14(1), pages 1-8, December.
    2. Zhang, Jing-Wen & Xu, Gang & Chen, Xiu-Bo & Chang, Yan & Dong, Zhi-Chao, 2023. "Improved multiparty quantum private comparison based on quantum homomorphic encryption," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 610(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:637:y:2024:i:c:s0378437124000372. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.