Multi-image quantum encryption scheme using blocks of bit planes and images
We present a multi-image quantum encryption/decryption scheme based on blocks of bit planes and images. We provide a quantum circuit for the quantum baker map.
quant-ph↗
arXiv subjects
Claire Levaillant
Publications and source records attributed to Claire Levaillant.
A novel approach to multi-image quantum encryption/decryption using qudits
We introduce groundbreaking techniques in image encryption, assuming the existence of quantum computing ressources functioning with qudits, where d is a power of 2. Our quantum representation of color multi-image is based on space-filling curves and allows to reduce the storage space. We generalize the quantum baker map, so that it may scramble two n-qudits. By doing so, we enlarge its parameter space exponentially, leading to a better security. We define two new concepts of mixed scrambling and mixed diffusion, and present a variety of schemes, depending on the needs of the users.
quant-ph↗
On arithmetical structures on K9
We study the arithmetical structures on the complete graph $K_9$. Our method is based on studying the solutions to writing the unit as a sum of 9 unit fractions. We work from the perspective of the Diophantine equation and use some elementary properties on the $p$-adic valuations. The proofs are assisted by trees and automata.
math.NT↗
Congruences related to Eulerian and Euler numbers
Using Eulerian and Euler numbers, we establish congruences concerning sums involving harmonic numbers, tangent numbers and Genocchi numbers.
math.NT↗
Powers of two weighted sum of the first p divided Bernoulli numbers modulo p
We show that, modulo some odd prime p, the powers of two weighted sum of the first p-2 divided Bernoulli numbers equals the Agoh-Giuga quotient plus twice the number of permutations on p-2 letters with an even number of ascents and distinct from the identity. We provide a combinatorial characterization of Wieferich primes, as well as of primes p for which p^2 divides the Fermat quotient q_p(2).
math.CO↗
Some implications of the Gessel identity
We generalize the congruences of Friedmann-Tamarkine (1909), Lehmer (1938), Ernvall-Metsankyla (1991) on the sums of powers of integers weighted by powers of the Fermat quotients to the next Fermat quotient power, namely to the third power of the Fermat quotient. Using this result and the Gessel identity (2005) combined with our past work (2001), we are able to relate residues of some truncated convolutions of Bernoulli numbers with some Ernvall-Metsankyla residues to some full convolutions of the same kind. We also establish some congruences concerning other related weighed sums of powers of integers when these sums are weighted by some analogs of the Teichmuller characters.
math.NT↗
Wilson's theorem modulo p^2 derived from Faulhaber polynomials
First, we present a new proof of Glaisher's formula dating from 1900 and concerning Wilson's theorem modulo p^2. Our proof uses p-adic numbers and Faulhaber's formula for the sums of powers (17th century), as well as more recent results on Faulhaber's coefficients obtained by Gessel and Viennot. Second, by using our method, we find a simpler proof than Sun's proof regarding a formula for (p-1)! modulo p^3, and one that can be generalized to higher powers of p. Third, we can derive from our method a way to compute the Stirling numbers modulo p^3, thus improving Glaisher and Sun's own results from 120 years ago and 20 years ago respectively. Last, our method allows to find new congruences on convolution of divided Bernoulli numbers and convolutions of divided Bernoulli numbers with Bernoulli numbers.
math.CO↗
Realizing an exact entangling gate using Fibonacci anyons
Fibonacci anyons are attractive for use in topological quantum computation because any unitary transformation of their state space can be approximated arbitrarily accurately by braiding. However there is no known braid that entangles two qubits without leaving the space spanned by the two qubits. In other words, there is no known "leakage-free" entangling gate made by braiding. In this paper, we provide a remedy to this problem by supplementing braiding with measurement operations in order to produce an exact controlled rotation gate on two qubits.
quant-ph↗
Universal Gates via Fusion and Measurement Operations on SU$(2)_4$ Anyons
We examine a class of operations for topological quantum computation based on fusing and measuring topological charges for systems with SU$(2)_4$ or $k=4$ Jones-Kauffman anyons. We show that such operations augment the braiding operations, which, by themselves, are not computationally universal. This augmentation results in a computationally universal gate set through the generation of an exact, topologically protected irrational phase gate and an approximate, topologically protected controlled-$Z$ gate.
quant-ph↗
Protocol for making a $2$-qutrit entangling gate in the Kauffman-Jones version of $SU(2)_4$
The following paper provides a protocol to physically generate a $2$-qutrit entangling gate in the Kauffman-Jones version of $SU(2)$ Chern-Simons theory at level $4$. The protocol uses elementary operations on anyons consisting of braids, interferometric measurements, fusions and unfusions and ancilla pair creation.
quant-ph↗
Universality of single quantum gates
We supply a rigorous proof that an open dense set of all possible 2-qubit gates G has the property that if the quantum circuit model is restricted to only permit swap of qubits lines and the application of G to pairs of lines, then the model is still computationally universal.
math.GR↗
A new set of generators and a physical interpretation for the SU(3) finite subgroup D(9,1,1;2,1,1)
After 100 years of effort, the classification of all the finite subgroups of SU(3) is yet incomplete. The most recently updated list can be found in P.O. Ludl, J. Phys. A: Math. Theor. 44 255204 (2011), where the structure of the series (C) and (D) of SU(3)-subgroups is studied. We provide a minimal set of generators for one of these groups which has order 162. These generators appear up to phase as the image of an irreducible unitary braid group representation issued from the Jones-Kauffman version of SU(2) Chern-Simons theory at level 4. In light of these new generators, we study the structure of the group in detail and recover the fact that it is isomorphic to the semidirect product Z_9 \times Z_3 \rtimes S_3 with respect to conjugation.
math.GR↗
Irreducibility of the Lawrence-Krammer representation of the BMW algebra of type $A_{n-1}$, PhD thesis California Institute of Technology 2008
Given two nonzero complex parameters $l$ and $m$, we construct by the mean of knot theory a matrix representation of size $\chl$ of the BMW algebra of type $A_{n-1}$ with parameters $l$ and $m$ over the field $\Q(l,r)$, where $m=\unsurr-r$. As a representation of the braid group on $n$ strands, it is equivalent to the Lawrence-Krammer representation that was introduced by Lawrence and Krammer to show the linearity of the braid groups. We prove that the Lawrence-Krammer representation is generically irreducible, but that for some values of the parameters $l$ and $r$, it becomes reducible. In particular, we show that for these values of the parameters $l$ and $r$, the BMW algebra is not semisimple. When the representation is reducible, the action on a proper invariant subspace of the Lawrence-Krammer space must be a Hecke algebra action. It allows us to describe the invariant subspaces when the representation is reducible.
math.RT↗