Zobrazeno 1 - 10
of 93
pro vyhledávání: '"Hu, Yanglin"'
Weak coin flipping is a cryptographic primitive in which two mutually distrustful parties generate a shared random bit to agree on a winner via remote communication. While a stand-alone secure weak coin flipping protocol can be constructed from noise
Externí odkaz:
http://arxiv.org/abs/2402.15233
We derive the predicted time dilation of delocalized atomic clocks in an optical lattice setup in the presence of a gravitational field to leading order in quantum relativistic corrections. We investigate exotic quantum states of motion whose relativ
Externí odkaz:
http://arxiv.org/abs/2307.08938
Autor:
Hu, Yanglin, Tomamichel, Marco
Publikováno v:
Phys. Rev. A 109, 022221 (2024)
The no-cloning theorem is a cornerstone of quantum cryptography. Here we generalize and rederive in a unified framework various upper bounds on the maximum achievable fidelity of probabilistic and deterministic cloning machines. Building on ideas by
Externí odkaz:
http://arxiv.org/abs/2305.02002
Publikováno v:
Quantum 7, 976 (2023)
Quantum homomorphic encryption, which allows computation by a server directly on encrypted data, is a fundamental primitive out of which more complex quantum cryptography protocols can be built. For such constructions to be possible, quantum homomorp
Externí odkaz:
http://arxiv.org/abs/2205.12127
Publikováno v:
In Aerospace Science and Technology April 2024 147
Publikováno v:
In International Review of Economics and Finance April 2024 92:998-1015
Publikováno v:
In Aerospace Science and Technology March 2024 146
Publikováno v:
In: Chen J., Feng Q., Xu J. (eds) Theory and Applications of Models of Computation. TAMC 2020. Lecture Notes in Computer Science, vol 12337. Springer, Cham (2020)
Universal quantum computers are the only general purpose quantum computers known that can be implemented as of today. These computers consist of a classical memory component which controls the quantum memory. In this paper, the space complexity of so
Externí odkaz:
http://arxiv.org/abs/2011.00302
We present a quantum adiabatic algorithm for a set of quantum 2-satisfiability (Q2SAT) problem, which is a generalization of 2-satisfiability (2SAT) problem. For a Q2SAT problem, we construct the Hamiltonian which is similar to that of a Heisenberg c
Externí odkaz:
http://arxiv.org/abs/2009.02600
Publikováno v:
In Cellular Signalling December 2023 112