|
|
|
|
LEADER |
02473 am a22002653u 4500 |
001 |
103794 |
042 |
|
|
|a dc
|
100 |
1 |
0 |
|a Allegra, Michele
|e author
|
100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Nuclear Science and Engineering
|e contributor
|
100 |
1 |
0 |
|a Massachusetts Institute of Technology. Research Laboratory of Electronics
|e contributor
|
100 |
1 |
0 |
|a Aiello, Clarice D.
|e contributor
|
100 |
1 |
0 |
|a Wan, Xiaoting
|e contributor
|
100 |
1 |
0 |
|a Cappellaro, Paola
|e contributor
|
700 |
1 |
0 |
|a Hemmerling, Börge
|e author
|
700 |
1 |
0 |
|a Wan, Xiaoting
|e author
|
700 |
1 |
0 |
|a Cappellaro, Paola
|e author
|
700 |
1 |
0 |
|a Aiello, Clarice D.
|e author
|
245 |
0 |
0 |
|a Algebraic synthesis of time-optimal unitaries in SU(2) with alternating controls
|
260 |
|
|
|b Springer US,
|c 2016-07-28T17:52:58Z.
|
856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/103794
|
520 |
|
|
|a We present an algebraic framework to study the time-optimal synthesis of arbitrary unitaries in SU(2), when the control set is restricted to rotations around two non-parallel axes in the Bloch sphere. Our method bypasses commonly used control-theoretical techniques and easily imposes necessary conditions on time-optimal sequences. In a straightforward fashion, we prove that time-optimal sequences are solely parametrized by three rotation angles and derive general bounds on those angles as a function of the relative rotation speed of each control and the angle between the axes. Results are substantially different whether both clockwise and counterclockwise rotations about the given axes are allowed, or only clockwise rotations. In the first case, we prove that any finite time-optimal sequence is composed at most of five control concatenations, while for the more restrictive case, we present scaling laws on the maximum length of any finite time-optimal sequence. The bounds we find for both cases are stricter than previously published ones and severely constrain the structure of time-optimal sequences, allowing for an efficient numerical search of the time-optimal solution. Our results can be used to find the time-optimal evolution of qubit systems under the action of the considered control set and thus potentially increase the number of realizable unitaries before decoherence.
|
546 |
|
|
|a en
|
655 |
7 |
|
|a Article
|
773 |
|
|
|t Quantum Information Processing
|