Related papers: Quantum Group Actions
We introduce the notion of an action of a discrete or compact quantum group on an operator system, and study equivariant operator system injectivity. We then prove a duality result that relates equivariant injectivity with dual injectivity…
In this article, we introduce the concept of partial actions of a group $G$ on quivers and demonstrate that for any given partial action of G on a quiver $\Gamma$, there exists another quiver, $\Gamma'$ with a full $G$-action. This is an…
Quantum states can in a sense be thought of as generalizations of classical probability distributions, but are more powerful than probability distributions when used for computation or communication. Quantum speedup therefore requires some…
We show how realistic cavity-assisted interaction between neutral atoms and coherent optical pulses, and measurement techniques, combined with optical transportation of atoms, allow for a universal set of quantum gates acting on…
Quantum computational pseudorandomness has emerged as a fundamental notion that spans connections to complexity theory, cryptography and fundamental physics. However, all known constructions of efficient quantum-secure pseudorandom objects…
We propose a scalable quantum-computing architecture based on cold atoms confined to sites of a tight optical lattice. The lattice is placed in a non-uniform magnetic field and the resulting Zeeman sublevels define qubit states. Microwave…
The functionality of classically-instructed remotely prepared random secret qubits was introduced in (Cojocaru et al 2018) as a way to enable classical parties to participate in secure quantum computation and communications protocols. The…
Ring signatures are a powerful primitive that allows a member to sign on behalf of a group, without revealing their identity. Recently, ring signatures have received additional attention as an ingredient for post-quantum deniable…
Spaces of constant curvature and their motion groups are described most naturally in Cartesian basis. All these motion groups also known as CK groups are obtained from orthogonal group by contractions and analytical continuations. On the…
The existence of one-way functions (OWFs) forms the minimal assumption in classical cryptography. However, this is not necessarily the case in quantum cryptography. One-way puzzles (OWPuzzs), introduced by Khurana and Tomer, provide a…
A discrete action principle for general quantum automata is proposed. This action principle is particularized to Discrete Time Quantum Walks (DTQWs) and then extended into an energy and momentum preserving, manifestly covariant formulation.…
Physical Unclonable Functions (PUFs) leverage inherent, non-clonable physical randomness to generate unique input-output pairs, serving as secure fingerprints for cryptographic protocols like authentication. Quantum PUFs (QPUFs) extend this…
This is a study of orbifold-quotients of quantum groups (quantum orbifolds $\Theta \rightrightarrows G_q$). These structures have been studied extensively in the case of the quantum $SU_2$ group. I will introduce a generalized mechanism…
Quantum Key Distribution (QKD) enables Information-Theoretically Secure (ITS) key exchange, robust even against future quantum computing threats. However, a fundamental limitation of QKD is the requirement for an authenticated classical…
We construct ergodic actions of compact quantum groups on C^*-algebras and von Neumann algebras, and exhibit phenomena of such actions that are of a different nature from ergodic actions of compact Lie groups. In particular, we construct:…
Quantum cryptography uses techniques and ideas from physics and computer science. The combination of these ideas makes the security proofs of quantum cryptography a complicated task. To prove that a quantum-cryptography protocol is secure,…
The advent of quantum computing poses a significant threat to the foundational cryptographic algorithms that secure modern digital communications. Protocols such as HTTPS, digital certificates, and public key infrastructures (PKIs) heavily…
Quantum algorithms for factoring and discrete logarithm have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the possibility of extending this general viewpoint to finding hidden…
Efficiently sampling a quantum state that is hard to distinguish from a truly random quantum state is an elementary task in quantum information theory that has both computational and physical uses. This is often referred to as pseudorandom…
A decision diagram (DD) is a graph-like data structure for homomorphic compression of Boolean and pseudo-Boolean functions. Over the past decades, decision diagrams have been successfully applied to verification, linear algebra, stochastic…