arXiv subjects

Christian Arenz

Publications and source records attributed to Christian Arenz.

At least 37 records · Page 2Linked to original sources

arXiv2023

Robustness of random-control quantum-state tomography

In a recently demonstrated quantum-state tomography scheme [Phys. Rev. Lett. 124, 010405 (2020)], a random control field is locally applied to a multipartite system to reconstruct the full quantum state of the system through single-observable measurements. Here, we analyze the robustness of such a tomography scheme against measurement errors. We characterize the sensitivity to measurement errors using the logarithm of the condition number of a linear system that fully describes the tomography process. Using results from random matrix theory we derive the scaling law of the logarithm of this condition number with respect to the system size when Haar-random evolutions are considered. While this expression is independent on how Haar randomness is created, we also perform numerical simulations to investigate the temporal behavior of the robustness for two specific quantum systems that are driven by a single random control field. Interestingly, we find that before the mean value of the logarithm of the condition number as a function of the driving time asymptotically approaches the value predicted for a Haar-random evolution, it reaches a plateau whose length increases with the system size.

quant-ph↗

arXiv2023

Quantum tracking control of the orientation of symmetric top molecules

The goal of quantum tracking control is to identify shaped fields to steer observable expectation values along designated time-dependent tracks. The fields are determined via an iteration-free procedure, which is based on inverting the underlying dynamical equations governing the controlled observables. In this article, we generalize the ideas in Phys. Rev. A 98, 043429 (2018) to the task of orienting symmetric top molecules in 3D. To this end, we derive equations for the control fields capable of directly tracking the expected value of the 3D dipole orientation vector along a desired path in time. We show this framework can be utilized for tracking the orientation of linear molecules as well, and present numerical illustrations of these principles for symmetric top tracking control problems.

quant-ph↗

arXiv2021

Progress toward favorable landscapes in quantum combinatorial optimization

The performance of variational quantum algorithms relies on the success of using quantum and classical computing resources in tandem. Here, we study how these quantum and classical components interrelate. In particular, we focus on algorithms for solving the combinatorial optimization problem MaxCut, and study how the structure of the classical optimization landscape relates to the quantum circuit used to evaluate the MaxCut objective function. In order to analytically characterize the impact of quantum features on the critical points of the landscape, we consider a family of quantum circuit ansätze composed of mutually commuting elements. We identify multiqubit operations as a key resource and show that overparameterization allows for obtaining favorable landscapes. Namely, we prove that an ansatz from this family containing exponentially many variational parameters yields a landscape free of local optima for generic graphs. However, we further prove that these ansätze do not offer superpolynomial advantages over purely classical MaxCut algorithms. We then present a series of numerical experiments illustrating that noncommutativity and entanglement are important features for improving algorithm performance.

quant-ph↗

arXiv2021

Assessing three closed-loop learning algorithms by searching for high-quality quantum control pulses

Designing a high-quality control is crucial for reliable quantum computation. Among the existing approaches, closed-loop leaning control is an effective choice. Its efficiency depends on the learning algorithm employed, thus deserving algorithmic comparisons for its practical applications. Here, we assess three representative learning algorithms, including GRadient Ascent Pulse Engineering (GRAPE), improved Nelder-Mead (NMplus) and Differential Evolution (DE), by searching for high-quality control pulses to prepare the Bell state. We first implement each algorithm experimentally in a nuclear magnetic resonance system and then conduct a numerical study considering the impact of some possible significant experimental uncertainties. The experiments report the successful preparation of the high-fidelity target state with different convergence speeds by the three algorithms, and these results coincide with the numerical simulations when potential uncertainties are negligible. However, under certain significant uncertainties, these algorithms possess distinct performance with respect to their resulting precision and efficiency. This study provides insight to aid in the practical application of different closed-loop learning algorithms in realistic physical scenarios.

quant-ph↗

arXiv2021

From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms

The last decade has witnessed remarkable progress in the development of quantum technologies. Although fault-tolerant devices likely remain years away, the noisy intermediate-scale quantum devices of today may be leveraged for other purposes. Leading candidates are variational quantum algorithms (VQAs), which have been developed for applications including chemistry, optimization, and machine learning, but whose implementations on quantum devices have yet to demonstrate improvements over classical capabilities. In this Perspective, we propose a variety of ways that the performance of VQAs could be informed by quantum optimal control theory. To set the stage, we identify VQAs and quantum optimal control as formulations of variational optimization at the circuit level and pulse level, respectively, where these represent just two levels in a broader hierarchy of abstractions that we consider. In this unified picture, we suggest several ways that the different levels of abstraction may be connected, in order to facilitate the application of quantum optimal control theory to VQA challenges associated with ansatz selection, optimization landscapes, noise, and robustness. A major theme throughout is the need for sufficient control resources in VQA implementations; we discuss different ways this need can manifest, outline a variety of open questions, and conclude with a look to the future.

quant-ph↗

arXiv2020

Drawing together control landscape and tomography principles

The ability to control quantum systems using shaped fields as well as to infer the states of such controlled systems from measurement data are key tasks in the design and operation of quantum devices. Here we associate the success of performing both tasks to the structure of the underlying control landscape. We relate the ability to control and reconstruct the full state of the system to the absence of singular controls, and show that for sufficiently long evolution times singular controls rarely occur. Based on these findings, we describe a learning algorithm for finding optimal controls that makes use of measurement data obtained from partially accessing the system. Open challenges stemming from the concentration of measure phenomenon in high dimensional systems are discussed.

quant-ph↗

arXiv2020

Amplification of quadratic Hamiltonians

Speeding up the dynamics of a quantum system is of paramount importance for quantum technologies. However, in finite dimensions and without full knowledge of the details of the system, it is easily shown to be impossible. In contrast we show that continuous variable systems described by a certain class of quadratic Hamiltonians can be sped up without such detailed knowledge. We call the resultant procedure Hamiltonian amplification (HA). The HA method relies on the application of local squeezing operations allowing for amplifying even unknown or noisy couplings and frequencies by acting on individual modes. Furthermore, we show how to combine HA with dynamical decoupling to achieve amplified Hamiltonians that are free from environmental noise. Finally, we illustrate a significant reduction in gate times of cavity resonator qubits as one potential use of HA.

quant-ph↗

arXiv2020

Combining the synergistic control capabilities of modelling and experiments: illustration of finding a minimum time quantum objective

A common way to manipulate a quantum system, for example spins or artificial atoms, is to use properly tailored control pulses. In order to accomplish quantum information tasks before coherence is lost, it is crucial to implement the control in the shortest possible time. Here we report the near time-optimal preparation of a Bell state with fidelity higher than $99\%$ in an NMR experiment, which is feasible by combining the synergistic capabilities of modelling and experiments operating in tandem. The pulses preparing the Bell state are found by experiments that are recursively assisted with a gradient-based optimization algorithm working with a model. Thus, we explore the interplay between model-based numerical optimal design and experimental-based learning control. Utilizing the balanced synergism between the dual approaches should have broad applications for accelerating the search for optimal quantum controls.

quant-ph↗

arXiv2020

An upper bound on the time required to implement unitary operations

We derive an upper bound for the time needed to implement a generic unitary transformation in a $d$ dimensional quantum system using $d$ control fields. We show that given the ability to control the diagonal elements of the Hamiltonian, which allows for implementing any unitary transformation under the premise of controllability, the time $T$ needed is upper bounded by $T\leq \frac{πd^{2}(d-1)}{2g_{\text{min}}}$ where $g_{\text{min}}$ is the smallest coupling constant present in the system. We study the tightness of the bound by numerically investigating randomly generated systems, with specific focus on a system consisting of $d$ energy levels that interact in a tight-binding like manner.

quant-ph↗

arXiv2020

Complete Quantum-State Tomography with a Local Random Field

Single-qubit measurements are typically insufficient for inferring arbitrary quantum states of a multi-qubit system. We show that if the system can be fully controlled by driving a single qubit, then utilizing a local random pulse is almost always sufficient for complete quantum-state tomography. Experimental demonstrations of this principle are presented using a nitrogen-vacancy (NV) center in diamond coupled to a nuclear spin, which is not directly accessible. We report the reconstruction of a highly entangled state between the electron and nuclear spin with fidelity above 95%, by randomly driving and measuring the NV-center electron spin only. Beyond quantum-state tomography, we outline how this principle can be leveraged to characterize and control quantum processes in cases where the system model is not known.

quant-ph↗

arXiv2018

Quantum Control Landscape of Bipartite Systems

The control landscape of a quantum system $A$ interacting with another quantum system $B$ is studied. Only system $A$ is accessible through time dependent controls, while system B is not accessible. The objective is to find controls that implement a desired unitary transformation on $A$, regardless of the evolution on $B$, at a sufficiently large final time. The freedom in the evolution on $B$ is used to define an \emph{extended control landscape} on which the critical points are investigated in terms of kinematic and dynamic gradients. A spectral decomposition of the corresponding extended unitary system simplifies the landscape analysis which provides: (i) a sufficient condition on the rank of the dynamic gradient of the extended landscape that guarantees a trap free search for the final time unitary matrix of system $A$, and (ii) a detailed decomposition of the components of the overall dynamic gradient matrix. Consequently, if the rank condition is satisfied, a gradient algorithm will find the controls that implements the target unitary on system $A$. It is shown that even if the dynamic gradient with respect to the controls alone is not full rank, the additional flexibility due to the parameters that define the extended landscape still can allow for the rank condition of the extended landscape to hold. Moreover, satisfaction of the latter rank condition subsumes any assumptions about controllability, reachability and control resources. Here satisfaction of the rank condition is taken as an assumption. The conditions which ensure that it holds remain an open research question. We lend some numerical support with two common examples for which the rank condition holds.

quant-ph↗

arXiv2018

Controlling qubit networks in polynomial time

Future quantum devices often rely on favourable scaling with respect to the system components. To achieve desirable scaling, it is therefore crucial to implement unitary transformations in an efficient manner. We develop an upper bound for the minimum time required to implement a unitary transformation on a generic qubit network in which each of the qubits is subject to local time dependent controls. The set of gates is characterized that can be implemented in a time that scales at most polynomially in the number of qubits. Furthermore, we show how qubit systems can be concatenated through controllable two body interactions, making it possible to implement the gate set efficiently on the combined system. Finally a system is identified for which the gate set can be implemented with fewer controls. The considered model is particularly important, since it describes electron-nuclear spin interactions in NV centers.

quant-ph↗

arXiv2018

Dependence of the Quantum Speed Limit on System Size and Control Complexity

We extend the work in New J. Phys. 19, 103015 (2017) by deriving a lower bound for the minimum time necessary to implement a unitary transformation on a generic, closed quantum system with an arbitrary number of classical control fields. This bound is explicitly analyzed for a specific N-level system similar to those used to represent simple models of an atom, or the first excitation sector of a Heisenberg spin chain, both of which are of interest in quantum control for quantum computation. Specifically, it is shown that the resultant bound depends on the dimension of the system, and on the number of controls used to implement a specific target unitary operation. The value of the bound determined numerically, and an estimate of the true minimum gate time are systematically compared for a range of system dimension and number of controls; special attention is drawn to the relationship between these two variables. It is seen that the bound captures the scaling of the minimum time well for the systems studied, and quantitatively is correct in the order of magnitude.

quant-ph↗

arXiv2017

The roles of drift and control field constraints upon quantum control speed limits

In this work we derive a lower bound for the minimum time required to implement a target unitary transformation through a classical time-dependent field in a closed quantum system. The bound depends on the target gate, the strength of the internal Hamiltonian and the highest permitted control field amplitude. These findings reveal some properties of the reachable set of operations, explicitly analyzed for a single qubit. Moreover, for fully controllable systems, we identify a lower bound for the time at which all unitary gates become reachable. We use numerical gate optimization in order to study the tightness of the obtained bounds. It is shown that in the single qubit case our analytical findings describe the relationship between the highest control field amplitude and the minimum evolution time remarkably well. Finally, we discuss both challenges and ways forward for obtaining tighter bounds for higher dimensional systems, offering a discussion about the mathematical form and the physical meaning of the bound.

quant-ph↗

arXiv2017

Dynamical Decoupling of Unbounded Hamiltonians

We investigate the possibility to suppress interactions between a finite dimensional system and an infinite dimensional environment through a fast sequence of unitary kicks on the finite dimensional system. This method, called dynamical decoupling, is known to work for bounded interactions, but physical environments such as bosonic heat baths are usually modelled with unbounded interactions, whence here we initiate a systematic study of dynamical decoupling for unbounded operators. We develop a sufficient decoupling criterion for arbitrary Hamiltonians and a necessary decoupling criterion for semibounded Hamiltonians. We give examples for unbounded Hamiltonians where decoupling works and the limiting evolution as well as the convergence speed can be explicitly computed. We show that decoupling does not always work for unbounded interactions and provide both physically and mathematically motivated examples.

quant-ph↗

arXiv2017

Dynamical Decoupling and Homogenization of continuous variable systems

For finite-dimensional quantum systems, such as qubits, a well established strategy to protect such systems from decoherence is dynamical decoupling. However many promising quantum devices, such as oscillators, are infinite dimensional, for which the question if dynamical decoupling could be applied remained open. Here we first show that not every infinite-dimensional system can be protected from decoherence through dynamical decoupling. Then we develop dynamical decoupling for continuous variable systems which are described by quadratic Hamiltonians. We identify a condition and a set of operations that allow us to map a set of interacting harmonic oscillators onto a set of non-interacting oscillators rotating with an averaged frequency, a procedure we call homogenization. Furthermore we show that every quadratic system-environment interaction can be suppressed with two simple operations acting only on the system. Using a random dynamical decoupling or homogenization scheme, we develop bounds that characterize how fast we have to work in order to achieve the desired uncoupled dynamics. This allows us to identify how well homogenization can be achieved and decoherence can be suppressed in continuous variable systems.

quant-ph↗

arXiv2017

Lindbladian purification

In a recent work [D. K. Burgarth et al., Nat. Commun. 5, 5173 (2014)] it was shown that a series of frequent measurements can project the dynamics of a quantum system onto a subspace in which the dynamics can be more complex. In this subspace even full controllability can be achieved, although the controllability over the system before the projection is very poor since the control Hamiltonians commute with each other. We can also think of the opposite: any Hamiltonians of a quantum system, which are in general noncommutative with each other, can be made commutative by embedding them in an extended Hilbert space, and thus the dynamics in the extended space becomes trivial and simple. This idea of making noncommutative Hamiltonians commutative is called "Hamiltonian purification." The original noncommutative Hamiltonians are recovered by projecting the system back onto the original Hilbert space through frequent measurements. Here we generalize this idea to open-system dynamics by presenting a simple construction to make Lindbladians, as well as Hamiltonians, commutative on a larger space with an auxiliary system. We show that the original dynamics can be recovered through frequently measuring the auxiliary system in a non-selective way. Moreover, we provide a universal pair of Lindbladians which describes an "accessible" open quantum system for generic system sizes. This allows us to conclude that through a series of frequent non-selective measurements a nonaccessible open quantum system generally becomes accessible. This sheds further light on the role of measurement backaction on the control of quantum systems.

quant-ph↗

arXiv2016

Fast microwave-driven three-qubit gates for cavity-coupled superconducting qubits

Although single and two-qubit gates are sufficient for universal quantum computation, single-shot three-qubit gates greatly simplify quantum error correction schemes and algorithms. We design fast, high-fidelity three-qubit entangling gates based on microwave pulses for transmon qubits coupled through a superconducting resonator. We show that when interqubit frequency differences are comparable to single-qubit anharmonicities, errors occur primarily through a single unwanted transition. This feature enables the design of fast three-qubit gates based on simple analytical pulse shapes that are engineered to minimize such errors. We show that a three-qubit ccz gate can be performed in 260 ns with fidelities exceeding $99.38\%$, or $99.99\%$ with numerical optimization.

cond-mat.mes-hall↗