Related papers: A Double Cryptography Using The Keedwell Cross Inv…
In quantum computing, quantum circuits are fundamental representations of quantum algorithms, which are compiled into executable functions for quantum solutions. Quantum compilers transform algorithmic quantum circuits into one compatible…
Entanglement-measurement attack is one of the most famous attacks against quantum cryptography. In quantum cryptography protocols, eavesdropping checking is an effective means to resist this attack. There are currently two commonly used…
We associate to each infinite primitive Lie pseudogroup a Hopf algebra of `transverse symmetries', by refining a procedure due to Connes and the first author in the case of the general pseudogroup. The affiliated Hopf algebra can be viewed…
Continuous variable quantum cryptography has developed rapidly in recent decades, but how to verify identity in the continuous variable quantum system is still an urgent issue to be solved. To solve this problem, we propose a continuous…
We investigate the groups generated by the sets of $CP$, $CNOT$ and $SWAP^\alpha$ (power-of-SWAP) quantum gate operations acting on $n$ qubits. Isomorphisms to standard groups are found, and using techniques from representation theory, we…
A new class of quantum cryptography (QC) protocols that are robust against the most general photon number splitting attacks in a weak coherent pulse implementation has been recently proposed. In this article we give a quite exhaustive…
The main practical limitation of the McEliece public-key encryption scheme is probably the size of its key. A famous trend to overcome this issue is to focus on subclasses of alternant/Goppa codes with a non trivial automorphism group. Such…
Hardware crosstalk in multi-tenant superconducting quantum computers constitutes a significant security threat, enabling adversaries to inject targeted errors across tenant boundaries. We present the first end-to-end framework for mapping…
Numerous studies have reported two types of doubling of invariant closed curves (ICCs) in dynamical systems: (a) the creation of two disjoint ICCs such that iterations flip between them; and (b) the creation of a single ICC of double the…
We propose a quantum transmission based on bi-photons which are doubly-entangled both in polarisation and phase. This scheme finds a natural application in quantum cryptography, where we show that an eventual eavesdropper is bound to…
Instantaneous quantum polynomial time (IQP) is a model of (probably) non-universal quantum computation. Since it has been proven that IQP circuits are unlikely to be simulated classically up to a multiplicative error and an error in the…
Large scale quantum information processing (QIP) and distributed quantum computation require the ability to perform entangling operations on a large number of qubits. We describe a new photonic module which prepares, deterministically,…
In this paper, we identify many important properties and develop criteria for the existence of subquasigroups in finite quasigroups. Based on these results, we propose an effective method that concludes the nonexistence of subquasigroup of…
In this paper, we study groups of automorphisms of algebraic systems over a set of $p$-adic integers with different sets of arithmetic and coordinate-wise logical operations and congruence relations modulo $p^k,$ $k\ge 1.$ The main result…
If an eavesdropper succeeds in compromising the quantum as well as the classical channels and mimics the receiver "Bob" for the sender "Alice" and vice versa, one defence strategy is the successive, temporally interlocked partial…
We compute the quantum double, braiding and other canonical Hopf algebra constructions for the bicrossproduct Hopf algebra $H$ associated to the factorization of a finite group into two subgroups. The representations of the quantum double…
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of…
We introduce a new tool for the study of isogeny-based cryptography, namely pairings which are sesquilinear (conjugate linear) with respect to the $\mathcal{O}$-module structure of an elliptic curve with CM by an imaginary quadratic order…
Properties of unitary time evolution of quantum systems can be applied to define quantum cryptographic protocols. Dynamics of a qubit can be exploited as a data encryption/decryption procedure by means of timed measurements, implementation…
Computational advantages gained by quantum algorithms rely largely on the coherence of quantum devices and are generally compromised by decoherence. As an exception, we present a quantum algorithm for graph isomorphism testing whose…