Related papers: Holonomic quantum computation in subsystems
Entanglement is widely believed to lie at the heart of the advantages offered by a quantum computer. This belief is supported by the discovery that a noiseless (pure) state quantum computer must generate a large amount of entanglement in…
We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…
We present a framework for computing the solution to Hamiltonian eigenproblems in a subspace defined by bit-strings sampled from a quantum computer. Hamiltonians are represented using an extended alphabet that includes projection and ladder…
We show how to realize a general quantum circuit involving gates between arbitrary pairs of qubits by means of geometrically local quantum operations and efficient classical computation. We prove that circuit-level local stochastic noise…
Qubitization is a modern approach to estimate Hamiltonian eigenvalues without simulating its time evolution. While in this way approximation errors are avoided, its resource and gate requirements are more extensive: qubitization requires…
In holonomic quantum computation, quantum logic gates are realized by cyclic parallel transport of the computational space. The resulting quantum gate corresponds to the holonomy associated with the closed path traced by the computational…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
We show how a quantum computer may efficiently simulate a disordered Hamiltonian, by incorporating a pseudo-random number generator directly into the time evolution circuit. This technique is applied to quantum simulation of few-body…
We present an architecture of QCPU(Quantum Central Processing Unit), based on the discrete quantum gate set, that can be programmed to approximate any n-qubit computation in a deterministic fashion. It can be built efficiently to implement…
Holonomies are of great interest to quantum computation and simulation. The geometrical nature of these entities offers increased stability to quantum gates. Furthermore, symmetries of particle physics are naturally reflected in holonomies,…
Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. However, due to the noise and the limited scale of current quantum…
In this thesis, I investigate aspects of local Hamiltonians in quantum computing. First, I focus on the Adiabatic Quantum Computing model, based on evolution with a time dependent Hamiltonian. I show that to succeed using AQC, the…
We propose a natural application of Quantum Linear Systems Problem (QLSP) solvers such as the HHL algorithm to efficiently prepare highly excited interior eigenstates of physical Hamiltonians in a variational and targeted manner. This is…
We explore the implementation of hybridly protected quantum operations combining the merits of holonomy, dynamical decoupling approach and dephasing-free feature based on a simple and experimentally achievable spin model. The implementation…
It is proposed that high-speed universal quantum gates can be realized by using non-Abelian holonomic transformation. A cyclic evolution path which brings the system periodically back to a degenerate qubit subspace is crucial to holonomic…
The use of near-term quantum devices that lack quantum error correction, for addressing quantum chemistry and physics problems, requires hybrid quantum-classical algorithms and techniques. Here we present a process for obtaining the…
State-of-the-art noisy digital quantum computers can only execute short-depth quantum circuits. Variational algorithms are a promising route to unlock the potential of noisy quantum computers since the depth of the corresponding circuits…
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? We provide an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling n-qubit…
We report a first demonstration for the application of quantum computing to heavy quarkonium spectroscopy study. Based on a Cornell-potential model for the heavy quark and antiquark system, we show how this Hamiltonian problem can be…
We present an efficient quantum circuit for block encoding pairing Hamiltonian often studied in nuclear physics. Our block encoding scheme does not require mapping the creation and annihilation operators to the Pauli operators and…