arXiv subjects

S. J. Glaser

Publications and source records attributed to S. J. Glaser.

32 records · Page 2Linked to original sources

arXiv2011

Saturation of a spin 1/2 particle by generalized Local control

We show how to apply a generalization of Local control design to the problem of saturation of a spin 1/2 particle by magnetic fields in Nuclear Magnetic Resonance. The generalization of local or Lyapunov control arises from the fact that the derivative of the Lyapunov function does not depend explicitly on the control field. The second derivative is used to determine the local control field. We compare the efficiency of this approach with respect to the time-optimal solution which has been recently derived using geometric methods.

quant-ph↗

arXiv2010

Simultaneous time-optimal control of the inversion of two spin 1/2 particles

We analyze the simultaneous time-optimal control of two-spin systems. The two non coupled spins which differ in the value of their chemical offsets are controlled by the same magnetic fields. Using an appropriate rotating frame, we restrict the study to the case of opposite shifts. We then show that the optimal solution of the inversion problem in a rotating frame is composed of a pulse sequence of maximum intensity and is similar to the optimal solution for inverting only one spin by using a non-resonant control field in the laboratory frame. An example is implemented experimentally using techniques of Nuclear Magnetic Resonance.

quant-ph↗

arXiv2010

Optimal control of circuit quantum electrodynamics in one and two dimensions

Optimal control can be used to significantly improve multi-qubit gates in quantum information processing hardware architectures based on superconducting circuit quantum electrodynamics. We apply this approach not only to dispersive gates of two qubits inside a cavity, but, more generally, to architectures based on two-dimensional arrays of cavities and qubits. For high-fidelity gate operations, simultaneous evolutions of controls and couplings in the two coupling dimensions of cavity grids are shown to be significantly faster than conventional sequential implementations. Even under experimentally realistic conditions speedups by a factor of three can be gained. The methods immediately scale to large grids and indirect gates between arbitrary pairs of qubits on the grid. They are anticipated to be paradigmatic for 2D arrays and lattices of controllable qubits.

quant-ph↗

arXiv2010

Singular extremals for the time-optimal control of dissipative spin 1/2 particles

We consider the time-optimal control by magnetic fields of a spin 1/2 particle in a dissipative environment. This system is used as an illustrative example to show the role of singular extremals in the control of quantum systems. We analyze a simple case where the control law is explicitly determined. We experimentally implement the optimal control using techniques of nuclear magnetic resonance. To our knowledge, this is the first experimental demonstration of singular extremals in quantum systems with bounded control amplitudes.

quant-ph↗

arXiv2009

Optimal Control for Generating Quantum Gates in Open Dissipative Systems

Optimal control methods for implementing quantum modules with least amount of relaxative loss are devised to give best approximations to unitary gates under relaxation. The potential gain by optimal control using relaxation parameters against time-optimal control is explored and exemplified in numerical and in algebraic terms: it is the method of choice to govern quantum systems within subspaces of weak relaxation whenever the drift Hamiltonian would otherwise drive the system through fast decaying modes. In a standard model system generalising decoherence-free subspaces to more realistic scenarios, openGRAPE-derived controls realise a CNOT with fidelities beyond 95% instead of at most 15% for a standard Trotter expansion. As additional benefit it requires control fields orders of magnitude lower than the bang-bang decouplings in the latter.

quant-ph↗

arXiv2008

Quantum CISC Compilation by Optimal Control and Scalable Assembly of Complex Instruction Sets beyond Two-Qubit Gates

We present a quantum CISC compiler and show how to assemble complex instruction sets in a scalable way. Enlarging the toolbox of universal gates by optimised complex multi-qubit instruction sets thus paves the way to fight decoherence for realistic settings. Compiling a quantum module into the machine code for steering a concrete quantum hardware device lends itself to be tackled by means of optimal quantum control. To this end, there are two opposite approaches: (i) one may use a decomposition into the restricted instruction set (RISC) of universal one- and two-qubit gates, which in turn have prefabricated translations into the machine code or (ii) one may prefer to generate the entire target module directly by a complex instruction set (CISC) of available controls. Here we advocate direct compilation up to the limit of system size a classical high-performance parallel computer cluster can reasonably handle. For going beyond these limits, i.e. for large systems we propose a combined way, namely (iii) to make recursive use of medium-sized building blocks generated by optimal control in the sense of a quantum CISC compiler. The advantage of the method over standard RISC compilations into one- and two-qubit universal gates is explored on the parallel cluster HLRB-II (with a total LINPACK performance of 63.3 TFlops/s) for the quantum Fourier transform, the indirect SWAP gate as well as for multiply-controlled CNOT gates. Implications for upper limits to time complexities are also derived.

quant-ph↗

arXiv2008

Gradient Flows for Optimisation and Quantum Control: Foundations and Applications

For addressing optimisation tasks on finite dimensional quantum systems, we give a comprehensive account of the foundations of gradient flows on Riemannian manifolds including new developments: we extend former results from Lie groups such as the full unitary group to closed subgroups like partitionings by factorisation into tensor products, where the finest partitioning consists of purely local unitary operations. Moreover, the common framework is kept sufficiently general and allows for setting up gradient flows on (sub-)manifolds, Lie (sub-)groups, quotient groups, and reductive homogeneous spaces. Relevant convergence conditions are discussed meant to serve as justification for recent and new achievements, and as foundation for further research. Exploiting the differential geometry of quantum dynamics under different scenarios helps to provide highly useful algorithms: (a) On an abstract level, gradient flows may establish the exact upper bounds of pertinent quality functions, i.e. upper bounds reachable within the underlying manifold of the state space dynamics; (b) in a second stage referring to a concrete experimental setting, gradient flows on the manifold of piecewise constant control amplitudes $\R^m$ may be set up to provide (approximations to) optimal control of quantum devices under realistic conditions. Illustrative examples and new applications are given relating to distance measures of pure-state entanglement. We establish the correspondence to best rank-1 approximations of higher-order tensors.

quant-ph↗

arXiv2006

Composite Dipolar Recoupling: Anisotropy Compensated Coherence Transfer in Solid-State NMR

The efficiency of dipole-dipole coupling driven coherence transfer experiments in solid-state NMR spectroscopy of powder samples is limited by dispersion of the orientation of the internuclear vectors relative to the external magnetic field. Here we introduce general design principles and resulting pulse sequences that approach full polarization transfer efficiency for all crystallite orientations in a powder in magic-angle-spinning experiments. The methods compensate for the defocusing of coherence due to orientation dependent dipolar coupling interactions and inhomogeneous radio-frequency fields. The compensation scheme is very simple to implement as a scaffold (comb) of compensating pulses in which the pulse sequence to be improved may be inserted. The degree of compensation can be adjusted and should be balanced as a compromise between efficiency and length of the overall pulse sequence. We show by numerical and experimental data that the presented compensation protocol significantly improves the efficiency of known dipolar recoupling solid-state NMR experiment.

quant-ph↗

arXiv2005

Optimal Control of Coupled Josephson Qubits

Quantum optimal control theory is applied to two and three coupled Josephson charge qubits. It is shown that by using shaped pulses a CNOT gate can be obtained with a trace fidelity > 0.99999 for the two qubits, and even when including higher charge states, the leakage is below 1%. Yet, the required time is only a fifth of the pioneering experiment [T. Yamamoto et al., Nature 425 (2003), 941] for otherwise identical parameters. The controls have palindromic smooth time courses representable by superpositions of a few harmonics. We outline schemes to generate these shaped pulses such as simple network synthesis. The approach is easy to generalise to larger systems as shown by a fast realisation of TOFFOLI's gate in three linearly coupled charge qubits. Thus it is to be anticipated that this method will find wide application in coherent quantum control of systems with finite degrees of freedom whose dynamics are Lie-algebraically closed.

quant-ph↗

arXiv2005

Optimal Control-Based Efficient Synthesis of Building Blocks of Quantum Algorithms Seen in Perspective from Network Complexity towards Time Complexity

In this paper, we demonstrate that optimal control algorithms can be used to speed up the implementation of modules of quantum algorithms or quantum simulations in networks of coupled qubits. The gain is most prominent in realistic cases, where the qubits are not all mutually coupled. Thus the shortest times obtained depend on the coupling topology as well as on the characteristicratio of the time scales for local controls {\em vs} non-local ({\em i.e.} coupling) evolutions in the specific experimental setting. Relating these minimal times to the number of qubits gives the tightest known upper bounds to the actual time complexity of the quantum modules. As will be shown, time complexity is a more realistic measure of the experimental cost than the usual gate complexity. In the limit of fast local controls (as {\em e.g.} in NMR), time-optimised realisations are shown for the quantum Fourier transform (QFT) and the multiply controlled {\sc not}-gate ({\sc c$^{n-1}$not}) in various coupling topologies of $n$ qubits. The speed-ups are substantial: in a chain of six qubits the quantum Fourier transform so far obtained by optimal control is more than eight times faster than the standard decomposition into controlled phase, Hadamard and {\sc swap} gates, while the {\sc c$^{n-1}$not}-gate for completely coupled network of six qubits is nearly seven times faster.

quant-ph↗

arXiv2004

Broadband Relaxation-Optimized Polarization Transfer in Magnetic Resonance

Many applications of magnetic resonance are limited by rapid loss of spin coherence caused by large transverse relaxation rates. In nuclear magnetic resonance (NMR) of large proteins, increased relaxation losses lead to poor sensitivity of experiments and increased measurement time. In this paper we develop broadband relaxation optimized pulse sequences (BB-CROP) which approach fundamental limits of coherence transfer efficiency in the presence of very general relaxation mechanisms that include cross-correlated relaxation. These broadband transfer schemes use new techniques of chemical shift refocusing (STAR echoes) that are tailored to specific trajectories of coupled spin evolution. We present simulations and experimental data indicating significant enhancement in the sensitivity of multi-dimensional NMR experiments of large molecules by use of these methods.

quant-ph↗

arXiv2003

Boundary of Quantum Evolution under Decoherence

Relaxation effects impose fundamental limitations on our ability to coherently control quantum mechanical phenomena. In this letter, we establish physical limits on how closely can a quantum mechanical system be steered to a desired target state in the presence of relaxation. In particular, we explicitly compute the maximum coherence or polarization that can be transferred between coupled nuclear spins in the presence of very general decoherence mechanisms that include cross-correlated relaxation. We give analytical expressions for the control laws (pulse sequences) which achieve these physical limits and provide supporting experimental evidence. Exploitation of cross-correlation effects has recently led to the development of powerful methods in NMR spectroscopy to study very large biomolecules in solution. We demonstrate with experiments that the optimal pulse sequences provide significant gains over these state of the art methods, opening new avenues for spectroscopy of much larger proteins. Surprisingly, in spite of very large relaxation rates, optimal control can transfer coherence without any loss when cross-correlated relaxation rates are tuned to auto-correlated relaxation rates.

quant-ph↗

arXiv2000

Rapid solution of problems by nuclear-magnetic-resonance quantum computation

We offer an improved method for using a nuclear-magnetic-resonance quantum computer (NMRQC) to solve the Deutsch-Jozsa problem. Two known obstacles to the application of the NMRQC are exponential diminishment of density-matrix elements with the number of bits, threatening weak signal levels, and the high cost of preparing a suitable starting state. A third obstacle is a heretofore unnoticed restriction on measurement operators available for use by an NMRQC. Variations on the function classes of the Deutsch-Jozsa problem are introduced, both to extend the range of problems advantageous for quantum computation and to escape all three obstacles to use of an NMRQC. By adapting it to one such function class, the Deutsch-Jozsa problem is made solvable without exponential loss of signal. The method involves an extra work bit and a polynomially more involved Oracle; it uses the thermal-equilibrium density matrix systematically for an arbitrary number of spins, thereby avoiding both the preparation of a pseudopure state and temporal averaging.

quant-ph↗

arXiv1999

Realization of a 5-bit NMR Quantum Computer Using a New Molecular Architecture

We demonstrate a five-bit nuclear-magnetic-resonance quantum computer that distinguishes among various functions on four bits, making use of quantum parallelism. Its construction draws on the recognition of the sufficiency of linear coupling along a chain of nuclear spins, the synthesis of a suitably coupled molecule, and the use of a multi-channel spectrometer.

quant-ph↗