Related papers: Real-Valued Somewhat-Pseudorandom Unitaries
In this paper, we characterize the multivariate uniform probability distribution of the first and second kinds in the framework of the $\mathcal{R}(p,q)$-deformed quantum algebras. Their bivariate distributions and related properties,…
Permutation decoding is a technique which involves finding a subset $S$, called PD-set, of the permutation automorphism group of a code $C$ in order to assist in decoding. An explicit construction of $\left \lfloor{\frac{2^m-m-1}{1+m}}…
We study the properties of the eigenvalues of real random matrices and their products. It is known that when the matrix elements are Gaussian-distributed independent random variables, the fraction of real eigenvalues tends to unity as the…
With the advent of near-term quantum computers, the simulation of properties of solids using quantum algorithms becomes possible. By an adequate description of the system's Hamiltonian, variational methods enable to fetch the band structure…
A fast quantum search algorithm for continuous variables is presented. The result is the quantum continuous variable analog of Grover's algorithm originally proposed for qubits. A continuous variable analog of the Hadamard (i.e., Fourier…
Recent works have shown that expansion of pseudorandom sets is of great importance. However, all current works on pseudorandom sets are limited only to product (or approximate product) spaces, where Fourier Analysis methods could be…
If a Hamiltonian is PT symmetric, there are two possibilities: Either the eigenvalues are entirely real, in which case the Hamiltonian is said to be in an unbroken-PT-symmetric phase, or else the eigenvalues are partly real and partly…
Convolutions or Hadamard products of analytic functions is a well explored area of research and many nice results are available in literature. On the other hand, very little is known in general about the convolutions of univalent harmonic…
Common random string model is a popular model in classical cryptography. We study a quantum analogue of this model called the common Haar state (CHS) model. In this model, every party participating in the cryptographic system receives many…
We deepen the theory of quasiorthogonal and approximately quasiorthogonal operator algebras through an analysis of the commutative algebra case. We give a new approach to calculate the measure of orthogonality between two such subalgebras…
This paper explores quantum field theories with pseudo-Hermitian Hamiltonians, where PT-symmetric Hamiltonians serve as a special case. In specific regimes, these pseudo-Hermitian Hamiltonians have real eigenspectra, orthogonal eigenstates,…
Simulation of quantum matters is a significant application of quantum computers. In contrast to the unitary operation which can be realized naturally on a quantum computer, the implementation of nonunitary operation, widely used in…
Different flavors of quantum pseudorandomness have proven useful for various cryptographic applications, with the compelling feature that these primitives are potentially weaker than post-quantum one-way functions. Ananth, Lin, and Yuen…
We propose variations of the class of hidden monomial cryptosystems in order to make it resistant to all known attacks. We use identities built upon a single bivariate polynomial equation with coefficients in a finite field. Indeed, it can…
We consider pseudo-unitary quantum systems and discuss various properties of pseudo-unitary operators. In particular we prove a characterization theorem for block-diagonalizable pseudo-unitary operators with finite-dimensional diagonal…
Unitary designs are widely used in quantum computation, but in many practical settings it suffices to construct a diagonal state design generated with unitary gates diagonal in the computational basis. In this work, we introduce a simple…
Unitary Fourier transform lies at the core of the multitudinous computational and metrological algorithms. Here we show experimentally how the unitary Fourier transform-based phase estimation protocol, used namely in quantum metrology, can…
Asymptotic dynamics of a Hadamard walk of two non-interacting quantum particles on a dynamically percolated finite line or a circle is investigated. We construct a basis of the attractor space of the corresponding random-unitary dynamics…
We present a procedure for averaging one-parameter random unitary groups and random self-adjoint groups. Central to this is a generalization of the notion of weak convergence of a sequence of measures and the corresponding generalization of…
The pseudo-random number generators (PRNGs), sampling algorithms, and algorithms for generating random integers in some common statistical packages and programming languages are unnecessarily inaccurate, by an amount that may matter for…