Related papers: A Fidelity Susceptibility Approach to Quantum Anne…
Recently discovered measurement-induced entanglement phase transitions in monitored quantum circuits provide a novel example of far-from-equilibrium quantum criticality. Here, we propose a highly efficient strategy for experimentally…
NP-hard optimization problems scale very rapidly with problem size, becoming unsolvable with brute force methods, even with supercomputing resources. Typically, such problems have been approximated with heuristics. However, these methods…
DNA nanocompartment is a typical DNA-based machine whose function is dependent of molecular collective effect. Fundamental properties of the device have been addressed via electrochemical analysis, fluorescent microscopy, and atomic force…
In order to investigate the effects of nonmagnetic impurities in strongly correlated systems, Quantum Monte Carlo (QMC) simulations have been carried out for the doped two-dimensional Hubbard model with one nonmagnetic impurity. Using a…
Fractional quantum Hall (FQH) phases emerge due to strong electronic interactions and are characterized by anyonic quasiparticles, each distinguished by unique topological parameters, fractional charge, and statistics. In contrast, the…
Contemporary scientific studies often rely on the understanding of complex quantum systems via computer simulation. This paper initiates the statistical study of quantum simulation and proposes a Monte Carlo method for estimating…
Quantum annealing is a powerful alternative model for quantum computing, which can succeed in the presence of environmental noise even without error correction. However, despite great effort, no conclusive proof of a quantum speedup…
In this letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This…
Quantum algorithm design usually assumes access to a perfect quantum computer with ideal properties like full connectivity, noise-freedom and arbitrarily long coherence time. In Noisy Intermediate-Scale Quantum (NISQ) devices, however, the…
Quantum annealing is an emerging metaheuristic used for solving combinatorial optimisation problems. However, hardware based physical quantum annealers are primarily limited to a single vendor. As an alternative, we can discretise the…
We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running…
Quantum annealing is a promising technique which leverages quantum mechanics to solve hard optimization problems. Considerable progress has been made in the development of a physical quantum annealer, motivating the study of methods to…
Exponentially small spectral gaps are known to be the crucial bottleneck for traditional Quantum Annealing (QA) based on interpolating between two Hamiltonians, a simple driving term and the complex problem to be solved, with a linear…
A mode coupling calculation which previously explained the Mott gap collapse induced in cuprates by electron doping is applied to the analogous problem of hole doping. A plateau in the q-space susceptibility is found to inhibit the rate of…
Recent work has shown that quantum computers can compute scattering probabilities in massive quantum field theories, with a run time that is polynomial in the number of particles, their energy, and the desired precision. Here we study a…
In a Bayesian setting, inverse problems and uncertainty quantification (UQ) - the propagation of uncertainty through a computational (forward) model - are strongly connected. In the form of conditional expectation the Bayesian update…
The fidelity susceptibility measures sensitivity of eigenstates to a change of an external parameter. It has been fruitfully used to pin down quantum phase transitions when applied to ground states (with extensions to thermal states). Here…
Sampling a diverse set of high-quality solutions for hard optimization problems is of great practical relevance in many scientific disciplines and applications, such as artificial intelligence and operations research. One of the main open…
Quantum annealing is an optimization technique which potentially leverages quantum tunneling to enhance computational performance. Existing quantum annealers use superconducting flux qubits with short coherence times, limited primarily by…
We derive several closed-form expressions for the fidelity susceptibility~(FS) of the anisotropic $XY$ model in the transverse field. The basic idea lies in a partial fraction expansion of the expression so that all the terms are related to…