Search

DC-voltage-biased Josephson junctions have been recently employed in superconducting circuits for Hamiltonian engineering, demonstrating microwave amplification, single photon sources and entangled photon generation. Compared to more conventional approaches based on parametric pumps, this solution typically enables larger interaction strengths. In the context of quantum information, a two-to-one photon interaction can stabilize cat qubits, where bit-flip errors are exponentially suppressed, promising significant resource savings for quantum error correction. This work investigates how the DC bias approach to Hamiltonian engineering can benefit cat qubits. We find a simple circuit design that is predicted to showcase a two-to-one photon exchange rate larger than that of the parametric pump-based implementation while dynamically averaging typically resonant parasitic terms such as Kerr and cross Kerr. In addition to addressing qubit stabilization, we propose to use injection locking with a cat-qubit adapted frequency filter to prevent long-term drifts of the cat qubit angle associated to DC voltage noise. The whole scheme is simulated without rotating-wave approximations, highlighting for the first time the amplitude of related oscillatory effects in cat-qubit stabilization schemes. This study lays the groundwork for the experimental realization of such a circuit., Comment: 30 pages, 7 figures

The so-called ``adiabatic elimination'' of fast decaying degrees of freedom in open quantum systems can be performed with a series expansion in the timescale separation. The associated computations are significantly more difficult when the remaining degrees of freedom (center manifold) follow fast unitary dynamics instead of just being slow. This paper highlights how a formulation with Sylvester's equation and with adjoint dynamics leads to systematic, explicit expressions at high orders for settings of physical interest., Comment: Accepted paper at IEEE Conference on Decision and Control 2024

Between NISQ (noisy intermediate scale quantum) approaches without any proof of robust quantum advantage and fully fault-tolerant quantum computation, we propose a scheme to achieve a provable superpolynomial quantum advantage (under some widely accepted complexity conjectures) that is robust to noise with minimal error correction requirements. We choose a class of sampling problems with commuting gates known as sparse IQP (Instantaneous Quantum Polynomial-time) circuits and we ensure its fault-tolerant implementation by introducing the tetrahelix code. This new code is obtained by merging several tetrahedral codes (3D color codes) and has the following properties: each sparse IQP gate admits a transversal implementation, and the depth of the logical circuit can be traded for its width. Combining those, we obtain a depth-1 implementation of any sparse IQP circuit up to the preparation of encoded states. This comes at the cost of a space overhead which is only polylogarithmic in the width of the original circuit. We furthermore show that the state preparation can also be performed in constant depth with a single step of feed-forward from classical computation. Our construction thus exhibits a robust superpolynomial quantum advantage for a sampling problem implemented on a constant depth circuit with a single round of measurement and feed-forward.

Quantum bits (qubits) are prone to several types of errors due to uncontrolled interactions with their environment. Common strategies to correct these errors are based on architectures of qubits involving daunting hardware overheads. A hopeful path forward is to build qubits that are inherently protected against certain types of errors, so that the overhead required to correct remaining ones is significantly reduced. However, the foreseen benefit rests on a severe condition: quantum manipulations of the qubit must not break the protection that has been so carefully engineered. A recent qubit - the cat-qubit - is encoded in the manifold of metastable states of a quantum dynamical system, thereby acquiring continuous and autonomous protection against bit-flips. Here, in a superconducting circuit experiment, we implement a cat-qubit with bit-flip times exceeding 10 seconds. This is a four order of magnitude improvement over previous cat-qubit implementations. We prepare and image quantum superposition states, and measure phase-flip times above 490 nanoseconds. Most importantly, we control the phase of these quantum superpositions without breaking bit-flip protection. This experiment demonstrates the compatibility of quantum control and inherent bit-flip protection at an unprecedented level, showing the viability of these dynamical qubits for future quantum technologies.

We propose a reservoir design, composed of fixed dissipation operators acting each on few local subsystems, to stabilize an approximate GHZ state on n qubits. The main idea is to work out how a previously proposed sequence of two stabilization steps can be applied instead in appropriate (probabilistic) superposition. We examine alternatives to synchronize the superposition using local couplings only, thanks to a chain of "clock" ancillas or to additional levels on the data subsystems. The practical value of these alternatives depends on experimental constraints. They all feature a design tradeoff between approximate stabilization fidelity and protection against perturbations. These proposals illustrate how simple autonomous automata can be implemented in quantum reservoir engineering to replace sequential state preparation procedures. Encoding automaton actions via additional data levels only, appears particularly efficient in this context. Our analysis method, reducing the Lindblad master equation to a Markov chain on virtual output signals, may be of independent interest.

We propose a novel approach to generate, protect and control GKP qubits. It employs a microwave frequency comb parametrically modulating a Josephson circuit to enforce a dissipative dynamics of a high impedance circuit mode, autonomously stabilizing the finite-energy GKP code. The encoded GKP qubit is robustly protected against all dominant decoherence channels plaguing superconducting circuits but quasi-particle poisoning. In particular, noise from ancillary modes leveraged for dissipation engineering does not propagate at the logical level. In a state-of-the-art experimental setup, we estimate that the encoded qubit lifetime could extend two orders of magnitude beyond the break-even point, with substantial margin for improvement through progress in fabrication and control electronics. Qubit initialization, readout and control via Clifford gates can be performed while maintaining the code stabilization, paving the way toward the assembly of GKP qubits in a fault-tolerant quantum computing architecture., Comment: 66 pages, 20 figures, 1 table. Updated version: reorganization of the paper, several clarifications, new sections about ancilla noise propagation and protected measurement of Pauli operators

This paper discusses quantum adiabatic elimination, which is a model reduction technique for a composite Lindblad system consisting of a fast decaying sub-system coupled to another sub-system with a much slower timescale. Such a system features an invariant manifold that is close to the slow sub-system. This invariant manifold is reached subsequent to the decay of the fast degrees of freedom, after which the slow dynamics follow on it. By parametrizing invariant manifold, the slow dynamics can be simulated via a reduced model. To find the evolution of the reduced state, we perform the asymptotic expansion with respect to the timescale separation. So far, the second-order expansion has mostly been considered. It has then been revealed that the second-order expansion of the reduced dynamics is generally given by a Lindblad equation, which ensures complete positivity of the time evolution. In this paper, we present two examples where complete positivity of the reduced dynamics is violated with higher-order contributions. In the first example, the violation is detected for the evolution of the partial trace without truncation of the asymptotic expansion. The partial trace is not the only way to parametrize the slow dynamics. Concerning this non-uniqueness, it was conjectured in [R. Azouit, F. Chittaro, A. Sarlette, and P. Rouchon, Quantum Sci. Technol. 2, 044011 (2017)] that there exists a parameter choice ensuring complete positivity. With the second example, however, we refute this conjecture by showing that complete positivity cannot be restored in any choice of parametrization. We discuss these results in terms of unavoidable correlations, in the initial states on the invariant slow manifold, between the fast and the slow degrees of freedom., Comment: 12+15 pages, 5+2 figures. Major updates include the addition of Figures 1 and 5, new references, and the expansion of Section V

Bosonic cat qubits stabilized with a driven two-photon dissipation are systems with exponentially biased noise, opening the door to low-overhead, fault-tolerant and universal quantum computing. However, current gate proposals for such qubits induce substantial noise of the unprotected type, whose poor scaling with the relevant experimental parameters limits their practical use. In this work, we provide a new perspective on dissipative cat qubits by reconsidering the reservoir mode used to engineer the tailored two-photon dissipation, and show how it can be leveraged to mitigate gate-induced errors. Doing so, we introduce four new designs of high-fidelity and bias-preserving cat qubit gates, and compare them to the prevalent gate methods. These four designs should give a broad overview of gate engineering for dissipative systems with different and complementary ideas. In particular, we propose both already achievable low-error gate designs and longer-term implementations., Comment: 26 pages, 15 figures. All comments on the preprint are welcome

When a composite Lindblad system consists of weakly coupled sub-systems with fast and slow timescales, the description of slow dynamics can be simplified by discarding fast degrees of freedom. This model reduction technique is called adiabatic elimination. While second-order perturbative expansion with respect to the timescale separation has revealed that the evolution of a reduced state is completely positive, this paper presents an example exhibiting complete positivity violation in the fourth-order expansion. Despite the non-uniqueness of slow dynamics parametrization, we prove that complete positivity cannot be ensured in any parametrization. The violation stems from correlation in the initial state., Comment: 6 pages, submitted to IFAC for possible publication

Driven quantum nonlinear oscillators, while essential for quantum technologies, are generally prone to complex chaotic dynamics that fall beyond the reach of perturbative analysis. By focusing on subharmonic bifurcations of a harmonically driven oscillator, we provide a recipe for the choice of the oscillator's parameters that ensures a regular dynamical behavior independently of the driving strength. We show that this suppression of chaotic phenomena is compatible with a strong quantum nonlinear effect reflected by the confinement rate in the degenerate manifold spanned by stable subharmonic orbits.

Based on the stabilizer formalism underlying Quantum Error Correction (QEC), the design of an original Lindblad master equation for the density operator of a quantum harmonic oscillator is proposed. This Lindblad dynamics stabilizes exactly the finite-energy grid states introduced in 2001 by Gottesman, Kitaev and Preskill for quantum computation. Stabilization results from an exponential Lyapunov function with an explicit lower-bound on the convergence rate. Numerical simulations indicate the potential interest of such autonomous QEC in presence of non-negligible photon-losses., Comment: Submitted, 15 pages, 1 figures

Quantum dynamical decoupling is a procedure to cancel the effective coupling between two systems by applying sequences of fast actuations, under which the coupling Hamiltonian averages out to leading order(s). One of its prominent uses is to drive a target system in such a way as to decouple it from a less protected one. The present manuscript investigates the dual strategy: acting on a noisy "environment" subsystem such as to decouple it from a target system. The potential advantages are that actions on the environment commute with system operations, and that imprecisions in the decoupling actuation are harmless to the target. We consider two versions of environment-side decoupling: adding an imprecise Hamiltonian drive which stirs the environment components; and, increasing the decoherence rates on the environment. The latter can be viewed as driving the environment with pure noise and our conclusions establish how, maybe counterintuitively, isolating the environment from noise sources as much as possible is often not the best option. We explicitly analyze the induced decoherence on the target system and establish how it is influenced by the parameters in both cases. The analysis combines Lindbladian derivation, adiabatic elimination, and Floquet modeling in a way that may be of independent interest.

Quantum error correction with biased-noise qubits can drastically reduce the hardware overhead for universal and fault-tolerant quantum computation. Cat qubits are a promising realization of biased-noise qubits as they feature an exponential error bias inherited from their non-local encoding in the phase space of a quantum harmonic oscillator. To confine the state of an oscillator to the cat qubit manifold, two main approaches have been considered so far: a Kerr-based Hamiltonian confinement with high gate performances, and a dissipative confinement with robust protection against a broad range of noise mechanisms. We introduce a new combined dissipative and Hamiltonian confinement scheme based on two-photon dissipation together with a Two-Photon Exchange (TPE) Hamiltonian. The TPE Hamiltonian is similar to Kerr nonlinearity, but unlike the Kerr it only induces a bounded distinction between even- and odd-photon eigenstates, a highly beneficial feature for protecting the cat qubits with dissipative mechanisms. Using this combined confinement scheme, we demonstrate fast and bias-preserving gates with drastically improved performance compared to dissipative or Hamiltonian schemes. In addition, this combined scheme can be implemented experimentally with only minor modifications of existing dissipative cat qubit experiments., Comment: 24 pages, 18 figures

Error-correcting codes are usually envisioned to counter errors by operating unitary corrections depending on the projective measurement results of some syndrome observables. We here propose a way to use them in a more integrated way, where the error correction is applied continuously and autonomously by an engineered environment. We focus on a proposal for the repetition code that counters bit-flip errors, and how to scale up the network encoding a logical quantum bit, towards stronger information protection. The challenge has been to devise a network architecture which allows to autonomously correct higher-order errors, while remaining realistic towards experimental realization by avoiding all-to-all or all-to-one coupling.

When a two-level system -- a qubit -- is used as a probe of a larger system, it naturally leads to answering a single yes-no question about the system state. Here we propose a method where a single qubit is able to extract, not a single, but many bits of information about the photon number of a microwave resonator using continuous measurement. We realize a proof-of-principle experiment by recording the fluorescence emitted by a superconducting qubit reflecting a frequency comb, thus implementing multiplexed photon counting where the information about each Fock state -- from 0 to 8 -- is simultaneously encoded in independent measurement channels. Direct Wigner tomography of the quantum state of the resonator evidences the back-action of the measurement as well as the optimal information extraction parameters. Our experiment unleashes the full potential of quantum meters by replacing a sequential quantum measurements with simultaneous and continuous measurements separated in the frequency domain., Comment: This new version of the manuscript adds several results compared to the first versions

Adiabatic elimination is a perturbative model reduction technique based on timescale separation and often used to simplify the description of composite quantum systems. We here analyze a quantum experiment where the perturbative expansion can be carried out to arbitrary order, such that: (i) we can formulate in the end an exact reduced model in quantum form; (ii) as the series provides accuracy for ever larger parameter values, we can discard any condition on the timescale separation, thereby analyzing the intermediate regime where the actual experiment is performing best; (iii) we can clarify the role of some gauge degrees of freedom in this model reduction technique.

A quantum system interacts with its environment, if ever so slightly, no matter how much care is put into isolating it. As a consequence, quantum bits (qubits) undergo errors, putting dauntingly difficult constraints on the hardware suitable for quantum computation. New strategies are emerging to circumvent this problem by encoding a qubit non-locally across the phase space of a physical system. Since most sources of decoherence are due to local fluctuations, the foundational promise is to exponentially suppress errors by increasing a measure of this non-locality. Prominent examples are topological qubits which delocalize quantum information over real space and where spatial extent measures non-locality. In this work, we encode a qubit in the field quadrature space of a superconducting resonator endowed with a special mechanism that dissipates photons in pairs. This process pins down two computational states to separate locations in phase space. As we increase this separation, we measure an exponential decrease of the bit-flip rate while only linearly increasing the phase-flip rate. Since bit-flips are continuously and autonomously corrected at the single qubit level, only phase-flips are left to be corrected via a one-dimensional quantum error correction code. This exponential scaling demonstrates that resonators with non-linear dissipation are promising building blocks for universal fault-tolerant quantum computation with drastically reduced hardware overhead.

We present a novel continuous-time control strategy to exponentially stabilize an eigenstate of a Quantum Non-Demolition (QND) measurement operator. In open-loop, the system converges to a random eigenstate of the measurement operator. The role of the feedback is to prepare a prescribed QND eigenstate with unit probability. To achieve this we introduce the use of Brownian motion to drive the unitary control actions; the feedback loop just adapts the amplitude of this Brownian noise input as a function of the system state. Essentially, it "shakes" the system away from undesired eigenstates by applying strong noise there, while relying on the open-loop dynamics to progressively reach the target. We prove exponential convergence towards the target eigenstate using standard stochastic Lyapunov methods. The feedback scheme and its stability analysis suggest the use of an approximate filter which only tracks the populations of the eigenstates of the measurement operator. Such reduced filters should play an increasing role towards advanced quantum technologies.

We address the standard quantum error correction using the three-qubit bit-flip code, yet in continuous-time. This entails rendering a target manifold of quantum states globally attractive. Previous feedback designs could feature spurious equilibria, or resort to discrete kicks pushing the system away from these equilibria to ensure global asymptotic stability. We present a new approach that consists of introducing controls driven by Brownian motions. Unlike the previous methods, the resulting closed-loop dynamics can be shown to stabilize the target manifold exponentially. We further present a reduced-order filter formulation with classical probabilities. The exponential property is important to quantify the protection induced by the closed-loop error-correction dynamics against disturbances. We study numerically the performance of this control law and of the reduced filter., Comment: 7 pages, 3 figures. Minor modifications of the text and added references

This paper deals with the problem of string stability in a chain of acceleration-controlled vehicles. It is known that string stability cannot be achieved, with any linear controller, when the vehicles' control inputs are based on relative distances to a fixed number of predecessors. We extend the set of impossible settings by including elements like dynamic sensor parts and local inter-vehicular communication, as in cooperative adaptive cruise control. It is also known that a weaker form of string stability is achievable by adding absolute velocity measurements (e.g. "time-headway" policy). We show that a stronger property can also be achieved, provided steady-state control gain is infinite e.g. by using integral control.

This paper deals with the problem of string stability in a chain of acceleration-controlled vehicles, i.e. how input disturbances affect the distributed system for very long chains. There exist variants of string stability, like avoiding that a local disturbance gets amplified along the chain, or more strongly ensuring that the output vector's p-norm remains bounded for any bounded vector of input disturbances independently of the string length. They are all impossible to achieve with any linear controller if the vehicles only use relative information of few vehicles in front. Previous work has shown that adding absolute velocity into the controller, allows to at least avoid amplification of a local disturbance. In this paper, we consider the stronger definitions of string stability, under this same relaxation of using absolute velocity in the controller. We prove that the influence from input vector to output vector cannot be bounded independently of chain length in the most popular 2-norm sense, with any bounded stabilizing linear controller; while a proportional derivative (PD) controller can guarantee it in the practically relevant infinity-norm sense. Moreover, we identify the disturbance acting on the leader as the main issue for string stability., Comment: presented at IEEE-CDC 2018, Miami; more complete version and correcting a few typos

We provide a comprehensive impossibility result towards achieving string stability, i.e. keeping local relative errors in check with local controllers independently of the size of a chain of subsystems. We significantly extend existing results, from the LTI setting to any homogeneous controllers that can be nonlinear, time-varying, and locally communicating. We prove this impossibility for a set of definitions with various norm choices, including the $L_2$-type which is more standard in the literature and a BIBO type criterion. All results hold for a general discrete-time controller which should cover most applications.

We introduce a new tool for quantum algorithms called quantum fast-forwarding (QFF). The tool uses quantum walks as a means to quadratically fast-forward a reversible Markov chain. More specifically, with $P$ the Markov chain transition matrix and $D = \sqrt{P\circ P^T}$ its discriminant matrix ($D=P$ if $P$ is symmetric), we construct a quantum walk algorithm that for any quantum state $|v\rangle$ and integer $t$ returns a quantum state $\epsilon$-close to the state $D^t|v\rangle/\|D^t|v\rangle\|$. The algorithm uses $O\Big(\|D^t|v\rangle\|^{-1}\sqrt{t\log(\epsilon\|D^t|v\rangle\|)^{-1}}\Big)$ expected quantum walk steps and $O(\|D^t|v\rangle\|^{-1})$ expected reflections around $|v\rangle$. This shows that quantum walks can accelerate the transient dynamics of Markov chains, complementing the line of results that proves the acceleration of their limit behavior. We show that this tool leads to speedups on random walk algorithms in a very natural way. Specifically we consider random walk algorithms for testing the graph expansion and clusterability, and show that we can quadratically improve the dependency of the classical property testers on the random walk runtime. Moreover, our quantum algorithm exponentially improves the space complexity of the classical tester to logarithmic. As a subroutine of independent interest, we use QFF for determining whether a given pair of nodes lies in the same cluster or in separate clusters. This solves a robust version of $s$-$t$ connectivity, relevant in a learning context for classifying objects among a set of examples. The different algorithms crucially rely on the quantum speedup of the transient behavior of random walks., Comment: 24 pages, 5 pages appendix. 2nd version: exponentially improved error dependency, added application to graph property testing

We provide model reduction formulas for open quantum systems consisting of a target component which weakly interacts with a strongly dissipative environment. The time-scale separation between the uncoupled dynamics and the interaction allows to employ tools from center manifold theory and geometric singular perturbation theory to eliminate the variables associated to the environment (adiabatic elimination) with high-order accuracy. An important specificity is to preserve the quantum structure: reduced dynamics in (positive) Lindblad form and coordinate mappings in Kraus form. We provide formulas of the reduced dynamics. The main contributions of this paper are (i) to show how the decomposition of the environment into $K$ components enables its efficient treatment, avoiding the quantum curse of dimension; and (ii) to extend the results to the case where the target component is subject to Hamiltonian evolution at the fast time-scale. We apply our theory to a microwave superconducting quantum resonator subject to material losses, and we show that our reduced-order model can explain the transmission spectrum observed in a recent pump probe experiment.

This article provides a novel continuous-time state feedback control strategy to stabilize an eigenstate of the Hermitian measurement operator of a two-level quantum system. In open loop, such system converges stochastically to one of the eigenstates of the measurement operator. Previous work has proposed state feedback that destabilizes the undesired eigenstates and relies on a probabilistic analysis to prove convergence. In contrast, we here associate the state observer to an adaptive version of so-called Markovian feedback (essentially, proportional control) and we show that this leads to a global exponential convergence property with a strict Lyapunov function. Furthermore, besides the instantaneous measurement output, our controller only depends on the single coordinate along the measurement axis, which opens the way to replacing the full state observer by lower-complexity filters in the future., Comment: 8 pages, 2 figures

We compare discrete-time quantum walks on graphs to their natural classical equivalents, which we argue are lifted Markov chains, that is, classical Markov chains with added memory. We show that these can simulate quantum walks, allowing us to answer an open question on how the graph topology ultimately bounds their mixing performance, and that of any stochastic local evolution. The results highlight that speedups in mixing and transport phenomena are not necessarily diagnostic of quantum effects, although superdiffusive spreading is more prominent with quantum walks., Comment: main paper: 5 pages, 2 figures. supplemental material: 9 pages, 1 figure. comments welcome

Isoperimetric inequalities form a very intuitive yet powerful characterization of the connectedness of a state space, that has proven successful in obtaining convergence bounds. Since the seventies they form an essential tool in differential geometry, graph theory and Markov chain analysis. In this paper we use isoperimetric inequalities to construct a bound on the convergence time of any local probabilistic evolution that leaves its limit distribution invariant. We illustrate how this general result leads to new bounds on convergence times beyond the explicit Markovian setting, among others on quantum dynamics., Comment: 8 pages, 2 figures

Lifted Markov chains are Markov chains on graphs with added local "memory" and can be used to mix towards a target distribution faster than their memoryless counterparts. Upper and lower bounds on the achievable performance have been provided under specific assumptions. In this paper, we analyze which assumptions and constraints are relevant for mixing, and how changing these assumptions affects those bounds. Explicitly, we find that requesting mixing on either the original or the full lifted graph, and allowing for reducible lifted chains or not, have no essential influence on mixing time bounds. On the other hand, allowing for suitable initialization of the lifted dynamics and/or imposing invariance of the target distribution for any initialization do significantly affect the convergence performance. The achievable convergence speed for a lifted chain goes from diameter-time to no acceleration over a standard Markov chain, with conductance bounds limiting the effectiveness of the intermediate cases. In addition, we show that the relevance of imposing ergodic flows depends on the other criteria. The presented analysis allows us to clarify in which scenarios designing lifted dynamics can lead to better mixing, and provide a flexible framework to compare lifted walks with other acceleration methods., Comment: 15 pages, 5 figures. Comments welcome

This theoretical proposal investigates how resonant interactions occurring when a harmonic oscillator is fed with a stream of entangled qubits allow us to stabilize squeezed states of the harmonic oscillator. We show that the properties of the squeezed state stabilized by this engineered reservoir, including the squeezing strength, can be tuned at will through the parameters of the "input" qubits, albeit in tradeoff with the convergence rate. We also discuss the influence of the type of entanglement in the input, from a pairwise case to a more widely distributed case. This paper can be read in two ways: either as a proposal to stabilize squeezed states, or as a step towards treating quantum systems with time-entangled reservoir inputs.

We consider a composite open quantum system consisting of a fast subsystem coupled to a slow one. Using the time-scale separation, we develop an adiabatic elimination technique to derive at any order the reduced model describing the slow subsystem. The method, based on an asymptotic expansion and geometric singular perturbation theory, ensures the physical interpretation of the reduced second-order model by giving the reduced dynamics in a Lindblad form and the state reduction in Kraus map form. We give explicit second-order formulas for Hamiltonian or cascade coupling between the two subsystems. These formulas can be used to engineer, via a careful choice of the fast subsystem, the Hamiltonian and Lindbald operators governing the dissipative dynamics of the slow subsystem., Comment: Submitted

We propose a scheme to measure the parity of two distant qubits, while ensuring that losses on the quantum channel between them does not destroy coherences within the parity subspaces. This capability enables deterministic preparation of highly entangled qubit states whose fidelity is not limited by the transmission loss. The key observation is that for a probe electromagnetic field in a particular quantum state, namely a superposition of two coherent states of opposite phases, the transmission loss stochastically applies a near-unitary back-action on the probe state. This leads to a parity measurement protocol where the main effect of the transmission losses is a decrease in the measurement strength. By repeating the non-destructive (weak) parity measurement, one achieves a high-fidelity entanglement in spite of a significant transmission loss.

This paper applies the recently developed framework for integral control on nonlinear spaces to two non-standard cases. First, we show that the property of perfect target stabilization in presence of actuation bias holds also if this bias is state dependent. This might not be surprising, but for practical purposes it provides an easy way to robustly cancel nonlinear dynamics of the uncontrolled plant. We specifically illustrate this for robust stabilization of a pendulum at arbitrary angle, a problem posed as non-trivial by some colleagues. Second, as previous work has been restricted to systems with as many control inputs as configuration dimensions, we here provide results for integral control of a non-holonomic system. More precisely, we design robust steering control of a rigid body under velocity bias., Comment: submitted to NOLCOS conference 2016

This paper deals with the problem of string stability of interconnected systems with double-integrator open loop dynamics (e.g.~acceleration-controlled vehicles). We analyze an asymmetric bidirectional linear controller, where each vehicle is coupled solely to its immediate predecessor and to its immediate follower with different gains in these two directions. We show that in this setting, unlike with unidirectional or symmetric bidirectional controllers, string stability can be recovered when disturbances act only on a small ($N$-independent) set of leading vehicles. This improves existing results from the literature with this assumption. We also indicate that string stability with respect to arbitrarily distributed disturbances cannot be achieved with this controller., Comment: Version 2 corrects a typo in the proof, and adds the proof of stability before string stability. Slightly longer than published version

This paper studies the stochastic differential equation (SDE) associated to a two-level quantum system (qubit) subject to Hamiltonian evolution as well as unmonitored and monitored decoherence channels. The latter imply a stochastic evolution of the quantum state (density operator), whose associated probability distribution we characterize. We first show that for two sets of typical experimental settings, corresponding either to weak quantum non demolition measurements or to weak fluorescence measurements, the three Bloch coordinates of the qubit remain confined to a deterministically evolving surface or curve inside the Bloch sphere. We explicitly solve the deterministic evolution, and we provide a closed-form expression for the probability distribution on this surface or curve. Then we relate the existence in general of such deterministically evolving submanifolds to an accessibility question of control theory, which can be answered with an explicit algebraic criterion on the SDE. This allows us to show that, for a qubit, the above two sets of weak measurements are essentially the only ones featuring deterministic surfaces or curves.

We consider an open quantum system described by a Lindblad-type master equation with two times-scales. The fast time-scale is strongly dissipative and drives the system towards a low-dimensional decoherence-free space. To perform the adiabatic elimination of this fast relaxation, we propose a geometric asymptotic expansion based on the small positive parameter describing the time-scale separation. This expansion exploits geometric singular perturbation theory and center-manifold techniques. We conjecture that, at any order, it provides an effective slow Lindblad master equation and a completely positive parameterization of the slow invariant sub-manifold associated to the low-dimensional decoherence-free space. By preserving complete positivity and trace, two important structural properties attached to open quantum dynamics, we obtain a reduced-order model that directly conveys a physical interpretation since it relies on effective Lindbladian descriptions of the slow evolution. At the first order, we derive simple formulae for the effective Lindblad master equation. For a specific type of fast dissipation, we show how any Hamiltonian perturbation yields Lindbladian second-order corrections to the first-order slow evolution governed by the Zeno-Hamiltonian. These results are illustrated on a composite system made of a strongly dissipative harmonic oscillator, the ancilla, weakly coupled to another quantum system., Comment: 9 pages, one figure

We prove the incompatibility of certain desirable properties of community partition quality functions. Our results generalize the impossibility result of [Kleinberg 2003] by considering sets of weaker properties. In particular, we use an alternative notion to solve the central issue of the consistency property. (The latter means that modifying the graph in a way consistent with a partition should not have counterintuitive effects). Our results clearly show that community partition methods should not be expected to perfectly satisfy all ideally desired properties. We then proceed to show that this incompatibility no longer holds when slightly relaxed versions of the properties are considered, and we provide in fact examples of simple quality functions satisfying these relaxed properties. An experimental study of these quality functions shows a behavior comparable to established methods in some situations, but more debatable results in others. This suggests that defining a notion of good partition in communities probably requires imposing additional properties., Comment: 17 pages, 3 figures

We consider the model of a quantum harmonic oscillator governed by a Lindblad master equation where the typical drive and loss channels are multi-photon processes instead of single-photon ones; this implies a dissipation operator of order 2k with integer k>1 for a k-photon process. We prove that the corresponding PDE makes the state converge, for large time, to an invariant subspace spanned by a set of k selected basis vectors; the latter physically correspond to so-called coherent states with the same amplitude and uniformly distributed phases. We also show that this convergence features a finite set of bounded invariant functionals of the state (physical observables), such that the final state in the invariant subspace can be directly predicted from the initial state. The proof includes the full arguments towards the well-posedness of the corresponding dynamics in proper Banach spaces of Hermitian trace-class operators equipped with adapted nuclear norms. It relies on the Hille-Yosida theorem and Lyapunov convergence analysis., Comment: 20 pages, submitted

Tomography of a quantum state is usually based on positive operator-valued measure (POVM) and on their experimental statistics. Among the available reconstructions, the maximum-likelihood (MaxLike) technique is an efficient one. We propose an extension of this technique when the measurement process cannot be simply described by an instantaneous POVM. Instead, the tomography relies on a set of quantum trajectories and their measurement records. This model includes the fact that, in practice, each measurement could be corrupted by imperfections and decoherence, and could also be associated with the record of continuous-time signals over a finite amount of time. The goal is then to retrieve the quantum state that was present at the start of this measurement process. The proposed extension relies on an explicit expression of the likelihood function via the effective matrices appearing in quantum smoothing and solutions of the adjoint quantum filter. It allows to retrieve the initial quantum state as in standard MaxLike tomography, but where the traditional POVM operators are replaced by more general ones that depend on the measurement record of each trajectory. It also provides, aside the MaxLike estimate of the quantum state, confidence intervals for any observable. Such confidence intervals are derived, as the MaxLike estimate, from an asymptotic expansion of multi-dimensional Laplace integrals appearing in Bayesian Mean estimation. A validation is performed on two sets of experimental data: photon(s) trapped in a microwave cavity subject to quantum non-demolition measurements relying on Rydberg atoms; heterodyne fluorescence measurements of a superconducting qubit., Comment: 11 pages, 4 figures, submitted

We prove that a harmonic oscillator driven by Lindblad dynamics where the typical drive and loss channels are two-photon processes instead of single-photon ones, converges to a protected subspace spanned by two coherent states of opposite amplitude. We then characterize the slow dynamics induced by a perturbative single-photon loss on this protected subspace, by performing adiabatic elimination in the Lindbladian dynamics., Comment: submitted to IEEE-CDC 2015

It is known that polynomial filtering can accelerate the convergence towards average consensus on an undirected network. In this paper the gain of a second-order filtering is investigated. A set of graphs is determined for which consensus can be attained in finite time, and a preconditioner is proposed to adapt the undirected weights of any given graph to achieve fastest convergence with the polynomial filter. The corresponding cost function differs from the traditional spectral gap, as it favors grouping the eigenvalues in two clusters. A possible loss of robustness of the polynomial filter is also highlighted.

Previous papers have proposed to add memory registers to the dynamics of discrete-time linear systems in order to accelerate their convergence. In particular, it has been proved that adding one memory slot per agent allows faster convergence towards average consensus. We here prove that this situation \emph{cannot} be improved by adding more memory slots, when the knowledge about the self-adjoint linear map to be accelerated reduces to bounds on its extreme eigenvalues.

In this paper, we extend the popular integral control technique to systems evolving on Lie groups. More explicitly, we provide an alternative definition of "integral action" for proportional(-derivative)-controlled systems whose configuration evolves on a nonlinear space, where configuration errors cannot be simply added up to compute a definite integral. We then prove that the proposed integral control allows to cancel the drift induced by a constant bias in both first order (velocity) and second order (torque) control inputs for fully actuated systems evolving on abstract Lie groups. We illustrate the approach by 3-dimensional motion control applications., Comment: Resubmitted to Systems and Control Letters, February 2015

In this paper we propose a continuous-time, dissipative Markov dynamics that asymptotically drives a network of n-dimensional quantum systems to the set of states that are invariant under the action of the subsystem permutation group. The Lindblad-type generator of the dynamics is built with two-body subsystem swap operators, thus satisfying locality constraints, and preserve symmetric observables. The potential use of the proposed generator in combination with local control and measurement actions is illustrated with two applications: the generation of a global pure state and the estimation of the network size., Comment: submitted to MTNS 2014

This work interprets and generalizes consensus-type algorithms as switching dynamics leading to symmetrization of some vector variables with respect to the actions of a finite group. We show how the symmetrization framework we develop covers applications as diverse as consensus on probability distributions (either classical or quantum), uniform random state generation, and open-loop disturbance rejection by quantum dynamical decoupling. Robust convergence results are explicitly provided in a group-theoretic formulation, both for deterministic and for randomized dynamics. This indicates a way to directly extend the robustness and randomization properties of consensus-type algorithms to more fields of application.

We investigate performance bounds for feedback control of distributed plants where the controller can be centralized (i.e. it has access to measurements from the whole plant), but sensors only measure differences between neighboring subsystem outputs. Such "distributed sensing" can be a technological necessity in applications where system size exceeds accuracy requirements by many orders of magnitude. We formulate how distributed sensing generally limits feedback performance robust to measurement noise and to model uncertainty, without assuming any controller restrictions (among others, no "distributed control" restriction). A major practical consequence is the necessity to cut down integral action on some modes. We particularize the results to spatially invariant systems and finally illustrate implications of our developments for stabilizing the segmented primary mirror of the European Extremely Large Telescope., Comment: submitted to Automatica