Related papers: Simple Diagonal State Designs with Reconfigurable …
Measurement-based quantum computing offers a promising route towards scalable, universal photonic quantum computation. This approach relies on the deterministic and efficient generation of photonic graph states in which many photons are…
Quantum process tomography conventionally uses a multitude of initial quantum states and then performs state tomography on the process output. Here we propose and study an alternative approach which requires only a single (or few) known…
Continuous-variable quantum information processing through quantum optics offers a promising platform for building the next generation of scalable fault-tolerant information processors. To achieve quantum computational advantages and fault…
We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The…
Quantum computers have the potential to solve important problems which are fundamentally intractable on a classical computer. The underlying physics of quantum computing platforms supports using multi-valued logic, which promises a boost in…
We develop a resonance theory to describe the evolution of open systems with time-dependent dynamics. Our approach is based on piecewise constant Hamiltonians: we represent the evolution on each constant bit using a recently developed…
The class of two-qubit Bell-diagonal states has been the workhorse for developing understanding about the geometry, dynamics, and applications of quantum resources. In this article, we present a quantum circuit for preparing Bell-diagonal…
Randomness is an essential tool in many disciplines of modern sciences, such as cryptography, black hole physics, random matrix theory and Monte Carlo sampling. In quantum systems, random operations can be obtained via random circuits…
We propose a novel method to sequentially optimize arbitrary single-qubit gates in parameterized quantum circuits for simulating real and imaginary time evolution. The method utilizes full degrees of freedom of single-qubit gates and…
Two-dimensional systems with time-dependent controls admit a quadratic Hamiltonian modelling near potential minima. Independent, dynamical normal modes facilitate inverse Hamiltonian engineering to control the system dynamics, but some…
A key goal of digital quantum computing is the simulation of fermionic systems such as molecules or the Hubbard model. Unfortunately, for present and near-future quantum computers the use of quantum error correction schemes is still out of…
The preparation of the ground state of a Hamiltonian $H$ with a large spectral radius has applications in many areas such as electronic structure theory and quantum field theory. Given an initial state with a constant overlap with the…
We propose a simple but versatile protocol to engineer time-dependent Hamiltonians inversely for geometric quantum computation. By utilizing SU(2) transformation, a speedup goal on gate operation is achieved with more freedom to design the…
We show that quantum nondemolition (QND) measurements can be used to realize measurement-based imaginary time evolution. In our proposed scheme, repeated weak QND measurements are used to estimate the energy of a given Hamiltonian. Based on…
This work focuses on optimizing the gates of a quantum circuit with a given topology to approximate the unitary time evolution governed by a Hamiltonian. Recognizing that unitary matrices form a mathematical manifold, we employ Riemannian…
Classical hardness-of-sampling results are largely established for random quantum circuits, whereas analog simulators natively realize time evolutions under geometrically local Hamiltonians. Does a typical such Hamiltonian already yield…
High-dimensional quantum systems can offer extended possibilities and multiple advantages while developing advanced quantum technologies. In this paper, we propose a class of quantum-walk architecture networks that admit the efficient…
Quantum computing is a hotspot technology for its potential to accelerate specific applications by exploiting quantum parallelism. However, current physical quantum computers are limited to a relatively small scale, simulators based on…
We propose a practical strategy for choosing sets of input coherent states that are near-optimal for reconstructing single-mode Gaussian quantum processes with output-state heterodyne measurements. We first derive analytical expressions for…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…