AlgorithmicaHAMRICK G., Secrecy, computational loads and rates in practical quantum cryptography, Algorithmica 34(4), 2002, pp. 314-339.Gilbert et al., “Secrecy, Computational Loads and Rates in Practical Quan
A high fidelity is also crucial to exploit MUBs for quantum cryptography. Results Mutually unbiased bases. Let A and B be two operators in a d- dimensional Hilbert space, with orthonormal eigenbases {jaiæ} and {jbiæ} respectively. Eigenstates of these observables are said to be ...
Alice can use her key to transform a plaintext into a ciphertext, which is unintelligible to Eve. In contrast, Bob, with his key, can decrypt the ciphertext and recover the plaintext. In cryptography, the security of a cryptosystem should rely solely on the secrecy of the key. The quest...
Le Gall, F., Nakajima, S.: Quantum algorithm for triangle finding in sparse graphs. Algorithmica79(3), 941–959 (2017).https://doi.org/10.1007/s00453-016-0267-z ArticleMathSciNetMATHGoogle Scholar Carette, T., Lauriere, M., Magniez, F. Extended Learning Graphs for Triangle Finding. A...
Algorithmica, 34 (4) (2002), pp. 389-412 earlier version in Crypto’2000 View in ScopusGoogle Scholar [20] O. Goldreich, H. Karloff, L. Schulman, L. Trevisan, Lower bounds for linear locally decodable codes and private information retrieval, in: Proceedings of 17th IEEE Conference on Comp...
Algorithmica 34 (2002) 429-448 Special issue on Quantum Computation and Cryptography.P. Hoyer, J. Neerbeck, and Y. Shi. Quantum complexities of ordered searching, sorting and element distinctness. Algorithmica, 34(4):429- 448, 2002. Special Issue in Quantum Computation and Cryptography....
Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems and solving large systems of line
Quantum networks will allow to implement communication tasks beyond the reach of their classical counterparts. A pressing and necessary issue for the design of quantum network protocols is the quantification of the rates at which these tasks can be perfo
Lexicographically minimal string rotation (LMSR) is a problem to find the minimal one among all rotations of a string in the lexicographical order, which i
As an interdisciplinary between quantum computing and image processing, quantum image processing provides more possibilities for image processing due to th