Related papers: Analysis of a Programmable Quantum Annealer as a R…
Quantum random number generation is a technique to generate random numbers by extracting randomness from specific quantum processes. As for practical random number generators, they are required not only to have no information leakage but…
The majority of Quantum Random Number Generators (QRNG) are designed as converters of a continuous quantum random variable into a discrete classical random bit value. For the resulting random bit sequence to be minimally biased, the…
In this work we investigate the capabilities of a hybrid quantum-classical procedure to explore the solution space using the D-Wave $2000Q^{TM}$ Quantum Annealer device. Here we study the ability of the Quantum hardware to solve the Number…
We investigate the performance of penalty-based quantum annealing (PQA) and constrained quantum annealing (CQA) in solving the graph partitioning problem under various noise models, including depolarizing, bit-flip, and phase-flip noise. We…
In this dissertation, we explore how quantum annealing (QA) and its applications behave in an open system setting. We give derivations and numerical recipes for effective parallel simulation methods for time-dependent open dynamics of…
Quantum annealing is an emerging metaheuristic used for solving combinatorial optimisation problems. However, hardware based physical quantum annealers are primarily limited to a single vendor. As an alternative, we can discretise the…
Noisy intermediate-scale quantum (NISQ) devices are spearheading the second quantum revolution. Of these, quantum annealers are the only ones currently offering real world, commercial applications on as many as 5000 qubits. The size of…
Random numbers are an essential resource to many applications, including cryptography and Monte Carlo simulations. Quantum random number generators (QRNGs) represent the ultimate source of randomness, as the numbers are obtained by sampling…
Quantum annealing (QA) and Quantum Alternating Operator Ansatz (QAOA) are both heuristic quantum algorithms intended for sampling optimal solutions of combinatorial optimization problems. In this article we implement a rigorous direct…
The development and spread of entanglement in complex quantum systems is central to exploring many-body phenomena out of equilibrium. Measuring entanglement dynamics can shed light on information scrambling and thermalisation, namely on…
Random Number Generators are critical components of modern cryptosystems. Quantum Random Number Generators (QRNG) have emerged to provide high-quality randomness for these applications. Here we describe a scheme to extract random numbers…
Quantum annealing is an optimization technique which potentially leverages quantum tunneling to enhance computational performance. Existing quantum annealers use superconducting flux qubits with short coherence times, limited primarily by…
Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or QUBO (quadratic unconstrained binary optimization) form. Although such solutions are…
A quantum random number generator (QRNG) based on gated single photon detection of an InGaAs photodiode at GHz frequency is demonstrated. Owing to the extremely long coherence time of each photon, each photons' wavefuntion extends over many…
Quantum computers promise to enhance machine learning for practical applications. Quantum machine learning for real-world data has to handle extensive amounts of high-dimensional data. However, conventional methods for measuring quantum…
Applications of randomness such as private key generation and public randomness beacons require small blocks of certified random bits on demand. Device-independent quantum random number generators can produce such random bits, but existing…
We introduce the reinforcement quantum annealing (RQA) scheme in which an intelligent agent interacts with a quantum annealer that plays the stochastic environment role of learning automata and tries to iteratively find better Ising…
Quantum annealing promises to solve complex combinatorial optimization problems faster than current transistor-based computer technologies. Although to date only one commercially-available quantum annealer is procurable, one can already…
Even if the output of a Random Number Generator (RNG) is perfectly uniformly distributed, it may be correlated to pre-existing information and therefore be predictable. Statistical tests are thus not sufficient to guarantee that an RNG is…
Random numbers are a fundamental resource in science and engineering with important applications in simulation and cryptography. The inherent randomness at the core of quantum mechanics makes quantum systems a perfect source of entropy.…