相关论文: Circuit Complexity through phase transitions: cons…

One of the goals in quantum simulation is to adiabatically generate the ground state of a complicated Hamiltonian by starting with the ground state of a simple Hamiltonian and slowly evolving the system to the complicated one. If the…

Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum…

Adiabatic quantum computing enables the preparation of many-body ground states. This is key for applications in chemistry, materials science, and beyond. Realisation poses major experimental challenges: Direct analog implementation requires…

The preparation of quantum states serves as a pivotal subroutine across various domains, including quantum communication protocols, quantum computing, and the exploration of quantum correlations and other resources within physical systems.…

An extension to computational mechanics complexity measure is proposed in order to tackle quantum states complexity quantification. The method is applicable to any $n-$partite state of qudits through some simple modifications. A Werner…

Quantum complexity measures the difficulty of obtaining a given state starting from a typically unentangled state. In this work, we show that complexity, when defined through the minimization of a Riemannian cost functional over the…

Variational quantum algorithms (VQAs) face an inherent trade-off between expressivity and trainability: deeper circuits can represent richer states but suffer from noise accumulation and barren plateaus, while shallow circuits remain…

Quantum circuit complexity-a measure of the minimum number of gates needed to implement a given unitary transformation-is a fundamental concept in quantum computation, with widespread applications ranging from determining the running time…

Preparation of a target quantum many-body state on quantum simulators is one of the significant steps in quantum science and technology. With a small number of qubits, a few quantum states, such as the Greenberger-Horne-Zeilinger state,…

State preparation is a process encoding the classical data into the quantum systems. Based on quantum phase estimation, we propose the specific quantum circuits for a deterministic state preparation algorithm and a probabilistic state…

In this work, we investigate the relation between different notions of quantum complexity, namely, circuit and spread complexity and physically meaningful quantities such as the particle content of the quantum state and the variances of…

Certain quantum many-body ground states can be prepared by a large-depth quantum circuit consisting of geometrically local gates. In the presence of noise, local expectation values deviate from the correct value at most by an amount…

We analyze the complexity of synthesizing random states and unitary operators in a multi-qudit system in two paradigms. In one case, we consider the situation in which we manipulate the system by applying a sequence of one- and two-qudit…

Quantum computation can proceed solely through single-qubit measurements on an appropriate quantum state, such as the ground state of an interacting many-body system. We investigate a simple spin-lattice system based on the cluster-state…

We initiate the study of state complexity for continuous-variable quantum systems. Concretely, we consider a setup with bosonic modes and auxiliary qubits, where available operations include Gaussian one- and two-mode operations, single-…

We determine the complexity of several constraint satisfaction problems using the quantum adiabatic algorithm in its simplest implementation. We do so by studying the size dependence of the gap to the first excited state of "typical"…

The preparation of ground states of spin systems is a fundamental operation in quantum computing and serves as the basis of adiabatic quantum computing. This form of quantum computation is subject to the adiabatic theorem which in turn…

Quantum state preparation is an important class of quantum algorithms that is employed as a black-box subroutine in many algorithms, or used by itself to generate arbitrary probability distributions. We present a novel state preparation…

Using the adiabatic perturbation theory of driven dynamics [Phys. Rev. A 78, 052508 (2008)] we design a hierarchy of quantum state preparation protocols that systematically increase the fidelity at very long driving times. We test these and…

Preparing algebraically correlated ground states of quantum many-body systems is an important, yet challenging task for quantum simulation. We introduce a protocol that employs local projective measurements and unitary feedback for…