相关论文: The Cubic Public-Key Transformation
A system of unitary transformations providing two optimal copies of an arbitrary input cubit is obtained. An algorithm based on classical Boolean algebra and allowing one to find any unitary transformation realized by the quantum CNOT…
We develop theoretical methods for the implementation of creation and destruction operators in separate registers of a quantum computer, allowing for a transparent and dynamical creation and destruction of particle modes in second…
Quantum Fourier transformation is important in many quantum algorithms. In this paper, we generalize quantum Fourier transformation over the Abelian group $\mathbb{Z}_N$ from two different points to get more efficient unitary…
We present a protocol for transferring arbitrary continuous-variable quantum states into a few discrete-variable qubits and back. The protocol is deterministic and utilizes only two-mode Rabi-type interactions which are readily available in…
Data compression is a ubiquitous aspect of modern information technology, and the advent of quantum information raises the question of what types of compression are feasible for quantum data, where it is especially relevant given the…
In this article, we have proposed a public key cryptography using Affine-Hill cipher with a generalized Fibonacci matrix(called multinacci matrix). Also proposed a key establishment(exchange of key matrix $K=Q_{\lambda}^{k}$ of order…
Permutable Chebyshev polynomials (T polynomials) defined over the field of real numbers are suitable for creating a Diffie-Hellman-like key exchange algorithm that is able to withstand attacks using quantum computers. The algorithm takes…
In their 2022 study, Kuang et al. introduced Multivariable Polynomial Public Key (MPPK) cryptography, leveraging the inversion relationship between multiplication and division for quantum-safe public key systems. They extended MPPK into…
We present simple implementations of Kak's three-stage quantum cryptography protocol. The case where the transformation is applied to more than one qubit at the same time is also considered.
In this work, we present an efficient method for computing in the generalized Jacobian of special singular curves, nodal curves. The efficiency of the operation is due to the representation of an element in the Jacobian group by a single…
We propose to encode a register of quantum bits in different collective electron spin wave excitations in a solid medium. Coupling to spins is enabled by locating them in the vicinity of a superconducting transmission line cavity, and…
We consider pretty good state transfer in coined quantum walks between antipodal vertices on the hypercube $Q_d$. When $d$ is a prime, this was proven to occur in the arc-reversal walk with Grover coins. We extend this result by…
Primality testing is an especially useful topic for public-key cryptography. In this paper, a novel primality test algorithm based on the Pell's cubic will be introduced, and its necessary primality conditions will be proved using three…
We describe a non-commutative generalization of the complex Fourier-Mellin transform to Clifford algebra valued signal functions over the domain $\R^{p,q}$ taking values in Cl(p,q), p+q=2. Keywords: algebra, Fourier transforms; Logic, set…
Multiplicative inverse is a crucial operation in public key cryptography, and been widely used in cryptography. Public key cryptography has given rise to such a need, in which we need to generate a related public and private pair of…
Quantum cryptography leverages many unique features of quantum information in order to construct cryptographic primitives that are oftentimes impossible classically. In this work, we build on the no-cloning principle of quantum mechanics…
An exact, one-to-one transform is presented that not only allows digital circular convolutions, but is free from multiplications and quantisation errors for transform lengths of arbitrary powers of two. The transform is analogous to the…
Multiphoton state in quantum cryptography decreases its security. Key disclosing with universal quantum cloning machine (UQCM) is considered in explicit manner. Although UQCM cannot make perfect clones, there is some invariant quantity…
We present a systematic analysis how one can improve performance of probabilistic programmable quantum processors. We generalize a simple Vidal-Masanes-Cirac processor that realizes U(1) rotations on a qubit with the phase of the rotation…
We propose a quantum circuit that creates a pure state corresponding to the quantum superposition of all prime numbers less than 2^n, where n is the number of qubits of the register. This Prime state can be built using Grover's algorithm,…