相关论文: An Optimal Product-State Approximation for 2-Local…
Quantum simulation is a promising application of future quantum computers. Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. For an accurate product formula approximation,…
Maximum cut (Max-Cut) problem is one of the most important combinatorial optimization problems because of its various applications in real life, and recently Quantum Approximate Optimization Algorithm (QAOA) has been widely employed to…
Quantum state tomography is an essential tool for the characterization and verification of quantum states. However, as it cannot be directly applied to systems with more than a few qubits, efficient tomography of larger states on mid-sized…
In this article, we investigate the possibility of approximating the physical inner product of constrained quantum theories. In particular, we calculate the physical inner product of a simple cosmological model in two ways: Firstly, we…
We demonstrate that the optimal states in lossy quantum interferometry may be efficiently simulated using low rank matrix product states. We argue that this should be expected in all realistic quantum metrological protocols with…
We present quantum algorithms for solving two problems regarding stochastic processes. The first algorithm prepares the thermal Gibbs state of a quantum system and runs in time almost linear in $\sqrt{N \beta/{\cal Z}}$ and polynomial in…
Quantum entanglement is considered, by and large, to be a very delicate and non-robust phenomenon that is very hard to maintain in the presence of noise, or non-zero temperatures. In recent years however, and motivated, in part, by a quest…
We show that an excellent approximation to the exact quantum solution of the ground state of the Tavis-Cummings model is obtained by means of a semi-classical projected state. This state has an analytical form in terms of the model…
I introduce a modification of continuous matrix product states (CMPS) that makes them adapted to relativistic quantum field theories (QFT). These relativistic CMPS can be used to solve genuine 1+1 dimensional QFT without UV cutoff and…
Recently Raghavendra and Tan (SODA 2012) gave a 0.85-approximation algorithm for the Max Bisection problem. We improve their algorithm to a 0.8776-approximation. As Max Bisection is hard to approximate within $\alpha_{GW} + \epsilon \approx…
Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure…
Consumption of magic states promotes the stabilizer model of computation to universal quantum computation. Here, we propose three different classical algorithms for simulating such universal quantum circuits, and characterize them by…
In this paper, we address the problem of designing a quantum encoder that maximizes the minimum output purity of a given decohering channel, where the minimum is taken over all possible pure inputs. This problem is cast as a max-min…
Calculating the molecular ground-state energy is a central challenge in computational chemistry. Conventional methods such as the Complete Active Space Configuration Interaction scale exponentially with molecular size, limiting their…
Trotter product formulas constitute a cornerstone quantum Hamiltonian simulation technique. However, the efficient implementation of Hamiltonian evolution of nested commutators remains an under explored area. In this work, we construct…
We study the classical compilation of quantum circuits for the preparation of matrix product states (MPS), which are quantum states of low entanglement with an efficient classical description. Our algorithm represents a near-term…
$k$-Uniform states are fundamental to quantum information and computing, with applications in multipartite entanglement and quantum error-correcting codes (QECCs). Prior work has primarily focused on constructing exact $k$-uniform states or…
A number of problems in quantum state and system identification are addressed. Specifically, it is shown that the maximum likelihood estimation (MLE) approach, already known to apply to quantum state tomography, is also applicable to…
We propose a quantum algorithm to obtain the lowest eigenstate of any Hamiltonian simulated by a quantum computer. The proposed algorithm begins with an arbitrary initial state of the simulated system. A finite series of transforms is…
This research explores the integration of the Quantum Approximate Optimization Algorithm (QAOA) into Hybrid Quantum-HPC systems for solving the Max-Cut problem, comparing its performance with classical algorithms like brute-force search and…