Related papers: Universal compilation for quantum state preparatio…
Quantum states that are symmetric under particle exchange play a crucial role in fields such as quantum metrology and quantum error correction. We use a variational circuit composed of global one-axis twisting and global rotations to…
Quantum state tomography is an integral part of quantum computation and offers the starting point for the validation of various quantum devices. One of the central tasks in the field of state tomography is to reconstruct with high fidelity,…
Quantum state tomography is a fundamental tool in quantum information processing. It allows us to estimate the state of a quantum system by measuring different observables on many identically prepared copies of the system. This is, in…
Practical applications of quantum computing depend on fault-tolerant devices with error correction. Today, the most promising approach is a class of error-correcting codes called surface codes. We study the problem of compiling quantum…
In this report, we propose a novel quantum diagonalization algorithm based on the optimization of variational quantum circuits. Diagonalizing a quantum state is a fundamental yet computationally challenging task in quantum information…
Effective quantum computation relies upon making good use of the exponential information capacity of a quantum machine. A large barrier to designing quantum algorithms for execution on real quantum machines is that, in general, it is…
Variational quantum algorithms dominate contemporary gate-based quantum enhanced optimisation, eigenvalue estimation and machine learning. Here we establish the quantum computational universality of variational quantum computation by…
Estimation of quantum states and measurements is crucial for the implementation of quantum information protocols. The standard method for each is quantum tomography. However, quantum tomography suffers from systematic errors caused by…
Quantum compiling aims to construct a quantum circuit V by quantum gates drawn from a native gate alphabet, which is functionally equivalent to the target unitary U. It is a crucial stage for the running of quantum algorithms on noisy…
A number of commercially available quantum computers, such as those based on trapped-ion or superconducting qubits, can now perform mid-circuit measurements and resets. In addition to being crucial for quantum error correction, this…
Preparation of quantum state lies at the heart of quantum information processing. The greedy algorithm provides a potential method to effectively prepare quantum states. However, the standard greedy algorithm, in general, cannot take the…
Quantum cooling, a deterministic process that drives any state to the lowest eigenstate, has been widely used from studying ground state properties of chemistry and condensed matter quantum physics, to general optimization problems.…
Quantum state preparation is an important subroutine for quantum computing. We show that any $n$-qubit quantum state can be prepared with a $\Theta(n)$-depth circuit using only single- and two-qubit gates, although with a cost of an…
Quantum graph states are critical resources for various quantum algorithms, and also determine essential interconnections in distributed quantum computing. There are two schemes for generating graph states probabilistic scheme and…
This paper addresses the problem of designing universal quantum circuits to transform $k$ uses of a $d$-dimensional unitary input-operation into a unitary output-operation in a probabilistic heralded manner. Three classes of protocols are…
This paper explores artificial intelligence (AI) methods for the approximate compiling of unitaries, focusing on the use of fixed two-qubit gates and arbitrary single-qubit rotations typical in superconducting hardware. Our approach…
We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear optics, and homodyne detection. For…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
As quantum computing technology advances, the complexity of quantum algorithms increases, necessitating a shift from low-level circuit descriptions to high-level programming paradigms. This paper addresses the challenges of developing a…
Universal fault-tolerant quantum computers will require error-free execution of long sequences of quantum gate operations, which is expected to involve millions of physical qubits. Before the full power of such machines will be available,…