Springer Series in Operations Research and Financial Engineering 1997
DOI: 10.1007/b97672
|View full text |Cite
|
Sign up to set email alerts
|

Linear Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 70 publications
0
2
0
Order By: Relevance
“…When the observable B is measured on the state |φ in (5), one obtains two outcomes, 0 with probability |c 0 | 2 = Tr(|0 0||φ φ|) and 1 with probability |c 1 | 2 = Tr(|1 1||φ φ|). Notice, the normalization condition, |c 0 | 2 + |c 1 | 2 = 1, stated below (5) ensures that the probabilities sum to one. This type of measurement, which results in the measurement of B, is called a measurement in the computational basis.…”
Section: Measurement and Born's Rulementioning
confidence: 99%
See 1 more Smart Citation
“…When the observable B is measured on the state |φ in (5), one obtains two outcomes, 0 with probability |c 0 | 2 = Tr(|0 0||φ φ|) and 1 with probability |c 1 | 2 = Tr(|1 1||φ φ|). Notice, the normalization condition, |c 0 | 2 + |c 1 | 2 = 1, stated below (5) ensures that the probabilities sum to one. This type of measurement, which results in the measurement of B, is called a measurement in the computational basis.…”
Section: Measurement and Born's Rulementioning
confidence: 99%
“…For instance, most of the theory of duality directly extends from LPs to SDPs [4]. The simplex method for LPs [5,6] can be extended to SDPs [7]. For SDP constraints, one can construct cutting planes in polynomial time [8] and thus use a polynomial-time ellipsoid method [9,10] to numerically solve an SDP.…”
Section: Introductionmentioning
confidence: 99%