Related papers: Computational indistinguishability and boson sampl…
The quest for practical cryptographic primitives that are robust against quantum computers is of vital importance for the field of cryptography. Among the abundance of different cryptographic primitives one may consider, one-way functions…
We present a variation of a quantum algorithm for the machine learning task of classification with graph-structured data. The algorithm implements a feature extraction strategy that is based on Gaussian boson sampling (GBS) a near term…
BosonSampling is a quantum mechanical task involving Fock basis state preparation and detection and evolution using only linear interactions. A classical algorithm for producing samples from this quantum task cannot be efficient unless the…
In this work we present a model for computation of random processes in digital computers which solves the problem of periodic sequences and hidden errors produced by correlations. We show that systems with non-invertible non-linearities can…
Gaussian Boson Sampling (GBS), which can be realized with a photonic quantum computing model, perform some special kind of sampling tasks. In [4], we introduced algorithms that use GBS samples to approximate Gaussian expectation problems.…
Scientists in quantum technology aspire to quantum advantage: a computational result unattainable with classical computers. Gaussian boson sampling experiment has been already claimed to achieve this goal. In this setup squeezed light…
Quantum mechanics offers a fundamentally unpredictable entropy source due to the intrinsic probabilistic nature of quantum measurements, making it attractive for secure random number generation. This paper explores the practicality of…
Boson sampling has emerged as an important tool to demonstrate the difference between quantum and classical computers and has attracted the interest of experimentalists and theoreticians. In this work we study Boson sampling from general,…
The boson sampling problem has triggered a lot of interest in the scientific community because of its potential of demonstrating the computational power of quantum interference without the need of non-linear processes. However, the…
Quantum computers are expected to be more efficient in performing certain computations than any classical machine. Unfortunately, the technological challenges associated with building a full-scale quantum computer have not yet allowed the…
A random number generator is proposed based on a theorem about existence of chaos in fixed point iteration of x= cot2(x). Digital computer simulation of this function iteration exhibits random behavior. A method is proposed to extract…
Quantum advantage, benchmarking the computational power of quantum machines outperforming all classical computers in a specific task, represents a crucial milestone in developing quantum computers and has been driving different physical…
It is predicted that quantum computers will dramatically outperform their conventional counterparts. However, large-scale universal quantum computers are yet to be built. Boson sampling is a rudimentary quantum algorithm tailored to the…
Harnessing quantum processes is an efficient method to generate truly indeterministic random numbers, which are of fundamental importance for cryptographic protocols, security applications or Monte-Carlo simulations. Recently, quantum…
Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics. In general, a physical generator contains two parts---a randomness source and its readout. The source is…
Boson sampling is a sampling task proven to be hard to simulate efficiently using classical computers under plausible assumptions, which makes it an appealing candidate for quantum supremacy. However, due to a large noise rate for near-term…
Boson sampling can simulate physical problems for which classical simulations are inefficient. However, not all problems simulated by boson sampling are classically intractable. We consider a situation in which it is known that the outcome…
Due to the advances in the manufacturing of quantum hardware in the recent years, significant research efforts have been directed towards employing quantum methods to solving problems in various areas of interest. Thus a plethora of novel…
Boson sampling is a problem intractable for classical computers, but can be naturally solved on a specialized photonic quantum simulator which requires less resources than building a universal quantum computer. The biggest challenge to…
We present results of an extensive test program of a group of pseudorandom number generators which are commonly used in the applications of physics, in particular in Monte Carlo simulations. The generators include public domain programs,…