Related papers: Variational quantum Gibbs state preparation with a…
We consider two related tasks: (a) estimating a parameterisation of a given Gibbs state and expectation values of Lipschitz observables on this state; and (b) learning the expectation values of local observables within a thermal or quantum…
Quantum Annealing (QA) was originally intended for accelerating the solution of combinatorial optimization tasks that have natural encodings as Ising models. However, recent experiments on QA hardware platforms have demonstrated that, in…
In Refs. [Phys. Rev. A 96, 062303 (2017)] and [Sci. China Phys. Mech. Astron. 61, 70311 (2018)], the authors reported an algorithm to simulate, in a circuit-based quantum computer, a general quantum channel (QC). However, the application of…
There has been an extensive development in the use of multi-partite entanglement as a resource for various quantum information processing tasks. In this paper we focus on preparing arbitrary spin eigenstates whose subset contain important…
In Ref. [Phys. Rev. A 100, 062317 (2019)], the authors reported an algorithm to implement, in a circuit-based quantum computer, a general quantum measurement (GQM) of a two-level quantum system, a qubit. Even though their algorithm seems…
$W$ states are quantum correlated states possessing both bipartite and multipartite entanglement, which makes them useful for several quantum algorithms. We propose a protocol to generate these states by exploiting {\it topological ring…
We show how techniques from machine learning and optimization can be used to find circuits of photonic quantum computers that perform a desired transformation between input and output states. In the simplest case of a single input state,…
We study the dissipative preparation of many-body entangled Gaussian states in bosonic lattice models which could be relevant for quantum technology applications. We assume minimal resources, represented by systems described by…
We study the problem of state synthesis in the DQC1 (One Clean Qubit) model of quantum computation, which provides a single pure qubit and $n$ maximally mixed qubits, and after applying any quantum circuit some subset of the qubits are…
Eigenstate preparation is ubiquitous in quantum computing, and a standard approach for generating the lowest-energy states of a given system is by employing adiabatic state preparation (ASP). In the present work, we investigate a…
A central challenge in quantum simulation is to prepare low-energy states of strongly interacting many-body systems. In this work, we study the problem of preparing a quantum state that optimizes a random all-to-all, sparse or dense, spin…
The computational power of real-world quantum computers is limited by errors. When using quantum computers to perform algorithms which cannot be efficiently simulated classically, it is important to quantify the accuracy with which the…
Quantum state preparation initializes the quantum registers and is essential for running quantum algorithms. Designing state preparation circuits that entangle qubits efficiently with fewer two-qubit gates enhances accuracy and alleviates…
In this work, we present a Gibbs state observable estimation algorithm based on Trotter interpolation, which reaches a state-of-the-art quantum computational cost of $ \tilde{O}(\beta \log{1/\epsilon})$. Our approach saves $\log(\Gamma)$…
Generative modeling is a flavor of machine learning with applications ranging from computer vision to chemical design. It is expected to be one of the techniques most suited to take advantage of the additional resources provided by…
As established in the seminal work by Berry et al.[1], expanding the time evolution operator using truncated Taylor series (up to some order $K$) makes a good candidate for simulating Hamiltonian dynamics. Here, we adapt the method but…
We use Pauli Path simulation to variationally obtain parametrized circuits for preparing ground states of various quantum many-body Hamiltonians. These include the quantum Ising model in one dimension, in two dimensions on square and…
A simple method is proposed to prepare conveniently the effective pure state |00...0><0...00| with any number of qubits in a quantum ensemble. The preparation is based on the temporal averaging (Knill, Chuang, and Laflamme, Phys.Rev.A 57,…
We propose a general-purpose quantum algorithm for preparing ground states of quantum Hamiltonians from a given trial state. The algorithm is based on techniques recently developed in the context of solving the quantum linear systems…
In the field of fault-tolerant quantum computing, continuous-variable systems can be utilized to protect quantum information from noise through the use of bosonic codes. These codes map qubit-type quantum information onto the larger bosonic…