Related papers: Quantum hashing based on symmetric groups
Quantum random number generator harnesses the power of quantum mechanics to generate true random numbers, making it valuable for various scientific applications. However, real-world devices often suffer from imperfections that can undermine…
In a recent paper [2], Chang et al. have proposed studying "Quantum $\mathbb{F}_{un}$": the $q \mapsto 1$ limit of Modal Quantum Theories over finite fields $\mathbb{F}_q$, motivated by the fact that such limit theories can be naturally…
Using the recent ability of quantum computers to initialize quantum states rapidly with high fidelity, we use a function operating on a discrete set to create a simple class of quantum channels. Fixed points and periodic orbits, that are…
We construct quantum public-key encryption from one-way functions. In our construction, public keys are quantum, but ciphertexts are classical. Quantum public-key encryption from one-way functions (or weaker primitives such as pseudorandom…
The subset cover problem for $k \geq 1$ hash functions, which can be seen as an extension of the collision problem, was introduced in 2002 by Reyzin and Reyzin to analyse the security of their hash-function based signature scheme HORS. The…
Building a useful quantum computer is a grand science and engineering challenge, currently pursued intensely by teams around the world. In the 1980s, Richard Feynman and Yuri Manin observed independently that computers based on quantum…
A notion of quantum conference is introduced in analogy with the usual notion of a conference that happens frequently in today's world. Quantum conference is defined as a multiparty secure communication task that allows each party to…
An overview of quantum computing and in particular the Hidden Subgroup Problem are presented from a mathematical viewpoint. Detailed proofs are supplied for many important results from the literature, and notation is unified, making it…
We consider a recently proposed generalisation of the abelian hidden subgroup problem: the shifted subset problem. The problem is to determine a subset S of some abelian group, given access to quantum states of the form |S+x>, for some…
Quantum walk based hash functions have attracted a lot of attention in recent years because of its faster execution time and robust resistance against attacks compared to classical hash functions. It has been observed that the underlying…
We introduce a notion of quantum function, and develop a compositional framework for finite quantum set theory based on a 2-category of quantum sets and quantum functions. We use this framework to formulate a 2-categorical theory of quantum…
The hash function is an important branch of cryptology. Controlled quantum walk based hash function is a kind of novel hash function, which is safe, flexible, high-efficient, and compatible. All existing controlled quantum walk based hash…
Quantum information brings together theories of physics and computer science. This synthesis challenges the basic intuitions of both fields. In this thesis, we show that adopting a unified and general language for process theories advances…
In quantum cryptography, there could be a new world, Microcrypt, where cryptography is possible but one-way functions (OWFs) do not exist. Although many fundamental primitives and useful applications have been found in Microcrypt, they lack…
Quantum algebras (also called quantum groups) are deformed versions of the usual Lie algebras, to which they reduce when the deformation parameter q is set equal to unity. From the mathematical point of view they are Hopf algebras. Their…
We show that the set of double-layer Fractional Quantum Hall (FQH) states with a given topological order form a finite Abelian group under a new product. This group structure makes it possible to construct new FQH states from known ones. We…
We present the Quantum Hamiltonian Analysis Toolkit (QHAT), a newly developed application that provides a user-friendly interface for studying Hamiltonians and performing Hamiltonian simulation on fault-tolerant quantum computers. QHAT…
In seminal work (arxiv:quant-ph/9707021) Alexei Kitaev proposed topological quantum computing (arXiv:cond-mat/0010440, arxiv:quant-ph/9707021, arXiv:quant-ph/0001108, arXiv:0707.1889), whereby logic gates of a quantum computer are conducted…
The Ahtekar-Isham C*-algebra known from Loop Quantum Gravity is the algebra of continuous functions on the space of (generalized) connections with a compact structure Lie group. The algebra can be constructed by some inductive techniques…
In 2015, Li et al. (Quantum Inf Process (2015) 14:2171-2181) proposed an arbitrated quantum signature (AQS) scheme based on the chained controlled-NOT operations encryption. However, this paper points out that in their scheme an attacker…