Related papers: A universal whitening algorithm for commercial ran…
Important quantum algorithm routines allow the implementation of specific quantum operations (a.k.a. gates) by combining basic quantum circuits with an iterative structure. In this structure, the number of repetitions of the basic circuit…
In fault-tolerant quantum computing, errors in unitary gate synthesis is comparable with noise inherent in the gates themselves. While mixed synthesis can suppress such coherent errors quadratically, there is no clear understanding on its…
We study the status of fair sampling on Noisy Intermediate Scale Quantum (NISQ) devices, in particular the IBM Q family of backends. Using the recently introduced Grover Mixer-QAOA algorithm for discrete optimization, we generate fair…
Prange's information set algorithm is a decoding algorithm for arbitrary linear codes. It decodes corrupted codewords of any $\mathbb{F}_2$-linear code $C$ of message length $n$ up to relative error rate $O(\log n / n)$ in…
We report upon a novel principle for realization of a fast nondeterministic random number generator whose randomness relies on intrinsic randomness of the quantum physical processes of photonic emission in semiconductors and subsequent…
Efficient synthesis of arbitrary quantum states and unitaries from a universal fault-tolerant gate-set e.g. Clifford+T is a key subroutine in quantum computation. As large quantum algorithms feature many qubits that encode coherent quantum…
The paper considers implementations of some randomized algorithms in connection with obtaining a random $n^2 \times n^2$ Sudoku matrix with programming language C++. For this purpose we describes the set $\Pi_n$ of all $(2n) \times n$…
We give three new algorithms for efficient in-place estimation, without using ancilla qubits, of average fidelity of a quantum logic gate acting on a d-dimensional system using much fewer random bits than what was known so far. Previous…
The Eastin-Knill theorem states that no quantum error correcting code can have a universal set of transversal gates. For CSS codes that can implement Clifford gates transversally it suffices to provide one additional non-Clifford gate, such…
Random numbers are a fundamental and useful resource in science and engineering with important applications in simulation, machine learning and cyber-security. Quantum systems can produce true random numbers because of the inherent…
We aim to access entropy sources available within smartphones in order to construct and evaluate a random number generator which is competitive in comparison with existing and proven random number generators. A prototype utilizing the…
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation of bigger unitary gates into elementary quantum operations,…
A general method to produce uniformly distributed pseudorandom numbers with extended precision by combining two pseudorandom numbers with lower precision is proposed. In particular, this method can be used for pseudorandom number generation…
The ever-increasing need for random numbers is clear in many areas of computer science, from neural networks to optimization. As such, most common programming language provide easy access to Pseudorandom Number Generators. However, these…
Random jammers that overpower transmitted signals are a practical concern for many wireless communication protocols. As such, wireless receivers must be able to cope with standard channel noise and jamming (intentional or unintentional). To…
Pseudorandom values are often generated as 64-bit binary words. These random words need to be converted into ranged values without statistical bias. We present an efficient algorithm to generate multiple independent uniformly-random bounded…
We present a practical high-speed quantum random number generator, where the timing of single-photon detection relative to an external time reference is measured as the raw data. The bias of the raw data can be substantially reduced…
With the advent of digital images the problem of keeping picture visualization uniformity arises because each printing or scanning device has its own color chart. So, universal color profiles are made by ICC to bring uniformity in various…
Recent work has explored data thinning, a generalization of sample splitting that involves decomposing a (possibly matrix-valued) random variable into independent components. In the special case of a $n \times p$ random matrix with…
Quantum random number generators are becoming mandatory in a demanding technology world of high performing learning algorithms and security guidelines. Our implementation based on principles of quantum mechanics enable us to achieve the…