Related papers: Efficient simulatability of continuous-variable ci…
In this study, we propose a new method for constrained combinatorial optimization using variational quantum circuits. Quantum computers are considered to have the potential to solve large combinatorial optimization problems faster than…
Variational quantum algorithms (VQAs) provide a promising approach to achieve quantum advantage in the noisy intermediate-scale quantum era. In this era, quantum computers experience high error rates and quantum error detection and…
We show that in a quantum system evolving unitarily under a stochastic quantum circuit the notions of irreversibility, universality of computation, and entanglement are closely related. As the state evolves from an initial product state, it…
(Abridged.) This thesis investigates scalable fault-tolerant quantum computation through the development of bosonic quantum codes, quantum LDPC codes, and decoding protocols that connect continuous-variable and discrete-variable error…
Computational validation is vital for all large-scale quantum computers. One needs computers that are both fast and accurate. Here we apply precise, scalable, high order statistical tests to data from large Gaussian boson sampling (GBS)…
Due to the unreliability and limited capacity of existing quantum computer prototypes, quantum circuit simulation continues to be a vital tool for validating next generation quantum computers and for studying variational quantum algorithms,…
Hosting non-classical states of light in three-dimensional microwave cavities has emerged as a promising paradigm for continuous-variable quantum information processing. Here we experimentally demonstrate high-fidelity generation of a range…
We extend the Wigner current vector field (Wigner current) construct to single bosonic mode quantum systems interacting with an environment. In terms of the Wigner function quasiprobability density and associated Wigner current, the open…
Quantum algorithms are promising candidates for the enhancement of computational efficiency for a variety of computational tasks, allowing for the numerical study of physical systems intractable to classical computers. In the Noisy…
We present a computational problem with the following properties: (i) Every instance can be solved with near-certainty by a constant-depth quantum circuit using only nearest-neighbor gates in 3D even when its implementation is corrupted by…
Variational quantum algorithms (VQA) are considered as some of the most promising methods to determine the properties of complex strongly correlated quantum many-body systems, especially from the perspective of devices available in the near…
In order for quantum computations to be done as efficiently as possible it is important to optimise the number of gates used in the underlying quantum circuits. In this paper we find that many gate optimisation problems for approximately…
Implementing variational quantum algorithms with noisy intermediate-scale quantum machines of up to a hundred qubits is nowadays considered as one of the most promising routes towards achieving a quantum practical advantage. In multiqubit…
Here we show how universal quantum computers based on the quantum circuit model can handle mathematical analysis calculations for functions with continuous domains, without any digitalization, and with remarkably few qubits. The basic…
We describe a universal scheme of quantum computation by state injection on rebits (states with real density matrices). For this scheme, we establish contextuality and Wigner function negativity as computational resources, extending results…
Quantum computing uses the physical principles of very small systems to develop computing platforms which can solve problems that are intractable on conventional supercomputers. There are challenges not only in building the required…
Random quantum circuits are commonly viewed as hard to simulate classically. In some regimes this has been formally conjectured, and there had been no evidence against the more general possibility that for circuits with uniformly random…
We propose a qubit efficient scheme to study ground state properties of quantum many-body systems on near-term noisy intermediate scale quantum computers. One can obtain a tensor network representation of the ground state using a number of…
Variational quantum circuits (VQCs) have shown great potential in near-term applications. However, the discriminative power of a VQC, in connection to its circuit architecture and depth, is not understood. To unleash the genuine…
The ability to perform classically intractable electronic structure calculations is often cited as one of the principal applications of quantum computing. A great deal of theoretical algorithmic development has been performed in support of…