Low frequency approximation for a class of linear quantum systems using cascade cavity realization

This paper presents a method for approximating a class of complex transfer function matrices corresponding to physically realizable complex linear quantum systems. The class of linear quantum systems under consideration includes interconnections of passive optical components such as cavities, beam-splitters, phase-shifters and interferometers. This approximation method builds on a previous result for cascade realization and gives good approximations at low frequencies.     

Finite horizon H∞ control for a class of sampled‐data linear quantum systems

In this paper, a finite horizon H^∞ control problem is solved for a class of linear quantum systems using a dynamic game approach for the case of sampled‐data measurements. The methodology adopted involves an equivalence between the quantum problem and two auxiliary classical problems. Copyright © 2016 John Wiley & Sons, Ltd.     

Robust H∞ controller design for a class of linear quantum systems with time delay

Time delay is frequently encountered in practical quantum feedback control systems with long transmission lines and measurement process. This paper is concerned with measurement‐based feedback H^∞ control for quantum systems with time delays appearing in the feedback loops. A physical model is presented for the quantum time‐delay system described by complex quantum stochastic differential equations. Quantum versions of some fundamental properties, such as dissipativity and stability, are discussed for this model. A numerical procedure is proposed for H^∞ controller synthesis, which can deal with a non‐convex optimization problem arising in the design processes. Copyright © 2016 John Wiley & Sons, Ltd.     

Robust H∞ estimation of uncertain linear quantum systems

We consider classical estimators for a class of physically realizable linear quantum systems. Optimal estimation using a complex Kalman filter for this problem has been previously explored. Here, we study robust H_∞ estimation for uncertain linear quantum systems. The estimation problem is solved by converting it to a suitably scaled H_∞ control problem. The solution is obtained in the form of two algebraic Riccati equations. Relevant examples involving dynamic squeezers are presented to illustrate the efficacy of our method. Copyright © 2016 John Wiley & Sons, Ltd.     

On the complexity of simulating space-bounded quantum computations

This paper studies the space-complexity of predicting the long-term behavior of a class of stochastic processes based on evolutions and measurements of quantum mechanical systems. These processes generalize a wide range of both quantum and classical space-bounded computations, including unbounded error computations given by machines having algebraic number transition amplitudes or probabilities. It is proved that any space s quantum stochastic process from this class can be simulated probabilistically with unbounded error in space O(s), and therefore deterministically in space O(s²).     

On standard control problems for systems with infinitely many unstable poles

In this paper, H^∞ control for a class of linear time invariant systems with infinitely many unstable poles is studied. An example of such a plant is a high gain system with delayed feedback. We formulate the problem via a generalized plant which consists of a rational transfer matrix and the inverse of a scalar (possibly irrational) inner function. It is shown that the problem can be decomposed into a finite-dimensional H^∞ control problem and an additional rank condition.     

求解量子系统时间最优控制问题的同伦算法研究

针对数值求解量子系统时间最优控制问题中反复调用梯度算法导致计算量大的问题,本文提出一类同伦算法用以快速求解量子系统的时间最优控制问题.与已有算法不同,这一算法通过引入同伦变量在减小终端时间的方向上搜索最优解.在这一算法中,可通过自由函数构造保真度函数对控制变量的梯度方向,也可通过方向函数引导算法的搜索方向,以加快算法的搜索速度.本文将这一算法用于求解量子系统态转移和门变换的时间最优控制问题.仿真结果表明这一算法的有效性.     

On improving control-loop robustness of model-matching controllers

This note first characterizes the class of all stabilizing controllers for a two-degree-of-Freedom control system which achieve a prescribed achievable transfer function. The characterization is in terms of an arbitrary proper stable transfer function. With this characterization, robust model matching is formulated as a standard H^∞-optimization problem. This means that standard controller designs for a nominal plant, such as linear-quadratic Gaussian ones, can be enhanced to give improved robustness properties using H^∞-design techniques.     

Quantum Algorithms for Learning and Testing Juntas

In this article we develop quantum algorithms for learning and testing juntas, i.e. Boolean functions which depend only on an unknown set of k out of n input variables. Our aim is to develop efficient algorithms: (1) whose sample complexity has no dependence on n, the dimension of the domain the Boolean functions are defined over; (2) with no access to any classical or quantum membership (“black-box”) queries. Instead, our algorithms use only classical examples generated uniformly at random and fixed quantum superpositions of such classical examples; (3) which require only a few quantum examples but possibly many classical random examples (which are considered quite “cheap” relative to quantum examples). Our quantum algorithms are based on a subroutine FS which enables sampling according to the Fourier spectrum of f; the FS subroutine was used in earlier work of Bshouty and Jackson on quantum learning. Our results are as follows: (1) We give an algorithm for testing k-juntas to accuracy ε that uses O(k/ϵ) quantum examples. This improves on the number of examples used by the best known classical algorithm. (2) We establish the following lower bound: any FS-based k-junta testing algorithm requires queries. (3) We give an algorithm for learning k-juntas to accuracy ϵ that uses O(ϵ⁻¹ k log k) quantum examples and O(2 ^k log(1/ϵ)) random examples. We show that this learning algorithm is close to optimal by giving a related lower bound. Supported in part by NSF award CCF-0347282, by NSF award CCF-0523664, and by a Sloan Foundation Fellowship.     

Equivalence of internal and external stability for a class of distributed systems

It is well known that for infinite-dimensional systems, exponential stability is not necessarily determined by the location of spectrum. Similarly, transfer functions in theH ^∞ space need not possess an exponentially stable realization. This paper addresses this problem for a class of impulse responses calledpseudorational. In this class, it is shown that the difficulty is related to classical complex analysis, especially that of entire functions of exponential type. The infinite-product representation for such entire functions makes it possible to prove that stability is indeed determined by the location of spectrum or by a modifiedH ^∞ condition. Examples are given to illustrate the theory. This research was supported in part by the Inamori Fourdation.     

Conservative linear systems,unitary colligations and Lax–Phillips scattering: multidimensional generalizations

Connections between conservative linear systems, Lax–Phillips scattering, and operator model theory are well known. A common thread in all the theories is a contractive, analytic, operator-valued function on the unit disc T(z) having a representation of the form T(z)?=?D?+?z C (I???zA)^?1 B, known as the transfer or frequency-response function in the system-theory community, the scattering function in the mathematical physics community, and the characteristic operator function in the operator theory community. Here we consider analogues of this circle of ideas in the more general setting of multidimensional systems/multi-evolution scattering systems/multivariable function-theoretic operator theory. Three particular extensions are discussed; from the point of view of system theory, these involve (1) a multidimensional linear system with transfer function a contractive analytic operator function on the unit polydisc in complex Euclidean space, (2) a non-commutative multidimensional linear system with evolution along a free semigroup and with transfer function equal to a formal power series in non-commuting indeterminants, and (3) an overdetermined multidimensional linear system with transfer function identified as a bundle mapping between two Hermitian vector bundles over an algebraic curve embedded in complex projective space. This survey updates an earlier survey by the first author appearing in 2000.     

Quantum Mechanical Search and Harmonic Perturbation

Perturbation theory in quantum mechanics studies how quantum systems interact with their environmental perturbations. Harmonic perturbation is a rare special case of time-dependent perturbations in which exact analysis exists. Some important technology advances, such as masers, lasers, nuclear magnetic resonance, etc., originated from it. Here we add quantum computation to this list with a theoretical demonstration. Based on harmonic perturbation, a quantum mechanical algorithm is devised to search the ground state of a given Hamiltonian. The intrinsic complexity of the algorithm is continuous and parametric in both time T and energy E. More precisely, the probability of locating a search target of a Hamiltonian in N-dimensional vector space is shown to be 1/(1 + c N E⁻²T⁻²) for some constant c. This result is optimal. As harmonic perturbation provides a different computation mechanism, the algorithm may suggest new directions in realizing quantum computers.      

Complete solution of the 4‐block H∞ control problem with infinite and finite jω‐axis zeros

This paper discusses the 4‐block H^∞ control problem with infinite and finite jω‐axis invariant zeros in the state‐space realizations of the transfer functions from the control input to the controlled output and from the disturbance input to the measurement output, where these realizations are induced from a stabilizable and detectable realization of the generalized plant. This paper extends the DGKF approach to the H^∞ control problem but permitting infinite and finite jω‐axis invariant zeros by using the eigenstructures related to these zeros. Necessary and sufficient conditions are presented for checking solvability through checking the stabilizing solutions of two reduced‐order Riccati equations and examining matrix norm conditions related to the jω‐axis zeros. The parameterization of all suitable controllers is given in terms of a linear fractional transformation involving a certain fixed transfer function matrix and together with a stable transfer function matrix with gain less than 1 which is free apart from satisfying certain interpolation conditions. Copyright © 2000 John Wiley & Sons, Ltd.     

PDα‐type iterative learning control for fractional‐order linear continuous‐time switched systems

For a class of fractional‐order linear continuous‐time switched systems specified by an arbitrary switching rule, this paper proposes a PD^α‐type fractional‐order iterative learning control algorithm. For systems disturbed by bounded measurement noise, the robustness of PD^α‐type algorithm is first discussed in the iteration domain and the tracking performance is analyzed. Next, a sufficient condition for monotone convergence of the algorithm is studied when external noise is absent. The results of analysis and simulation illustrate the feasibility and effectiveness of the proposed control algorithm.     

High fidelity and flexible quantum state transfer in the atom-coupled cavity hybrid system

We investigate a system composed of N coupled cavities (linear array) and two-level atoms interacting one at a time. Adjusting appropriately the atom-field detuning, and making the hopping rate of photons between neighboring cavities, A, greater than the atom-field coupling g (i.e. A ? N ^3/2 g), we can eliminate the interaction of the atom with the non-resonant normal modes reducing the dynamics to the interaction of the atom with only a single-mode. As an application of this interaction, we propose a two-step protocol for quantum communication of an arbitrary atomic quantum state between distant coupled cavities. In the ideal case, the coupled cavities system acts as a perfect quantum bus and we obtain a flexible and perfect quantum communication for any N. Considering the influence of dissipation, an interesting parity effect emerges and we still obtain a high fidelity quantum state transfer for an appreciable number of cavities with current experimental parameters. We also studied important sources of imperfections during the procedure.     

Circuit QED: implementation of the three-qubit refined Deutsch–Jozsa quantum algorithm

We propose a protocol to construct the 35 \(f\) -controlled phase gates of a three-qubit refined Deutsch–Jozsa (DJ) algorithm, by using single-qubit \(\sigma _z\) gates, two-qubit controlled phase gates, and two-target-qubit controlled phase gates. Using this protocol, we discuss how to implement the three-qubit refined DJ algorithm with superconducting transmon qutrits resonantly coupled to a single cavity. Our numerical calculation shows that implementation of this quantum algorithm is feasible within the present circuit QED technique. The experimental realization of this algorithm would be an important step toward more complex quantum computation in circuit QED.     

Quantum Error Correction of Time-correlated Errors

The complexity of the error correction circuitry forces us to design quantum error correction codes capable of correcting a single error per error correction cycle. Yet, time-correlated error are common for physical implementations of quantum systems; an error corrected during the previous cycle may reoccur later due to physical processes specific for each physical implementation of the qubits. In this paper, we study quantum error correction for a restricted class of time-correlated errors in a spin-boson model. The algorithm we propose allows the correction of two errors per error correction cycle, provided that one of them is time-correlated. The algorithm can be applied to any stabilizer code when the two logical qubits and are entangled states of 2 ⁿ basis states in .