9,381 research outputs found
Generalized self-testing and the security of the 6-state protocol
Self-tested quantum information processing provides a means for doing useful
information processing with untrusted quantum apparatus. Previous work was
limited to performing computations and protocols in real Hilbert spaces, which
is not a serious obstacle if one is only interested in final measurement
statistics being correct (for example, getting the correct factors of a large
number after running Shor's factoring algorithm). This limitation was shown by
McKague et al. to be fundamental, since there is no way to experimentally
distinguish any quantum experiment from a special simulation using states and
operators with only real coefficients.
In this paper, we show that one can still do a meaningful self-test of
quantum apparatus with complex amplitudes. In particular, we define a family of
simulations of quantum experiments, based on complex conjugation, with two
interesting properties. First, we are able to define a self-test which may be
passed only by states and operators that are equivalent to simulations within
the family. This extends work of Mayers and Yao and Magniez et al. in
self-testing of quantum apparatus, and includes a complex measurement. Second,
any of the simulations in the family may be used to implement a secure 6-state
QKD protocol, which was previously not known to be implementable in a
self-tested framework.Comment: To appear in proceedings of TQC 201
Enhancement of Sandwich Algorithms for Approximating Higher Dimensional Convex Pareto Sets
In many fields, we come across problems where we want to optimize several conflicting objectives simultaneously. To find a good solution for such multi-objective optimization problems, an approximation of the Pareto set is often generated. In this paper, we con- sider the approximation of Pareto sets for problems with three or more convex objectives and with convex constraints. For these problems, sandwich algorithms can be used to de- termine an inner and outer approximation between which the Pareto set is 'sandwiched'. Using these two approximations, we can calculate an upper bound on the approximation error. This upper bound can be used to determine which parts of the approximations must be improved and to provide a quality guarantee to the decision maker. In this paper, we extend higher dimensional sandwich algorithms in three different ways. Firstly, we introduce the new concept of adding dummy points to the inner approx- imation of a Pareto set. By using these dummy points, we can determine accurate inner and outer approximations more e±ciently, i.e., using less time-consuming optimizations. Secondly, we introduce a new method for the calculation of an error measure which is easy to interpret. The combination of easy calculation and easy interpretation makes this measure very suitable for sandwich algorithms. Thirdly, we show how transforming cer- tain objective functions can improve the results of sandwich algorithms and extend their applicability to certain non-convex problems. The calculation of the introduced error measure when using transformations will also be discussed. To show the effect of these enhancements, we make a numerical comparison using four test cases, including a four-dimensional case from the field of intensity-modulated radiation therapy (IMRT). The results of the different cases show that we can indeed achieve an accurate approximation using significantly fewer optimizations by using the enhancements.Convexity;e-efficiency;e-Pareto optimality;Geometric programming;Higher dimensional;Inner and outer approximation;IMRT;Pareto set;Multi-objective optimiza- tion;Sandwich algorithms;Transformations
One-Dimensional Nested Maximin Designs
The design of computer experiments is an important step in black box evaluation and optimization processes.When dealing with multiple black box functions the need often arises to construct designs for all black boxes jointly, instead of individually.These so-called nested designs are used to deal with linking parameters and sequential evaluations.In this paper we discuss one-dimensional nested maximin designs.We show how to nest two designs optimally and develop a heuristic to nest three and four designs.Furthermore, it is proven that the loss in space-fillingness, with respect to traditional maximin designs, is at most 14:64 percent and 19:21 percent, when nesting two and three designs, respectively.simulation;computers;integer programming
- âŠ