% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@ARTICLE{Gustiani:903637,
      author       = {Gustiani, Cica and DiVincenzo, David P},
      title        = {{B}lind oracular quantum computation},
      journal      = {Quantum science and technology},
      volume       = {6},
      number       = {4},
      issn         = {2058-9565},
      address      = {Philadelphia, PA},
      publisher    = {IOP Publishing},
      reportid     = {FZJ-2021-05286},
      pages        = {045022 -},
      year         = {2021},
      abstract     = {In the standard oracle model, an oracle efficiently
                      evaluates an unknown classical function independent of the
                      quantum algorithm itself. Quantum algorithms have a complex
                      interrelationship to their oracles; for example the
                      possibility of quantum speedup is affected by the manner by
                      which oracles are implemented. Therefore, it is physically
                      meaningful to separate oracles from their quantum
                      algorithms, and we introduce one such separation here. We
                      define the blind oracular quantum computation (BOQC) scheme,
                      in which the oracle is a distinct node in a quantum network.
                      Our work augments the client–server setting of quantum
                      computing, in which a powerful quantum computer server is
                      available on the network for discreet use by clients on the
                      network with low quantum power. In BOQC, an oracle is
                      another client that cooperates with the main client so that
                      an oracular quantum algorithm is run on the server. The
                      cooperation between the main client and the oracle takes
                      place (almost) without communication. We prove BOQC to be
                      blind: the server cannot learn anything about the clients'
                      computation. This proof is performed within the composable
                      security definitions provided by the formalism of abstract
                      cryptography. We enhance the BOQC scheme to be runnable with
                      minimal physical qubits when run on a solid-state quantum
                      network; we prove that this scheme, which we refer to as
                      BOQCo (BOQC-optimized), possesses the same security as
                      BOQC.},
      cin          = {PGI-11 / PGI-2},
      ddc          = {530},
      cid          = {I:(DE-Juel1)PGI-11-20170113 / I:(DE-Juel1)PGI-2-20110106},
      pnm          = {5224 - Quantum Networking (POF4-522)},
      pid          = {G:(DE-HGF)POF4-5224},
      typ          = {PUB:(DE-HGF)16},
      UT           = {WOS:000700891400001},
      doi          = {10.1088/2058-9565/ac13c8},
      url          = {https://juser.fz-juelich.de/record/903637},
}