Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEntangling power and quantum circuit complexity
105
0
0.0
(
0
)
Authors
J. Eisert
Ask ChatGPT about the research
No Arabic abstract
Notions of circuit complexity and cost play a key role in quantum computing and simulation where they capture the (weighted) minimal number of gates that is required to implement a unitary. Similar notions also become increasingly prominent in high energy physics in the study of holography. While notions of entanglement have in general little implications for the quantum circuit complexity and the cost of a unitary, in this note, we discuss a simple such relationship when both the entanglement of a state and the cost of a unitary take small values, building on ideas on how values of entangling power of quantum gates add up. This bound implies that if entanglement entropies grow linearly in time, so does the cost. The implications are two-fold: It provides insights into complexity growth for short times. In the context of quantum simulation, it allows to compare digital and analog quantum simulators. The main technical contribution is a continuous-variable small incremental entangling bound.
rate research
Read More
We use Nielsens geometric approach to quantify the circuit complexity in a one-dimensional Kitaev chain across a topological phase transition. We find that the circuit complexities of both the ground states and non-equilibrium steady states of the Kitaev model exhibit non-analytical behaviors at the critical points, and thus can be used to detect both {it equilibrium} and {it dynamical} topological phase transitions. Moreover, we show that the locality property of the real-space optimal Hamiltonian connecting two different ground states depends crucially on whether the two states belong to the same or different phases. This provides a concrete example of classifying different gapped phases using Nielsens circuit complexity. We further generalize our results to a Kitaev chain with long-range pairing, and discuss generalizations to higher dimensions. Our result opens up a new avenue for using circuit complexity as a novel tool to understand quantum many-body systems.
Quantifying quantum states complexity is a key problem in various subfields of science, from quantum computing to black-hole physics. We prove a prominent conjecture by Brown and Susskind about how random quantum circuits complexity increases. Consider constructing a unitary from Haar-random two-qubit quantum gates. Implementing the unitary exactly requires a circuit of some minimal number of gates - the unitarys exact circuit complexity. We prove that this complexity grows linearly in the number of random gates, with unit probability, until saturating after exponentially many random gates. Our proof is surprisingly short, given the established difficulty of lower-bounding the exact circuit complexity. Our strategy combines differential topology and elementary algebraic geometry with an inductive construction of Clifford circuits.
The variational quantum eigensolver (VQE) is one of the most promising algorithms to find eigenvalues and eigenvectors of a given Hamiltonian on noisy intermediate-scale quantum (NISQ) devices. A particular application is to obtain ground or excited states of molecules. The practical realization is currently limited by the complexity of quantum circuits. Here we present a novel approach to reduce quantum circuit complexity in VQE for electronic structure calculations. Our algorithm, called ClusterVQE, splits the initial qubit space into subspaces (qubit clusters) which are further distributed on individual (shallower) quantum circuits. The clusters are obtained based on quantum mutual information reflecting maximal entanglement between qubits, whereas entanglement between different clusters is taken into account via a new dressed Hamiltonian. ClusterVQE therefore allows exact simulation of the problem by using fewer qubits and shallower circuit depth compared to standard VQE at the cost of additional classical resources. In addition, a new gradient measurement method without using an ancillary qubit is also developed in this work. Proof-of-principle demonstrations are presented for several molecular systems based on quantum simulators as well as an IBM quantum device with accompanying error mitigation. The efficiency of the new algorithm is comparable to or even improved over qubit-ADAPT-VQE and iterative Qubit Coupled Cluster (iQCC), state-of-the-art circuit-efficient VQE methods to obtain variational ground state energies of molecules on NISQ hardware. Above all, the new ClusterVQE algorithm simultaneously reduces the number of qubits and circuit depth, making it a potential leader for quantum chemistry simulations on NISQ devices.
The capacity of a quantum gate to produce entangled states on a bipartite system is quantified in terms of the entangling power. This quantity is defined as the average of the linear entropy of entanglement of the states produced after applying a quantum gate over the whole set of separable states. Here we focus on symmetric two-qubit quantum gates, acting on the symmetric two-qubit space, and calculate the entangling power in terms of the appropriate local-invariant. A geometric description of the local equivalence classes of gates is given in terms of the $mathfrak{su}(3)$ Lie algebra root vectors. These vectors define a primitive cell with hexagonal symmetry on a plane, and through the Weyl group the minimum area on the plane containing the whole set of locally equivalent quantum gates is identified. We give conditions to determine when a given quantum gate produces maximally entangled states from separable ones (perfect entanglers). We found that these gates correspond to one fourth of the whole set of locally-distinct quantum gates. The theory developed here is applicable to three-level systems in general, where the non-locality of a quantum gate is related to its capacity to perform non-rigid transformations on the Majorana constellation of a state. The results are illustrated by an anisotropic Heisenberg model, the Lipkin-Meshkov-Glick model, and two coupled quantized oscillators with cross-Kerr interaction.
We derive a bound on the ability of a linear optical network to estimate a linear combination of independent phase shifts by using an arbitrary non-classical but unentangled input state, thereby elucidating the quantum resources required to obtain the Heisenberg limit with a multi-port interferometer. Our bound reveals that while linear networks can generate highly entangled states, they cannot effectively combine quantum resources that are well distributed across multiple modes for the purposes of metrology: in this sense linear networks endowed with well-distributed quantum resources behave classically. Conversely, our bound shows that linear networks can achieve the Heisenberg limit for distributed metrology when the input photons are hoarded in a small number of input modes, and we present an explicit scheme for doing so. Our results also have implications for measures of non-classicality.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
