Related papers: Random Quantum Circuits and Pseudo-Random Operator…
We consider experimentally feasible chains of trapped ions with pseudo-spin 1/2, and find models that can potentially be used to implement error-resistant quantum computation. Similar in spirit to classical neural networks, the…
The present era of quantum processors with hundreds to thousands of noisy qubits has sparked interest in understanding the computational power of these devices and how to leverage it to solve practically relevant problems. For applications…
Quantum simulation is a promising pathway toward practical quantum advantage by simulating large-scale quantum systems. In this work, we propose communication-efficient distributed quantum simulation protocols by exploring three quantum…
Random numbers are a basic ingredient of simulation algorithms and cryptography, and play a significant part in computer simulation and information processing. One prominent feature of a squeezed light is its lower fluctuation and more…
We present the solid-state quantum circuits that have been developed in order to implement quantum bits suitable for a quantum processor. These qubits are either based on the quantum state of a single particle (semiconductor qubits), or on…
Random unitaries are a central object of study in quantum information, with applications to quantum computation, quantum many-body physics, and quantum cryptography. Recent work has constructed unitary designs and pseudorandom unitaries…
Quantum simulation is of great importance in quantum information science. Here, we report an experimental quantum channel simulator imbued with an algorithm for imitating the behavior of a general class of quantum systems. The reported…
This work considers the deployment of pseudo-random number generators (PRNGs) on graphics processing units (GPUs), developing an approach based on the xorgens generator to rapidly produce pseudo-random numbers of high statistical quality.…
We study the entanglement generation of operators whose statistical properties approach those of random matrices but are restricted in some way. These include interpolating ensemble matrices, where the interval of the independent random…
Random many-body states are both a useful tool to model certain physical systems and an important asset for quantum computation. Realising them, however, generally requires an exponential (in system size) amount of resources. Recent…
The fundamental principles of quantum mechanics, such as its probabilistic nature, allow for the theoretical ability of quantum computers to generate statistically random numbers, as opposed to classical computers which are only able to…
We consider the problem of estimating quantum observables on a collection of qubits, given as a linear combination of Pauli operators, with shallow quantum circuits consisting of single-qubit rotations. We introduce estimators based on…
Quantum circuits -- built from local unitary gates and local measurements -- are a new playground for quantum many-body physics and a tractable setting to explore universal collective phenomena far-from-equilibrium. These models have shed…
Efficiently characterizing large quantum states and processes is a central yet notoriously challenging task in quantum information science, as conventional tomography methods typically require resources that grow exponentially with system…
Probabilistic graphical models such as Bayesian networks are widely used to model stochastic systems to perform various types of analysis such as probabilistic prediction, risk analysis, and system health monitoring, which can become…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…
Simulating quantum mechanics is known to be a difficult computational problem, especially when dealing with large systems. However, this difficulty may be overcome by using some controllable quantum system to study another less controllable…
Random Numbers determine the security level of cryptographic applications as they are used to generate padding schemes in the encryption/decryption process as well as used to generate cryptographic keys. This paper utilizes the QKD to…
Randomized protocols are procedures that incorporate probabilistic choices during their execution and they play a central role in quantum algorithms, spanning Hamiltonian simulation, noise mitigation, and measurement tasks. In practical…
It is an ongoing quest to realize topologically ordered quantum states on different platforms including condensed matter systems, quantum simulators and digital quantum processors. Unlike conventional states characterized by their local…