Related papers: Computing Hypergraph Ramsey Numbers by Using Quant…
The topological recursion of Eynard and Orantin governs a variety of problems in enumerative geometry and mathematical physics. The recursion uses the data of a spectral curve to define an infinite family of multidifferentials. It has been…
A geometrical approach to quantum computation is presented, where a non-abelian connection is introduced in order to rewrite the evolution operator of an energy degenerate system as a holonomic unitary. For a simple geometrical model we…
Representations of quantum computations are almost always based on a tensor product $\otimes$-structure. This coincides with what we are able to execute in our experiments, as well as what we observe in Nature, but it makes certain familiar…
We look at colourings of $r$-uniform hypergraphs, focusing our attention on unique colourability and gaps in the chromatic spectrum. The pattern of an edge $E$ in an $r$-uniform hypergraph $H$ whose vertices are coloured is the partition of…
Recently, it is shown that quantum computers can be used for obtaining certain information about the solution of a linear system Ax=b exponentially faster than what is possible with classical computation. Here we first review some key…
Geometric phases induced in quantum evolutions have built-in noise-resilient characters, and thus can find applications in many robust quantum manipulation tasks. Here, we propose a feasible and fast scheme for universal quantum computation…
The use of quantum computing to solve a problem in quantum mechanics is illustrated, step by step, by calculating energies and transition amplitudes in a nonrelativistic quark model. The quantum computations feature the use of variational…
Entangled multipartite states are resources for universal quantum computation, but they can also give rise to ensembles of unitary transformations, a topic usually studied in the context of random quantum circuits. Using several graph state…
The $k$-colour bipartite Ramsey number of a bipartite graph $H$ is the least integer $n$ for which every $k$-edge-coloured complete bipartite graph $K_{n,n}$ contains a monochromatic copy of $H$. The study of bipartite Ramsey numbers was…
The parametric deformations of quasienergies and eigenvectors of unitary operators are applied to the design of quantum adiabatic algorithms. The conventional, standard adiabatic quantum computation proceeds along eigenenergies of…
The purpose of this survey is to provide a gentle introduction to several recent breakthroughs in graph Ramsey theory. In particular, we will outline the proofs (due to various groups of authors) of exponential improvements to the diagonal,…
The implementation of holonomic quantum computation on superconducting quantum circuits is challenging due to the general requirement of controllable complicated coupling between multilevel systems. Here we solve this problem by proposing a…
Ramsey's theorem, concerning the guarantee of certain monochromatic patterns in large enough edge-coloured complete graphs, is a fundamental result in combinatorial mathematics. In this work, we highlight the connection between this…
We introduce an approach for quantum computing in continuous time based on the Lewis-Riesenfeld dynamic invariants. This approach allows, under certain conditions, for the design of quantum algorithms running on a nonadiabatic regime. We…
The ability to efficiently simulate random quantum circuits using a classical computer is increasingly important for developing Noisy Intermediate-Scale Quantum devices. Here we present a tensor network states based algorithm specifically…
Hybrid variational quantum algorithms are promising for solving practical problems, such as combinatorial optimization, quantum chemistry simulation, quantum machine learning, and quantum error correction on noisy quantum computers.…
In this thesis, I present several results on quantum statistical inference in the following two directions. Firstly, I demonstrate that quantum algorithms can be applied to enhance the computing and training of Gaussian processes (GPs), a…
To implement a set of universal quantum logic gates based on non-Abelian geometric phases, it is a conventional wisdom that quantum systems beyond two levels are required, which is extremely difficult to fulfil for superconducting qubits,…
Estimating a quantum phase is a necessary task in a wide range of fields of quantum science. To accomplish this task, two well-known methods have been developed in distinct contexts, namely, Ramsey interferometry (RI) in atomic and…
Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures…