Related papers: Quantum pseudo-randomness from cluster-state quant…
We consider the problem of efficiently simulating random quantum states and random unitary operators, in a manner which is convincing to unbounded adversaries with black-box oracle access. This problem has previously only been considered…
Quantum circuits generating probability distributions has applications in several areas. Areas like finance require quantum circuits that can generate distributions that mimic some given data pattern. Hamiltonian simulations require…
Simulating quantum circuits (QC) on high-performance computing (HPC) systems has become an essential method to benchmark algorithms and probe the potential of large-scale quantum computation despite the limitations of current quantum…
This article focuses on the development of scalable and quantum bit-efficient algorithms for computing power functions of random quantum states. Two algorithms, based on Hadamard testing and Gate Set Tomography, are proposed. We provide a…
We provide a new quantum algorithm that efficiently determines the quality of a least-squares fit over an exponentially large data set by building upon an algorithm for solving systems of linear equations efficiently (Harrow et al., Phys.…
High-quality random samples of quantum states are needed for a variety of tasks in quantum information and quantum computation. Searching the high-dimensional quantum state space for a global maximum of an objective function with many local…
In this work we consider a novel heuristic decomposition algorithm for $n$-qubit gates that implement specified amplitude permutations on sparse states with $m$ non-zero amplitudes. These gates can be useful as an algorithmic primitive for…
Feasible tomography schemes for large particle numbers must possess, besides an appropriate data acquisition protocol, also an efficient way to reconstruct the density operator from the observed finite data set. Since state reconstruction…
We study quantum maps displaying spectral statistics intermediate between Poisson and Wigner-Dyson. It is shown that they can be simulated on a quantum computer with a small number of gates, and efficiently yield information about fidelity…
Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate sequence (with speedup over classical cost…
Quantum data loading plays a central role in quantum algorithms and quantum information processing. Many quantum algorithms hinge on the ability to prepare arbitrary superposition states as a subroutine, with claims of exponential speedups…
Mid-circuit measurements and measurement-controlled gates are supported by an increasing number of quantum hardware platforms and will become more relevant as an essential building block for quantum error correction. However, mid-circuit…
We propose to construct large quantum graph codes by means of superconducting circuits working at the ultrastrong coupling regime. In this physical scenario, we are able to create a cluster state between any pair of qubits within a fraction…
When preparing a pure state with a quantum circuit, there is an unavoidable approximation error due to the compilation error in fault-tolerant implementation. A recently proposed approach called probabilistic state synthesis, where the…
This work introduces optimization strategies to continuous variable measurement based quantum computation (MBQC) at different levels. We provide a recipe for mitigating the effects of finite squeezing, which affect the production of cluster…
Interconnecting clusters of qubits will be an essential element of scaling up future quantum computers. Operations between quantum processing units (QPUs) are usually significantly slower and costlier than those within a single QPU, so…
Quantum states can in a sense be thought of as generalizations of classical probability distributions, but are more powerful than probability distributions when used for computation or communication. Quantum speedup therefore requires some…
A novel scheme is presented for fault-tolerant quantum computation based on the cluster model. Some relevant logical cluster states are constructed in concatenation by post-selection through verification, without necessity of recovery…
We propose a deterministic scheme of generating genuine multiparty entangled states in quantum networks of arbitrary size having various geometric structures -- we refer to it as entanglement circulation. The procedure involves optimization…
We propose a new architecture for the measurement-based quantum computation model. The new design relies on small composite light-atom primary clusters. These are then assembled into cluster arrays using ancillary light modes and the actual…