Universal Variational Quantum Computation

Variational quantum algorithms dominate contemporary gate-based quantum enhanced optimisation, eigenvalue estimation and machine learning. Here we establish the quantum computational universality of variational quantum computation by developing two objective functions which minimise to prepare outputs of arbitrary quantum circuits. The fleeting resource of variational quantum computation is the number of expected values which must be iteratively minimised using classical-to-quantum outer loop optimisation. An efficient solution to this optimisation problem is given by the quantum circuit being simulated itself. The first construction is efficient in the number of expected values for $n$-qubit circuits containing $\mathcal{O}({poly} \ln n)$ non-Clifford gates -- the number of expected values has no dependence on Clifford gates appearing in the simulated circuit. The second approach yields $\mathcal{O}(L^2)$ expected values while introducing not more than $\mathcal{O}(\ln L)$ slack qubits, for a quantum circuit partitioned into $L$ gates. Hence, the utilitarian variational quantum programming procedure -- based on the classical evaluation of objective functions and iterated feedback -- is in principle as powerful as any other model of quantum computation. This result elevates the formal standing of the variational approach while establishing a new universal model of quantum computation.

Variational quantum algorithms reduce quantum state preparation requirements while necessitating measurements of individual qubits in the computational basis [14,28]. In the contemporary noisy intermediate-scale quantum (NISQ) enhanced technology setting [29], a sought reduction in coherence time is mediated through an iterative classical-to-quantum feedback and optimization process. Systematic errors which map to deterministic yet unknown control parameters-such as timevariability in the application of specific Hamiltonians or poor pulse timing-can have less impact on variational algorithms, as states are prepared iteratively and varied over to minimize objective function(s). These experimental advantages have made the variational approach to quantum computation the most widely studied gatebased approach today. See the reviews [3,16,26].
A variational quantum algorithm executes to prepare a state which minimizes an objective function. In the case of variational quantum approximate optimization (QAOA [14]), a state is prepared by alternating a Hamiltonian representing a penalty function (such as the NPhard Ising embedding of 3-SAT) with a Hamiltonian representing local tunneling terms. The state is measured and the resulting bit string serves as a candidate solution to minimize the penalty function. In the case of variational eigenvalue minimization (VQE [28]), the state is repeatedly prepared and measured to obtain a set of expected values which is term-wise calculated and collectively minimized. In both approaches, the minimization process is iterated by updating Hamiltonian application times and/or gate angles. Several techniques in variational quantum computation are closely related to methods appearing in machine learning [6,33] in which a quantum circuit is tuned subject to a given training dataset. * j.biamonte@skoltech.ru; http://quantum.skoltech.ru Computational universality is a property of central study in both classical and quantum models of computation. Universal models such as adiabatic quantum computation [1] both discrete and continuous quantum walks [11,23] and measurement based quantum computation [32] have been proved computationally universal through constructions to emulate a universal set of quantum gates. This implies directly that the system has access to any polynomial time quantum algorithm on nqubits (the power of quantum algorithms in the class BQP).
An alternative notion of universality also exists in the literature. This strong notion is algebraic, wherein a system is called universal if its generating Lie algebra is proven to span su(2 n ) for n qubits. We call this controllability.
Evidently these two notions of universality can be interrelated: by proving that a controllable system can efficiently simulate a universal gate set, a controllable system becomes computationally universal. It is conversely anticipated by the strong Church-Turing-Deutsch principle [13], that a computationally universal system can be made to simulate any controllable system.
Herein we assume access to control sequences which can create quantum gates such as [4,5,30]. Given a quantum circuit of L gates, preparing a state |ψ = L l=1 U l |0 ⊗n for unitary gates U l , we construct a universal objective function that is minimised by |ψ . The objective function is engineered to have certain desirable properties. Importantly, we construct a gaped Hamiltonian where minimisation past some fixed tolerance ensures sufficient overlap with the desired output state |ψ .
Recent work of interest by Lloyd considered the controllability of QAOA sequences to create quantum gates [22]. The original goal of QAOA was to alternate targetand driver-Hamiltonians to evolve a system close to the target Hamiltonian's ground state-thereby solving an optimization problem instance. Lloyd showed that al-ternating driver and target Hamiltonians can be programmed to give computationally universal dynamics [22]. Following Lloyd's work [22], myself with two coauthors formulated Lloyd's QAOA controllability result past one-dimensional lines of qubits [27].
We assume controllable state preparation followed by local Pauli measurements. These measurements are used to calculate an objective function (a Hamiltonian) which we prove minimizes to certify that the output of a target quantum circuit has been prepared. The objective function is expressed as a sum of terms in the Pauli basis. Each term corresponds to a simplistic measurement operator and hence this approach avoids the long sequences of gates used to simulate Hamiltonian's in the gate model. While the objective function can be evaluated term-wise, achieving tolerance ∼ requires ∼ −2 measurementssee Hoeffding's inequality [17]).
Structure. After introducing variational quantum computation as it applies to our setting, we construct an objective function (named a telescoping construction). The number of expected values has no dependence on Clifford gates appearing in the simulated circuit and is efficient for circuits with O(poly ln n) non-Clifford gates, making it amenable for near term demonstrations. We then modify the Feynman-Kitaev clock construction and prove that universal variational quantum computation is possible by minimising O(L 2 ) expected values while introducing not more than O(ln L) slack qubits, for a quantum circuit partitioned into L Hermitian blocks.
We conclude by considering how the universal model of variational quantum computation can be utilised in practice. In particular, the given gate sequence prepares a state which will minimise the objective function. In practice, we think of this as providing a starting point for a classical optimizer. Given a T gate sequence, we consider the first L ≤ T gates. This L gate circuit represents an optimal control problem where the starting point is the control sequence to prepare the L gates. The goal is to modify this control sequence (shorten it) using a variational feedback loop. One would iterate this scenario, increasing L up to T .

I. VARIATIONAL QUANTUM COMPUTATION
We work in the standard setting of quantum computation using n qubits, where we typically fix the computational basis B ⊗n and use the standard qubit representation of the Pauli group-algebra, satisfying the product identity XY = ıZ, together with X 2 = Y 2 = Z 2 = 1 1. We will interchange the notation σ 0 ≡ 1 1, σ 1 ≡ X, σ 2 ≡ Y , σ 3 ≡ Z and consider Hamiltonian's H = H † which act on the space of linear qubit maps L(B ⊗n ).
We wish to simulate the output of an L gate quantum circuit acting on the n-qubit product state |0 ⊗n . We have access to p appropriately bounded and tunable parameters to prepare and vary over a family of quantum states. All coefficients herein are assumed to be accurate to not more than poly(n) decimal places. We will define an objective function that when minimized will produce a state close to the desired quantum circuit output. We will provide a solution to the minimization problem. Establishing our results requires several definitions and supporting lemmas. Proofs not appearing after a Lemma or Theorem can be found in the Supplementary Materials.
Definition 1 (Variational Statespace) The variational statespace Γ of a p-parameterized n-qubit state preparation process is the union of |ψ(θ) over real assignments of θ, Variational statespace examples include preparing |ψ(θ) by a fixed quantum circuit (called ansatz) with e.g. θ ∈ [0, 2π) ×p tunable parameters as where typically U l is adjusted by θ l for l = 1 to p, though some gates might be fixed. There are various approaches to implement ansatz circuits, including the Hardware Efficient Ansatz [18] which implements a daisy chain of two-body coupling gates or the brick layer (a.k.a. checkerboard) ansatz which is simply alternating stacks of nearest neighboring coupling gates (see for example [31]).
Definition 2 (Variational Sequence) A variational sequence is an assignment of θ to prepare a single state in a variational statespace |ψ(θ ) ∈ Γ.
Examples of variational sequences include the general expression of a fixed quantum gate sequence acting on a product state, which can be expressed as (2).
We will define an objective function that can be efficiently calculated given access to a suitable quantum processor. Minimization of this objective function will be proven to produce a close 2-norm approximation to the output of a given quantum circuit. Let us consider the most suitably general Hamiltonian acting on qubits (3). where Greek letters index Pauli matrices, Roman letters index qubits and the sum is over a poly(n) bounded subset of the 4 n elements in the basis. The tensor (⊗) is omitted in (3).
We are concerned primarily with Hamiltonians where J a1a2...an α1α2...αn is given and known to be non-vanishing for at most some poly(n) terms. This wide class includes Hamiltonians representing electronic structure [18]. More generally, such Hamiltonians are of bounded cardinality.

Definition 4 (Cardinality)
The number of terms in the Pauli basis {1 1, X, Y, Z} ⊗n needed to express an objective function.
Definition 5 (Bounded Objective Function) An instance is called bounded when it is taken from a uniform family of objective functions of cardinality bounded by poly(n).
We will now use the Cartesian tensor (×) as states need not be proximally interacting and can be independently prepared. Hence, |φ ×O(poly(n)) means we prepare polynomial many non-interacting copies of |φ to approximate each expected value.
is called poly-computable provided poly(n) independent physical copies of |φ can be efficiently prepared to evaluate a bounded objective function.

Efficiently computable objective function examples include calculating the expected value of O(ln n) products and sums over
{H, H , ·, +, R} for bounded cardinality H. Examples include: (2.i) Calculating the expected value of H itself, which includes electronic structure Hamiltonians [28].
(2.ii) Calculating the dispersion var(H) = H 2 − H 2 which vanishes if and only if the prepared state is an eigenstate of H [19].
Acceptance (as follows) must be shown by providing a solution to the optimisation problem defined by the objective function.
Definition 7 (Accepting a Quantum State) An objective function f accepts |φ when given O(poly n) copies of |φ , evaluates strictly less than a chosen real parameter ∆ > 0.
The following theorem (1) applies rather generally to variational quantum algorithms that minimise energy by adjusting a variational state to cause an objective function to accept. Herein acceptance will imply the preparation of a quantum state, which begs to establish the following.
Lemma 1 (Variational Stability) Let non-negative H = H † ∈ L(C d ) have spectral gap ∆ and non-degenerate ground eigenvector |ψ of eigenvalue 0. Consider then a unit vector |φ ∈ C d such that it follows that A. Maximizing projection onto a circuit We will now explicitly construct an elementary Hermitian penalty function that is non-negative, with a nondegenerate lowest (0) eigenstate-so as to apply Lemma 1. Minimisation of this penalty function prepares the output of a quantum circuit.
Theorem 1 (Telescoping Construction) Consider l U l |0 ⊗n an L-gate quantum circuit preparing state |ψ on n-qubits and containing not more than O(poly(ln n)) non-Clifford gates. Then there exists a Hamiltonian H ≥ 0 on n-qubits with poly(L, n) cardinality, a (L, n)-independent gap ∆ and non-degenerate ground eigenvector ∈ span{ l U l |0 ⊗n }.
To prove Theorem 1 we first show existence of the penalty function. Construct Hermitian H ∈ L(C ⊗n 2 ) with H ≥ 0 such that there exists a non-degenerate |ψ ∈ C ⊗n 2 with the property that H|ψ = 0. Define P φ as a sum of projectors onto product states, i.e.
and consider (9) as the initial Hamiltonian, preparing state |0 ⊗n . We will act on (9) with a sequence of gates L l=1 U l corresponding to the circuit being simulated as which preserves the spectrum (i.e. P φ |x = |x| 1 |x for x ∈ {0, 1} n and | · | 1 the Hamming weight). From the properties of P φ it hence follows that h(k) is non-negative and non-degenerate ∀k ≤ L. We now consider the action of the gates (10) on (9). At k = 0 from (9) there are n expected values to be minimized plus a global energy shift that will play a multiplicative role as the circuit depth increases. To consider k = 1 we first expand a universal gate set expressed in the linear extension of the Pauli basis.
Interestingly, the coefficients J ab...c αβ...γ of the gates will not serve as direct input(s) to the quantum hardware; these coefficients play a direct role in the classical step where the coefficients weight the sum to be minimized. Let us then consider single qubit gates, in general form viz., where a is a unit vector and a.σ = 3 i=1 a i σ i . So each single qubit gate increases the number of expected values by a factor of at most 4 2 . At first glance, this appears prohibitive yet there are two factors to consider. The first is the following Lemma (2).
Lemma 2 (Clifford Gate Cardinality Invariance) Let C be the set of all Clifford circuits on n qubits, and let P be the set of all elements of the Pauli group on n qubits. Let C ∈ C and P ∈ P then it can be shown that CP C † ∈ P or in other words and so Clifford circuits act by conjugation on tensor products of Pauli operators to produce tensor products of Pauli operators.
For some U a Clifford gate, Lemma 2 shows that the cardinality of (10) is invariant. Non-Clifford gates increase the cardinality by factors O(e n ) and so must be logarithmically bounded from above. Hence, telescopes bound the number of expected values by restricting to circuit's with k ∼ O(poly ln n) non-Clifford single qubit gates. Clifford gates do however modify the locality of terms appearing in the expected values-this is i.e. prohibitive in adiabatic quantum computation yet arises here as local measurements.
A final argument supporting the utility of telescopes is that the initial state is restricted primarily by the initial Hamiltonian having only a polynomial number of nonvanishing coefficients in the Pauli basis. In practiceusing today's hardware-it should be possible to prepare an -close 2-norm approximation to any product state n k=1 cos θ k |0 + e ıφ k sin θ k |1 which is realised by modifying the projectors in (9) with a product of single qubit maps n k=1 U k . Other more complicated states would also be possible.
To finish the proof of Lemma 1, the variational sequence is given by the description of the gate sequence itself. That is, is minimized for x the string of zeros in {0, 1} n . Hence a state can be prepared causing the Hamiltonian to accept and stability applies (Lemma 1).
To explore telescopes in practice, let us then explicitly consider the quantum algorithm for state overlap (a.k.a., swap test see e.g. [12]). This algorithm has an analogous structure to phase estimation, a universal quantum primitive of error-corrected quantum algorithms.
Example 1 We are given two d-qubit states |ρ and |τ which will be non-degenerate and minimal eigenvalue states of some initial Hamiltonian(s) on n + 1 qubits h(0)|+, ρ, τ = 0 (13) corresponding to the minimization of poly(n/2) + 1 expected values where the first qubit (superscript 1 below) adds one term and is measured in the X-basis. The controlled swap gate takes the form where m = (i, j) indexes a qubit pair and the exchange operator of a pair of qubit states is S = 1 1 + σ.σ. For the case of d = 1 we arrive at the simplest (3-qubit) experimental demonstration. At the minimum (= 0), the expected value of the first qubit being in logical zero is The final Hadamard gate on the control qubit is considered in the measurement step.
Telescopes provide some handle on what we can do without adding additional slack qubits yet fail to directly prove universality in their own right. The crux lies in the fact that we are only allowed some polynomial in ln n non-Clifford gates (which opens an avenue for classical simulation, see [9,10]). Interestingly however, we considered the initial Hamiltonian in (9) as a specific sum over projectors. We instead could bound the cardinality by some polynomial in n. Such a construction will now be established: requires the addition of slack qubits. The universal construction then follows.

B. Maximizing projection onto the history state
We will now prove the following theorem (2) which establishes universality of the variational model of quantum computation.
Theorem 2 Consider a quantum circuit of L gates on n-qubits producing state l U l |0 ⊗n . Then there exists an objective function (Hamiltonian, H) with nondegenerate ground state, cardinality O(L 2 ) and spectral gap ∆ ≥ O(L −2 ) acting on n + O(ln L) qubits such that acceptance implies efficient preparation of the state l U l |0 ⊗n . Moreover, a variational sequence exists causing the objective function to accept.
To construct an objective function satisfying Theorem 2, we modify the Feynman-Kitaev clock construction [15,20]. Coincidentally (and tangential to our objectives here), this construction is also used in certain definitions of the complexity class quantum-Merlin-Arthur (QMA), the quantum analog of NP, through the QMA-complete problem k-local Hamiltonian [20].
Feynman developed a time-independent Hamiltonian that induces unitary dynamics to simulate a sequence of gates [15]. Consider Feynman's Hamiltonians: where the Hamiltonian (15) acts on a clock register (right of ⊗) with orthogonal clock states 0 to L and an initial state |ξ (left). Observation of the clock in state |L after some time s = s produces The Hamiltonian H prop in (15) can be modified as (17) so as to have the history state (18) as its ground state where H t is a projector. Then H prop = L t=1 H t has the history state as its ground state as for any input state |ξ where 0 = ψ hist |H prop |ψ hist . This forms the building blocks of our objective function. We will hence establish Theorem 2 by a series of lemma. We let P 0 def = |0 0|.

Lemma 3 (Degeneracy Lifting)
Adding the tensor product of a projector on the first clock qubit with a telescope lifts the degeneracy of the ground space of H prop and the history state with fixed input as is the non-degenerate ground state of J · H in + K · H prop for real J, K > 0.

Lemma 4 (Gap Existence)
For appropriate nonnegative J and K, the operator J · H in + K · H prop is gapped with a non-degenerate ground state and hence, Lemma 1 applies with ∆ ≥ max{J, Kπ 2 2(L + 1) 2 }. Lemma 6 (Existence and Acceptance) The objective function J · H in + K · H prop satisfies Theorem 2. The gate sequence l U l |0 ⊗n is accepted by the objective function from Lemma 6 thereby satisfying Theorem 2.
We will add K identity gates to boost the probability of the desired circuit output state |φ = Π L l=1 U l |0 ⊗n . From Lemma 1, we have that whenever φ|H|φ < max{J, Kπ 2 2(L+1) 2 }. For large enough K > L, the right hand side of (22) approaches unity, satisfying the theorem. Finally are faced with considering self-inverse gates. Such gates (U ) have a spectrum Spec(U ) ⊆ {±1}, are bijective to idempotent projectors (P 2 = P = P † ), viz. U = 1 1 − 2P and if V is a self-inverse quantum gate, so is the unitary conjugateṼ = GV G † under arbitrary G. Shi showed that a set comprising the controlled not gate (a.k.a. Feynman gate) plus any one-qubit gate whose square does not preserve the computational basis is universal [30]. Consider Hermitian then e ıθY = R(π/2) · R(θ).
Hence, a unitary Y rotation is recovered by a product of two Hermitian operators. A unitary X rotation is likewise recovered by the composition (24) when considering Hermitian Y · sin(θ) − Z · cos(θ). The universality of self-inverse gates is then established, with constant overhead. Hence and to conclude, the method introduces not more than O(L 2 ) expected values while requiring not more than O(ln L) slack qubits, for an L gate quantum circuit.

C. Ansatz states and a combinatorial quantum circuit area law
Our construction of universal variational quantum computation has not considered whether a restricted form of ansatz is capable of universal quantum computation at some arbitrary depth as Lloyd [22] and others [27] have. Instead, the objective function to be minimised is defined in terms of the unitary gates arising in the target circuit to be simulated. What ansatz states are then required to simulate a given target circuit?
This question appears to be difficult and not much is currently known. In the case of QAOA it was recently shown by myself and coauthors that the ability of an ansatz to approximate the ground state energy of a satisfiability instance worsens with increasing problem density (the ratio of constraints to variables) [2]. These related results however do not imediately apply to our interests here.
Towards our goals, we show that reasonable depth circuits might saturate bipartite entanglement-the depth of these circuits scales with the number of qubits and also depends on the interaction geometry present in a given quantum processor. Consider the following.
An ebit is a unit of entanglement contained in a maximally entangled two-qubit (Bell) state. A quantum state with q ebits of entanglement (quantified by any entanglement measure) contains the same amount of entanglement (in that measure) as q Bell states.
Lemma 7 Let c be the depth of 2-qubit controlled rotation gates in the n-qubit hardware-efficient ansatz. Then the maximum possible number of ebits across any bipartition is In a low-depth circuit, the underlying geometry of the processor heavily dictates c above. For example, for a line of qubits and for a ring, the minimal c required to possibly maximise E b is ∼ n/2 and ∼ n/4 respectfully. However, in the case of a grid, the minimal depth scales as ∼ √ 2/2. Hence, if we wish to simulate a quantum algorithm described by a low-depth circuit, having access to a grid architecture could provide an intrinsic advantage. Specifically, our combinatorial quantum circuit area law establishes that an objective circuit generating k < n/2 ebits across every bipartition, must be simulated by an ansatz of at least minimal required circuit depth ∼ √ k on a grid. While this does establish a preliminary relationship, the general case remains unclear at the time of writing. For example, given a quantum circuit with application time t which outputs |ψ , what is the minimal t( ) ≤ t for a control sequence to provide an close 2-norm approximation to |ψ ?

II. DISCUSSION
We have established that variational quantum computation admits a universal model. The gate sequence being simulated serves as an upper-bound showing that a control sequence exists to minimize the expected values. Expected values are then the fleeting resource of the variational model.
Although error correction is assumed in our universality proofs, the techniques we develop should augment possibilities in the NISQ setting, particularly with the advent of error suppression techniques [21,25]. Importantly, variational quantum computation forms a universal model in its own right and is not (in principle) limited in application scope.
An interesting feature of variational quantum computation is how many-body Hamiltonian terms are realized as part of the measurement process. This is in contrast with leading alternative models of universal quantum computation.
In the gate model, many-body interactions must be simulated by sequences of two-body gates. The adiabatic model applies perturbative gadgets to approximate many-body interactions with two-body interactions [1,7]. The variational model simulates many body interactions by local measurements. Moreover the coefficients weighting many-body terms need not be implemented by the quantum hardware directly; this weight is compensated for in the classical process. Finally, as many quantum states can cause a considered objective function to accept, the presented model is therefore partially agnostic to how states are prepared.
Variational counter parts to an increasing number of celebrated quantum algorithms have been recently developed, including the solution to linear [8] (and nonlinear [24]) systems. Indeed, computational universality implies that such variational incarnations generally exist. Yet the present results certainly don't rule out significant overhead reductions of task tailored variaitonal quantum algorithms.

ACKNOWLEDGMENTS
The author acknowledges support from the project, Leading Research Center on Quantum Computing (Agreement No. 014/20). Competing interests. The author declare no competing interests. Data and code availability. The data that supports the findings of this study are available within the article.

Methods
Data Availability. No data sets were generated.
Materials supporting the conclusions drawn in this study are available in the supplementary information.
Proof 2 (Lemma 3) The lowest energy subspace of H prop is spanned by |ψ hist which has degeneracy given by freedom in choosing any input state |ξ . To fix the input, consider a tensor product with a telescope for P 1 = |1 1| = 1 1 − P 0 acting on the qubit labeled in the subscript (i) on the right hand side and on the clock space (left). It is readily seen that H in has unit gap and Now for positive J, K for integer 0 ≤ k ≤ L. From the standard inequality, 1 − cos(x) ≤ x 2 /2, we find that H prop has a gap lower bounded as From Weyl's inequalities, it follow that J · H in + K · H prop is gapped as with a non-degenerate ground state and hence, Lemma 1 applies with Proof 4 (Lemma 5) An L-gate circuit requires at most k = ln 2 L clock qubits. Consider a projector P onto the orthogonal compliment of a basis state given by bit string x = x 1 x 2 . . . x k . Then wherex is the bitwise logical compliment of x.
Proof 5 (Lemma 6) Sketch. This term (41) contributes L terms and hence so does each of the four terms in H t from (17). Hence, the entire sum contributes 3 · L 2 expected values, where we assume U = U † and that L is upper bounded by some family of circuits requiring O(poly n) gates. The input penalty H in contributes n terms and for an L-gate circuit on n-qubits we arrive at a total of O(poly L 2 ) expected values and O( ln 2 L ) slack qubits. Adding identity gates to the circuit can boost output probabilities, causing the objective function to accept for a state prepared by the given quantum circuit.

THE HARDWARE EFFICIENT ANSATZ SATISFIES A COMBINATORIAL QUANTUM CIRCUIT AREA LAW
Here we will consider some properties of the quantum states that are accessible in NISQ era quantum information processing. Here we provide a bound for the minimal depth circuit (generated from the so called, hardware efficient Ansatz as used in recent experiments [18]) to possibly saturate bipartite entanglement on any bipartition. Understanding the computational power of these circuits represents a central open question in the field of quantum computation today. This appendix seeks to quantify contemporary capacities. We are currently not able to express the success probability as a function of the circuit depth required for an objective function to accept.

Definition 8 (Interaction graph) Consider the Hamiltonian
The support matrix S of J ij is defined to have the entries and is called the interaction graph of H-a symmetric adjacency matrix.

Remark 1
The interaction graph induces a space-time quantum circuit defined by a tiling on the multiplex from S. Definition 9 A Tiling is a gate sequence acting on a multiplex network induced by S.
Remark 2 An active edge (node) will specify if neighboring edges (nodes) can be active. As a general rule, noncommuting terms must be active on different layers.
1. Qubits connect network layers by time propagation.
2. Nodes of S in each layer can be acted on by local gates.
3. Edges of S in each layer can be acted on by two-qubit gates.
As an example, consider the following multiplex network depicted in Fig. 1.
In the bottom layer a sequence of red edges correspond to the application of two-body gates. In the next layer, the red (active) notes correspond to local rotation gates being applied to all the qubits. Finally, in the top layer the commuting two-body gates are applied. The blue vertical edges represent time passing (going up on the page). The hardware-efficient ansatz is exactly such a tiling.
In terms of example circuits, we typically will be given a short repetitive sequence. For example, here we consider qubits interacting on a ring. A layer of local gates followed by a layer of two-body gates is as follows.
Where the local gates, U are arbitrary and the two-body gates are controlled Y rotations. What is the maximal bipartite entanglement that such a circuit can generate when acting on a product state?
To understand this question, let us consider a pure n-qubit state |ψ .
Definition 10 Bipartite rank is the Schmidt number (the number of non-zero singular values) across any reduced bipartite density state from |ψ (i.e. n/2 qubits).
Remark 3 Rank provides an upper-bound on the bipartite entanglement that a quantum state can support-a rank-k state has at most log 2 (k) ebits of entanglement.
Definition 11 An ebit is a unit of entanglement contained in a maximally entangled two-qubit (Bell) state.
Remark 4 A quantum state with q ebits of entanglement (quantified by any entanglement measure) contains the same amount of entanglement (in that measure) as q Bell states.

Remark 5
If a task requires r ebits, it can be done with r or more Bell states, but not with fewer. Maximally entangled states in C d ⊗ C d have log 2 (d) ebits of entanglement.
Now we arrive at what we call a quantum circuit combinatorial area law. It is the minimal depth circuit that possibly could saturate the bipartite entanglement with respect to any bipartition. applied between the qubits. At t = 1 local gates (red nodes) are applied to each of the qubits.

POPULAR SUMMARY
What is the full application scope of contemporary (noisy) quantum information processing devices? Although many applications have now been discovered, ranging from quantum approximate optimization, to the simulation of quantum systems and more recently quantum enhanced deep learning, many celebrated text-book quantum algorithms (such as Shor's quantum factoring algorithm) do not appear to admit a variant which functions on existing noisy quantum information processors.
What then is the strict boundary between quantum enhanced information processing (without error correction) and full error corrected quantum computation? Moreover, what is the application scope and ultimate algorithmic capacity of noisy quantum information processing devices in the absence of error correction?
In the present study, we show that the contemporary variational approach to quantum enhanced algorithms admits a universal model of quantum computation. Hence we establish that universal quantum computation can be cast in terms of resources which are accessible using contemporary devices, which implies that the unknown limits of existing quantum enhanced noisy processors can now be better probed. The model maps universal quantum computation into that of state-preparation and the minimization of a (polynomial in the problem size) sequence of expected values. As variational methods are inherently agnostic to how quantum states are prepared, this enables experimentalists to vary the accessible control parameters to minimize an external and iteratively calculated objective function to preform universal quantum computation. Although the absolute limitations of this model in the absence of error correction remain unknown, a robust method of error suppression could make the approach amenable to a wider scope of traditional text-book quantum algorithms.