# Dense Quantum Measurement Theory

Quantum measurement is a fundamental cornerstone of experimental quantum computations. The main issues in current quantum measurement strategies are the high number of measurement rounds to determine a global optimal measurement output and the low success probability of finding a global optimal measurement output. Each measurement round requires preparing the quantum system and applying quantum operations and measurements with high-precision control in the physical layer. These issues result in extremely high-cost measurements with a low probability of success at the end of the measurement rounds. Here, we define a novel measurement for quantum computations called dense quantum measurement. The dense measurement strategy aims at fixing the main drawbacks of standard quantum measurements by achieving a significant reduction in the number of necessary measurement rounds and by radically improving the success probabilities of finding global optimal outputs. We provide application scenarios for quantum circuits with arbitrary unitary sequences, and prove that dense measurement theory provides an experimentally implementable solution for gate-model quantum computer architectures.

## Authors

• 16 publications
• 13 publications
07/17/2021

### Quantum circuits with classical channels and the principle of deferred measurements

We define syntax and semantics of quantum circuits, allowing measurement...
08/25/2021

### A historical review and Bibliometric analysis of research on Weak measurement research over the past decades based on Biblioshiny

Weak measurement has enabled fundamental studies in both experiment and ...
11/10/2021

### A Hierarchy for Replica Quantum Advantage

We prove that given the ability to make entangled measurements on at mos...
07/21/2020

### Graph-theoretic approach to dimension witnessing

A fundamental problem in quantum computation and quantum information is ...
08/20/2020

### Resource-efficient adaptive Bayesian tracking of magnetic fields with a quantum sensor

By addressing single electron spins through Ramsey experiments, nitrogen...
12/18/2017

### Quantum impossible differential and truncated differential cryptanalysis

We study applications of BV algorithm and present quantum versions of im...
04/25/2019

### Dimensionality Distinguishers

The celebrated Clauser, Horne, Shimony and Holt (CHSH) game model helps ...
##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

## 1 Introduction

Quantum measurement is a crucial subject in quantum computation and communication [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 22, 23, 24, 25, 26, 27, 28, 79, 81, 20, 1, 2, 3, 83, 84, 85, 86, 87, 88]. The aim of quantum measurement is to extract valuable and useable information from the measured quantum system. The measurement operator connects the quantum world and our traditional, classical world. While the input of the measurement can be a superposed or entangled quantum system, the output of the measurement is classical information (i.e., bitstrings). Quantum measurements can be performed in different ways, for example via projective [30, 31, 32, 33, 34, 35, 36, 37] or POVM (positive-operator valued measure) measurements [80, 82, 33, 41, 42, 43, 44, 45].

Quantum measurement is required element in high-complexity quantum computations, in high-performance quantum information processing and in quantum computer architectures. The main issues of current quantum measurement strategies are the high number of measurement rounds and the probability of successfully finding a global optimal measurement output. The necessity of a high number of measurement rounds requires preparing the input quantum system and applying quantum operations with high-precision control in the physical layer through several rounds, which results in a high-cost procedure overall that is not tractable in any experimental setting. The repetition of a measurement round therefore requires in each round the careful preparation of a quantum register of quantum states that are then fed into a quantum circuit that realizes an arbitrary unitary sequence. In each round, the output of the quantum circuit is measured by a measurement array , which produces a classical output string . The aim is then to find a global optimal output that describes the properties of the output quantum system with the highest accuracy according to quality measurement functions. An example of a high-cost application of standard measurement is measuring the output of a quantum circuit applied to realize quantum computations where the quantum circuit is set to perform a unitary operation . Without loss of generality, the -length input quantum system of the quantum circuit is assumed to be a superposed quantum system that is fed into the circuit. Then, the -length output quantum system is measured by the measurement operator , which produces a string and, after repeating the procedure times, yields the global optimal string with success probability . Assuming that is an arbitrary quantum circuit and is a standard measurement, the measurement procedure requires high repetition numbers, while the success probability remains low (An example is the application of standard quantum measurements in quantum computers, where for standard measurement rounds, the achievable success probability is approximately [13]). Since each measurement round requires high-cost and high-precision quantum state preparations and quantum operations, the total cost to find the global optimal is very high in a practical setting. To avoid the issues of a high number of measurement rounds and the low success probability of quantum measurements, a novel measurement is essential for quantum computations.

Here, we define a novel measurement for quantum computations called dense quantum measurement. The dense measurement strategy aims at fixing the drawbacks of standard quantum measurements by achieving a radical reduction in the number of necessary measurement rounds and by significantly improving the success probabilities of finding global optimal outputs (see Theorem 1 for the system model). Dense quantum measurement requires only measurement rounds, such that rounds leads to a success probability of . The dense measurement strategy is rooted in the theory of compressed sensing [54, 55, 56, 57], which allows recovering noisy signals with a high efficiency in the field of traditional communications. Dense quantum measurement utilizes an randomized measurement operator that is defined as an

-bit length vector

, where

is a random variable,

, , associated with the measurement of the -th quantum state of the output quantum system, while is a quantum measurement in the computational basis ; thus, if and if . As follows, the measurement in the computational basis is discarded if . Then, the measurement result is post-processed via unit that integrates algorithms to determine the global optimal string from the results of the randomized measurements.

As we prove (see Theorem 2), the number of standard measurement rounds can be reduced to dense measurement rounds for an arbitrary quantum circuit, where and , while are constants. At this number of measurement rounds, the success probability is for any practical value of . We also prove that if the output of the quantum circuit is a computational basis quantum state, then can be reduced to dense measurement rounds, where is a constant, such that for any (see Theorem 3).

The novel contributions of our manuscript are as follows:

1. We define a novel quantum measurement theory called dense quantum measurement.

2. We prove that dense measurement reduces the number of required measurement rounds to find a global optimal output.

3. We prove that dense measurement significantly improves the success probability of finding a global optimal output.

4. We provide an application scenario for quantum circuits with arbitrary unitary sequences, and for the dense measurement of computational basis quantum states in gate-model quantum computer environment.

5. We reveal that the primary advantages of dense quantum measurement theory are the significantly lower measurement rounds and significantly higher success probabilities.

This manuscript is organized as follows. In Section 2, the related works are summarized. In Section 3, the problem statement is given. In Section 4, preliminaries are summarized. Section 5 proposes the theorems and proofs. Section 6 provides a performance evaluation. Finally, Section 7 concludes the paper. Supplemental information is included in the Appendix.

## 2 Related Works

The related works on quantum measurement theory, gate-model quantum computers and compressed sensing are summarized as follows.

### 2.1 Quantum Measurement Theory

Quantum measurement has a fundamental role in quantum mechanics with several different theoretical interpretations [30, 31, 32, 33, 34, 35, 36, 37, 41, 42, 43, 44, 45]

. The measurement of a quantum system collapses of the quantum system into an eigenstate of the operator corresponding to the measurement. The measurement of a quantum system produces a measurement result, the expected values of measurement are associated with a particular probability distribution.

In quantum mechanics several different measurement techniques exist. In a projective measurement [30, 31, 32, 33, 34, 35, 36, 37], the measurement of the quantum system is mathematically interpreted by projectors that project any initial quantum state onto one of the basis states. The projective measurement is also known as von Neumann measurement [30]. In our manuscript the projective measurement with no post-processing on the measurement results is referred to as standard measurement111It is motivated by the fact, that in a gate-model quantum computer environment the output quantum system is measured with respect to a particular computational basis..

The von Neumann measurements are a special case of a more general measurement, the POVM measurement [33, 41, 42, 43, 44, 45]. Without loss of generality, the POVM is a generalized measurement that can be interpreted as a von Neumann measurement that utilizes an additional quantum system (called ancilla). The POVM measurement is mathematically described by a set of positive operators such that their sum is the identity operator [38, 39, 40]. The POVM measurements therefore can be expressed in terms of projective measurements (see also Neumark’s dilation theorem [46, 47, 48]).

Another subject connected to quantum measurement theory is quantum-state discrimination [49, 50, 51, 52, 53] that covers the distinguishability of quantum states, and the problem of differentiation between non-orthogonal quantum states.

### 2.2 Gate-Model Quantum Computers

The theoretical background of the gate-model quantum computer environment utilized in our manuscript can be found in [12] and [13].

In [13]

, the authors studied the subject of objective function evaluation of computational problems fed into a gate-model quantum computer environment. The work focuses on a qubit architectures with a fixed hardware structure in the physical layout. In the system model of a gate-model quantum computer, the quantum computer is modeled as a sequence of unitary operators (quantum gates). The quantum gates are associated with a particular control parameter called the gate parameter. The quantum gates can process one-qubit length and multi-qubit length quantum systems. The input quantum system (particularly a superposed quantum system) of the quantum circuit is transformed via a sequence of unitaries controlled via the gate parameters, and the output qubits are measured by a measurement array. The measurement in the model is realized by a projective measurement applied on a qubits that outputs a logical bit with value zero or one for each measured qubit. The result of the measurement is therefore a classical bitstring. The output bitstring is processed further to estimate the objective function of the quantum computer. The work also induces and opens several important optimization questions, such as the optimization of quantum circuits of gate-model quantum computers, optimization of objective function estimation, measurement optimization and optimization of post-processing in a gate-model quantum computer environment. In our particular work we are focusing on the optimization of the measurement phase.

An optimization algorithm related to gate-model quantum computer architectures is defined in [12]

. The optimization algorithm is called “Quantum Approximate Optimization Algorithm” (QAOA). The aim of the algorithm is to output approximate solutions for combinatorial optimization problems fed into the quantum computer. The algorithm is implementable via gate-model quantum computers such that the depth of the quantum circuit grows linearly with a particular control parameter. The work also proposed the performance of the algorithm at the utilization of different gate parameter values for the unitaries of the gate-model computer environment.

In [16], the authors studied some attributes of the QAOA algorithm. The authors showed that the output distribution provided by QAOA cannot be efficiently simulated on any classical device. A comparison with the “Quantum Adiabatic Algorithm” (QADI) [18, 19] is also proposed in the work. The work concluded that the QAOA can be implemented on near-term gate-model quantum computers for optimization problems.

An application of the QAOA algorithm to a bounded occurrence constraint problem “Max E3LIN2” can be found in [15]. In the analyzed problem, the input is a set of linear equations each of which has three boolean variables, and each equation outputs whether the sum of the variables is 0 or is 1 in a mod 2 representation. The work is aimed to demonstrate the capabilities of the QAOA algorithm in a gate-model quantum computer environment.

In [89], the authors studied the objective function value distributions of the QAOA algorithm. The work concluded, at some particular setting and conditions the objective function values could become concentrated. A conclusion of the work, the number of running sequences of the quantum computer can be reduced.

In [90], the authors analyzed the experimental implementation of the QAOA algorithm on near-term gate-model quantum devices. The work also defined an optimization method for the QAOA, and studied the performance of QAOA. As the authors found, the QAOA can learn via optimization to utilize non-adiabatic mechanisms.

In [91], the authors studied the implementation of QAOA with parallelizable gates. The work introduced a scheme to parallelize the QAOA for arbitrary all-to-all connected problem graphs in a layout of qubits. The proposed method was defined by single qubit operations and the interactions were set by pair-wise CNOT gates among nearest neighbors. As the work concluded, this structure allows for a parallelizable implementation in quantum devices with a square lattice geometry.

In [14]

, the authors defined a gate-model quantum neural network. The gate-model quantum neural network describes a quantum neural network implemented on gate-model quantum computer. The work focuses on the architectural attributes of a gate-model quantum neural network, and studies the training methods. A particular problem studied in the work is the classification of classical data sets which consist of bitstrings with binary labels. In the architectural model of a gate-model quantum neural network, the weights are represented by the gate parameters of the unitaries of the network, and the training method acts these gate parameters. As the authors stated, the gate-model quantum neural networks represent a practically implementable solution for the realization of quantum neural networks on near-term gate-model quantum computer architectures.

In [17], the authors defined a quantum algorithm that is realized via a quantum Markov process. The analyzed process of the work was a quantum version of a classical probabilistic algorithm for -SAT defined in [21]. The work also studied the performance of the proposed quantum algorithm and compared it with the classical algorithm.

For a review on the noisy intermediate-scale quantum (NISQ) era and its technological effects and impacts on quantum computing, see [1].

The subject of quantum computational supremacy (tasks and problems that quantum computers can solve but are beyond the capability of any classical computer) and its practical implications are studied in [2]. For a work on the complexity-theoretic foundations of quantum supremacy, see [3].

A comprehensive survey on quantum channels can be found in [28], while for a survey on quantum computing technology, see [29].

### 2.3 Compressed Sensing

In traditional information processing, compressed sensing [54] is a technique to reduce the sampling rate to recover a signal from fewer samples than it is stated by the Shannon-Nyquist sampling theorem (that states that the sampling rate of a continuous-time signal must be twice its highest frequency for the reconstruction) [54, 55, 56, 57]. In the framework of compressed sensing, the signal reconstruction process exploits the sparsity of signals (in the context of compressed sensing, a signal is called sparse if most of its components are zero) [57, 58, 59, 60, 61, 62]. Along with the sparsity, the restricted isometry property [57, 58, 62] is also an important concept of compressed sensing, since, without loss of generality, this property makes it possible to yield unique outputs from the measurements of the sparse inputs. The restricted isometry property is also a well-studied problem in the field of compressed sensing [63, 64, 65, 66, 66, 67].

A special technique within compressed sensing is the so-called “1-bit” compressed sensing [68, 69, 70], where 1-bit measurements are applied that preserve only the sign information of the measurements.

The application of compressed sensing covers the fields of traditional signal processing, image processing and several different fields of computational mathematics [71, 72, 73, 74, 75, 76, 77, 78].

The dense quantum measurement theory proposed in our manuscript also utilizes the fundamental concepts of compressed sensing. However, in our framework the primary aims are the reduction of the measurement rounds required to determine a global optimal output at arbitrary unitaries, and the boosting of the success probability of finding a global optimal output at a particular measurement round. The results are illustrated through a gate-model quantum computer environment.

## 3 Problem Statement

Let be the superposed input system of a quantum circuit with a quantum gate structure, formulated by quantum states, as

 |X⟩=1√dn∑z|z⟩, (1)

where is the dimension of the quantum system, is a computational basis state and is the unitary operation of , defined as a sequence of unitaries

 U(→θ)=UL(θL)UL−1(θL−1),…,U1(θ1), (2)

where is the -dimensional vector of the gate parameters of the unitaries (gate parameter vector):

 →θ=(θ1,…,θL)T. (3)

In (2), an -th unitary gate is evaluated as

 Ui(θi)=exp(−iθiP), (4)

where

is a generalized Pauli operator formulated by the tensor product of Pauli operators

.

In a standard measurement setting, the output of is

 |Y⟩=U(→θ)|X⟩ (5)

measured by a measurement operator, which yields an output string as

 z=M|Y⟩. (6)

The global optimal output string is an output string that yields the optimal estimation at a particular objective function fed into the quantum circuit as a maximization problem

 C(z∗)=max∀mC(zm), (7)

where is the estimate yielded in an -th measurement round, , while is the output string yielded in the -th round.

Without loss of generality, after measurement rounds, the probability that the global optimal output string is determined is ; thus, can be found with the same success probability,

 PrR0C(z∗)=PrR0(z∗). (8)

The problems connected to the general measurement strategy to find are the high number of repetitions and the low success probability. Consequently, the standard measurement procedure requires high-cost quantum state preparations, the application of high-cost measurement arrays and high-precision control and calibrations in the physical layer.

Problems 1-3 summarize the problems to be solved.

###### Problem 1

(System Model). Define a novel quantum measurement strategy for the significant reduction of the measurement rounds of standard measurements and for the significant improvement of the success probability in determining a global optimal output .

###### Problem 2

(General application). Define and for an arbitrary quantum circuit with . Prove the number of measurement rounds, , and the success probability, .

###### Problem 3

(Dense measurement of computational basis quantum states). Define and for an arbitrary quantum circuit with , where sets the computational basis 222Throughout the manuscript, the term “computational basis” refers to a basis , for which holds at a given , where is an input system.. Prove the number of measurement rounds, , and the success probability, .

The resolutions of Problems 1-3 are given in Theorems 1-3, respectively.

## 4 Preliminaries

### 4.1 Sub-Gaussian Distributions

A random variable is sub-Gaussian, if for the probability distribution of ,

 Pr(|X|≥κ)≤C1e−C2κ2 (9)

holds for , where

 C1,C2>0 (10)

are sub-Gaussian parameters.

By theory, if is sub-Gaussian with

 E(X)=0, (11)

then there exists a constant depending on only such that

 E(exp(ηX)≤exp(c∗η2)) (12)

for .

If (12) holds, then (11) is satisfied such that the sub-Gaussian parameter of is

 C1=2, (13)

and is as

 C2=14c∗. (14)

An random matrix is a sub-Gaussian random matrix, if

 Pr(∣∣Mj,k∣∣≥κ)≤C1e−C2κ2 (15)

for , where is the -th element of , , where

 C1,C2>0 (16)

are sub-Gaussian parameters.

## 5 Methods

### 5.1 System Model

###### Theorem 1

(Dense measurement). A structure with unitary , where the unitary sets an arbitrary computational basis for an -length input as , such that , , holds for the -norm of , where is a classical representation of , while is the actual setting of the unitaries of at and with a random measurement operator, allows the determination of the global optimal output and global optimal estimate at a particular objective function as holds, where and are constants depending on , where and is the measurement operator of the -th dense measurement round .

Proof. First, we rewrite (2) as

 U(→θ)=UBU(→θ′), (17)

where is a unitary that sets a computational basis and is a unitary operation that sets the unitaries, such that

 UBU(→θ′)(UBU(→θ′))†=UBU(→θ′)U†B(U(→θ′))†=UBU(→θ′)(U(→θ′))†U†B=UBIU†B=UBU†B=I, (18)

where is the identity and is the -dimensional vector of the gate parameters of . Applying the unitary on input system yields the -length quantum system ,

 |S⟩=UB|X⟩, (19)

where the computational basis for in (17) is selected such that for the -norm of the following relation holds

 L0(S)=∥S∥0≤K, (20)

where

 S=BX (21)

is a classical representation of , is a classical representation of and . Therefore, can be an arbitrary computational basis for which (20) holds at a given (21) (For example, if is the Fourier basis, then

realizes a quantum Fourier transform).

The output of at (17) and (19) is therefore written as

 U(→θ)|X⟩=UBU(→θ′)|X⟩=U(→θ′)(UB|X⟩)=U(→θ′)|S⟩=|G⟩=|g1,…,gn⟩, (22)

whose state is measured by an random measurement operator, defined as an -bit length vector

 Mr=(b1MB,…,bnMB)T, (23)

where is a random variable,

 bi={0,withPr(0)=0.51,withPr(1)=0.5, (24)

associated with the measurement of the -th quantum system of in (22), and is a measurement in the computational basis .

Thus, the measurement of the -th quantum system of is defined via the following rule:

 biMB={0,ifbi=0,MB,ifbi=1. (25)

In other words, the measurement result is kept only if in (23); otherwise, the measurement result is discarded and replaced by a zero element. This results output , as

 yi={0,ifbi=0,MB(|gi⟩),ifbi=1. (26)

This measurement strategy defines (23) as a random Bernoulli vector [54, 55, 56, 57]. Then, the -bit length output , is as

 Y=Mr(|G⟩)=MrU(→θ′)|S⟩=M′r|S⟩=βCΛ=β′CS, (27)

where is

 M′r=MrU(→θ′) (28)

while is an -length classical vector formulated via the bits of (24) as

 βC=(b1,…,bn)T, (29)

and

 β′C=βCU(→θ′), (30)

and is

 Λ=U(→θ′)S. (31)

As follows, applying (23) on (22) is equivalent to applying (28) on the computational basis state (19).

As (27) is determined via (23), the goal is to determine at a particular objective function via a post-processing .

First, from (27), the computational basis vector can be recovered as via , as a minimization [57],

 ~S=argminSL1(S) (32)

such that

 Y=β′CS (33)

where is the -norm. The unit utilizes a basis pursuit algorithm [54, 55, 56, 57] for the -minimization in (32). Then, using (32), is defined as

 ~Λ=U(→θ′)~S. (34)

Thus, from (34), the output vector is evaluated as

 z=B−1P(Y)=B−1(~Λ)=U(→θ)~X, (35)

where is the post-processing (32) applied on , is the inverse basis transformation and is a classical representation of . As follows, from (35), the estimate yields

 C(z)=C(B−1P(Y)). (36)

Then, assume that the procedure repeats for rounds. The rounds of dense measurement are defined via an measurement matrix as

 M=(M(1)r,…,M(R)r), (37)

where is an -size random measurement vector (23) of the -th measurement round , as

 M(m)r=(b(m)1MB,…,b(m)nMB)T, (38)

where is the -th bit of defined via (24), and of the -th round is

 M′r(m)=M(m)rU(→θ′), (39)

and of the -th round is

 β′C(m)=β(m)CU(→θ′), (40)

where

 β(m)C=(b(m)1,…,b(m)n)T. (41)

For the rounds, define the orthogonal matrix as

 Q=MU(→θ′)=(M′r(1),…,M′r(R)), (42)

and the measurement output matrix as

 YR=Q|S⟩=(Y(1),…,Y(R)), (43)

where is the measurement result vector (33) of the -th round.

The problem is therefore to find the optimal value of , such that the total error probability at the end of rounds

 Pr(z≠z∗)=ξ (44)

picks up a given arbitrary value that is determined via the success of the minimization (32) in the unit.

After some argumentations on the probability distribution of (42), at measurement rounds a concentration relation can be written as

 (45)

where is a constant depending on the sub-Gaussian parameters (see Section 4.1) of the sub-Gaussian matrix (42), is the Euclidean norm and is the -norm of a quantum system, , where and , while is .

By theory, the -th restricted isometry constant [54, 55, 56, 57] of matrix is the smallest such that

 (1−χ)ℓ2(|S⟩)≤(L2(Q|S⟩))2≤(1+χ)ℓ2(|S⟩), (46)

for where .

Then, for a given , the restricted isometry constant [54, 55, 56, 57] of satisfies relation with probability

 Pr(δK<χ)=1−ε (47)

where , if is selected as

 R=A1χ2(K(9+2log(nK))+2log(2(1ε))), (48)

where

 A=23c. (49)

The motivation for the selection of is as follows. The value of in (48) guarantees that the relation holds with probability , as it is given in (47). If is greater than (48), then , while if is lower than the value given in (48), then . As a corollary, the lowest value of to satisfy the relation with probability at least , is as given in (48). To prove (48), express via (46) as

 δK=supΥ⊂[n],|Υ|=KL2(Q∗ΥQΥ−I), (50)

where is subset, is a submatrix,

is the identity matrix,

is the cardinality of subset and is the set of natural numbers not exceeding .

The formula of (50) is equivalent to (46), since (46) can be rewritten as

 (51)

for , and . Let

 YΥ=QΥ∣∣S′⟩, (52)

and

 ZΥ=H∣∣S′⟩, (53)

where is a Hermitian matrix,

 H=Q∗ΥQΥ−I, (54)

then

 (L2(YΥ))2−ℓ2(∣∣S′⟩)=⟨YΥ,YΥ⟩−⟨S′,S′⟩=⟨ZΥ,S′⟩ (55)

Therefore, can be expressed as a maximization

 (56)

 maxΥ⊂[n],|Υ|=KL2(H)≤χ. (57)

Then, the union bound takes over all subsets of cardinality , yields the relation of

 Pr(δK≥χ)≤∑supΥ⊂[n],|Υ|=KPr(L2(H)≥χ)≤2(nK)(1+2Ω)Kexp(−cχ2(1−2Ω)2R)≤2(enK)K(1+2Ω)Kexp(−cχ2(1−2Ω)2R), (58)

where we used that for integers , by theory [54, 55, 56, 57].

It can be verified that in (58) for with , the relation

 Pr(L2(H)<χ)=1−ε (59)

holds, if

 R=23cχ2(7K+2log(2(1ε))), (60)

since for

 κ=(1−2Ω)χ (61)

it can be verified that

 Pr(L2(H)≥χ)≤2(1+2Ω)Kexp(−c(1−2Ω)2χ2R). (62)

Thus, (59) is satisfied only if

 R=1c(1−2Ω)2χ2(log(1+2Ω)K+log(2(1ε))). (63)

Then, setting in (63) to

 Ω=2e3.5−1 (64)

so that

 1(1−2Ω)2≤43 (65)

and

 log(1+2Ω)1(1−2Ω)2≤143, (66)

yields (60) [57].

Note that it also can be shown that for in (64), there exists a finite subset of a unit ball such that is

 |Γ|≤(1+2Ω)K (67)

and

 minx∈ΓL2(z−x)≤Ω (68)

for , such that for

 (69)

and

 Pr(∣∣(L2(Q|x⟩))2−ℓ2(|x⟩)∣∣<κ(ℓ2(|x⟩)),∀x⊂Γ)=1−2(1+2Ω)Sexp(−cκ2R). (70)

By finding the values of and , the relation

 ∣∣(L2(Q|z⟩))2−ℓ2(|z⟩)∣∣=L2(H)≤χ (71)

can be satisfied for .

It can be proven at (54) and

 W=H|x⟩, (72)

for that the relation

 |⟨W,x⟩|<κ, (73)

holds. Thus, for a given and , such that ,

 (74)

where

 V=H|z⟩, (75)

and

 D=H|z+x⟩. (76)

Then, a maximization over yields

 L2(H)<κ+2L2(H)Ω. (77)

Thus,

 L2(H)≤κ1−2Ω. (78)

As follows, there exists (61) such that holds, and combining it with (70) verifies the relation of (62).

To conclude the results, setting in (58) with equality in (64) leads to with probability , as the value of measurement rounds is

 R=1cχ2(43Klog(10nK)+143K+43log(2(1ε)))=23c1χ2(K(9+2log(nK))+2log(2(1ε))). (79)

Note that if is selected to be greater than (79), the probability is increased to .

### 5.2 Dense Measurement Rounds in Gate-Model Quantum Computers

#### 5.2.1 Arbitrary Unitary Sequences

The next theorem reveals that the number of dense measurement rounds can be used to determine with an error probability , such that depends only on the properties of the unitaries, while it does not depend directly on the actual .

###### Theorem 2

(Dense measurements at a quantum gate structure). For an arbitrary unitary in with , the global optimal and estimate can be determined via dense measurement rounds, with probability , where , is the -th element of the -th column of , while is a constant.

Proof. Let assume that can be decomposed as , and the following bound can be formulated for the entries of ,

 maxk,q∈[n]∣∣U(→θq,k)∣∣≤Z√n, (80)

where is the -th element of the -th column of , and

 ∣∣U(→θq,k)∣∣=√U(→θq,k)(U(→θq,k))∗. (81)

Let assume that the size of is , with columns , . Then let be the normalization of as

 vk=√nuk, (82)

where the normalized columns form an orthonormal system, and let be the inner product of two normalized columns and , as

 φkl=⟨1√nvk,1√nvl⟩=⟨uk,ul⟩, (83)

that can be rewritten as

 φkl=1nn∑q=1√nU(→θq,k)√nU†(→θq,l)=1nn∑q=1√nuk,q√nu†l,q, (84)

where and . Therefore, in (84), the sum operator runs over the elements of the -th column of unitary , and the elements of the -th column of , respectively.

Then, at and , some argumentations on bounded orthonormal systems straightforwardly yields the boundedness condition [57]

 Z≥maxk,q∈[n]∣∣⟨bq,u′k⟩∣∣, (85)

where is the -th column of .

Then, for the maximal entry of , a bound can be established via the normalized columns, as

 Z≥maxk,q∈[n]|vk,q|=maxk,q∈[n]∣∣√nuk,q∣∣=√nmaxk,q∈[n]|uk,q|=√nmaxk,q∈[n]∣∣U(→θq,k)∣∣. (86)

As follows, the bounds in (85) and (86) are equivalent to (80).

Then, by introducing a projector that selects a subset of in the rounds, the (37) measurement operator applied on a unitary can be rewritten as

 M=PQR(U(→θ)), (87)

where is a subset of elements selected uniform at random from all subsets of of cardinality , ,

 QR={q1,…,qR}. (88)

As follows, the (43) measurement result can be rewritten as

 (89)

It is required to verify that the error probability (44) at a projector in (87) is bounded by an error probability associated with the selection of rows uniformly and independently at random from [57].

Thus, we define set with the same cardinality as (88), such that its elements are selected independently and uniformly at random from ,

 Q′R={q′1,…,q′R}. (90)

Then, let be a subset of selected uniform at random from all subsets of of cardinality , ,

 Qk={q1,…,qk}. (91)

For any subset , we define a failure event as

 E(Q)≡{~S≠argminSL1(S),s.t.Y=PQ(U(→θ′))|S⟩,for∀|S⟩}, (92)

i.e., the event that the -minimization (i.e,. a basis pursuit algorithm in ) allows no to determine every from (89) on (Note that the success probability of an -minimization in to determine is independent from the normalization of the measurement operator.).

It can be verified, that for ,

 E(~Q)⊂E(Q), (93)

and for ,

 Pr(E(QR))=ξ≤Pr(E(Qk))=ξk, (94)

and if holds for , then

 D(Q′R)=D(Qk), (95)

where is the distribution.

Therefore, the

 Pr(E(Q′R))=ξ∗ (96)

probability of event at