Related papers: Quantum Group Actions
In this work, we study the hardness required to achieve proofs of quantumness (PoQ), which in turn capture (potentially interactive) quantum advantage. A ``trivial'' PoQ is to simply assume an average-case hard problem for classical…
Let $G$ be one of the classical compact, simple, centre-less, connected Lie groups or rank $n$ with a maximal torus $T$, the Lie algebra $\clg$ and let $\{ E_i, F_i, H_i, i=1, \ldots, n \}$ be the standard set of generators corresponding to…
Quantum Random Walks (QRW) were first defined as one-particle sectors of Quantum Lattice Gas Automata (QLGA). Recently, they have been generalized to include history dependence, either on previous coin (internal, i.e., spin or velocity)…
Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal…
For a finite-index $\mathrm{II}_1$ subfactor $N \subset M$, we prove the existence of a universal Hopf $\ast$-algebra (or, a discrete quantum group in the analytic language) acting on $M$ in a trace-preserving fashion and fixing $N$…
Alternative mathematical explorations in quantum computing can be of great scientific interest, especially if they come with penetrating physical insights. In this paper, we present a critical revisitation of our geometric (Clifford)…
The main notions of the quantum groups: coproduct, action and coaction, representation and corepresentation are discussed using simplest examples: $GL_q(2)$, $sl_q(2)$, $q$-oscillator algebra ${\cal A}(q)$, and reflection equation algebra.…
We propose a realistic setup, inspired by already existing experiments, within which we develop a general formalism for the implementation of distributed quantum gates. Mediated by a quantum link that establishes a bidirectional quantum…
In quantum resource theories (QRTs) certain quantum states and operations are deemed more valuable than others. While the determination of the ``free'' elements is usually guided by the constraints of some experimental setup, this can make…
Publicly-verifiable quantum money has been a central and challenging goal in quantum cryptography. To this day, no constructions exist based on standard assumptions. In this study, we propose an alternative notion called quantum cheques…
Let $\Uq$ be a quantum group. Regarding a (noncommutative) space with $\Uq$-symmetry as a $\Uq$-module algebra $A$, we may think of equivariant vector bundles on $A$ as projective $A$-modules with compatible $\Uq$-action. We construct an…
Given a Hopf algebra $A$ graded by a discrete group together with an action of the same group preserving the grading, we define a new Hopf algebra, which we call the graded twisting of $A$. If the action is adjoint, this new Hopf algebra is…
We describe how to implement quantum logic operations in a silicon-based quantum computer with phosphorus atoms serving as qubits. The information is stored in the states of nuclear spins and the conditional logic operations are implemented…
The Quantum Oracle Classification (QOC) problem is to classify a function, given only quantum black box access, into one of several classes without necessarily determining the entire function. Generally, QOC captures a very wide range of…
One-time programs (Goldwasser, Kalai and Rothblum, CRYPTO 2008) are functions that can be run on any single input of a user's choice, but not on a second input. Classically, they are unachievable without trusted hardware, but the…
Quantum Markov Semigroups (QMSs) originally arose in the study of the evolutions of irreversible open quantum systems. Mathematically, they are a generalization of classical Markov semigroups where the underlying function space is replaced…
Computationally hard problems based on coding theory, such as the syndrome decoding problem, have been used for constructing secure cryptographic schemes for a long time. Schemes based on these problems are also assumed to be secure against…
Quantum coin flipping (QCF) is an essential primitive for quantum cryptography. Unconditionally secure strong QCF with an arbitrarily small bias was widely believed to be impossible. But basing on a problem which cannot be solved without…
Fully homomorphic encryption is an encryption method with the property that any computation on the plaintext can be performed by a party having access to the ciphertext only. Here, we formally define and give schemes for quantum homomorphic…
We consider a one-dimensional chain of many superconducting quantum interference devices (SQUIDs), serving as charge qubits. Each SQUID is coupled to its nearest neighbors through constant capacitances. We study the quantum logic operations…