相关论文: Stability of holonomic quantum computations

We present the amounts of information, fidelity, and reversibility obtained by arbitrary quantum measurements on completely unknown states. These quantities are expressed as functions of the singular values of a measurement operator…

We propose a method for the stabilisation of quantum computations (including quantum state storage). The method is based on the operation of projection into $\cal SYM$, the symmetric subspace of the full state space of $R$ redundant copies…

In systems considered for quantum computing, i.e., for control of quantum dynamics with the goal of processing information coherently, decoherence and deviation from pure quantum states, are the main obstacles to fault-tolerant error…

In idealized models of a quantum register and its environment, quantum information can be stored indefinitely by encoding it into a decoherence-free subspace (DFS). Nevertheless, perturbations to the idealized register-environment coupling…

Quantum feedback control is a technology which can be used to drive a quantum system into a predetermined eigenstate. In this article, sufficient conditions for the experiment parameters of a quantum feedback control process of a homodyne…

We calculate the trade-off between the quality of estimating the quantum state of an ensemble of identically prepared qubits and the minimum level of disturbance that has to be introduced by this procedure in quantum mechanics. The…

We study the stability of unitary quantum dynamics of composite systems (for example: central system + environment) with respect to weak interaction between the two parts. Unified theoretical formalism is applied to study different physical…

Homological stability has shown itself to be a powerful tool for the computation of homology of families of groups such as general linear groups, mapping class groups or automorphisms of free groups. We survey here tools and techniques for…

Quantum computing's potential is immense, promising super-polynomial reductions in execution time, energy use, and memory requirements compared to classical computers. This technology has the power to revolutionize scientific applications…

We introduce a stability criterion for quantum statistical ensembles describing macroscopic systems. An ensemble is called "stable" when a small number of local measurements cannot significantly modify the probability distribution of the…

It is important to study the behavior of a t-error correcting quantum code when the number of errors is greater than t, because it is likely that there are also small errors besides t large correctable errors. We give a lower bound for the…

Algorithmic stability is a central notion in learning theory that quantifies the sensitivity of an algorithm to small changes in the training data. If a learning algorithm satisfies certain stability properties, this leads to many important…

We study the problem of robust performance of quantum systems under structured uncertainties. A specific feature of closed (Hamiltonian) quantum systems is that their poles lie on the imaginary axis and that neither a coherent controller…

Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical…

We analyze the fidelity of a quantum simulation and we show that it displays fractal fluctuations iff the simulated dynamics is chaotic. This analysis allows us to investigate a given simulated dynamics without any prior knowledge. In the…

Experimentalists seeking to improve the coherent lifetimes of quantum bits have generally focused on mitigating decoherence mechanisms through, for example, improvements to qubit designs and materials, and system isolation from…

We have proved new estimates for the coherent control errors of quantum circuits used in quantum computing. These estimates essentially take into account the commutator properties of the Hamiltonians and are based on the formulas of the…

We provide a unified geometrical description for analyzing the stability of holonomic quantum gates in the presence of imprecise driving controls (parametric noise). We consider the situation in which these fluctuations do not affect the…

Control of quantum systems via time-varying external fields optimized to maximize a fidelity measure at a given time is a mainstay in modern quantum control. However, save for specific systems, current analysis techniques for such quantum…

Errors occurring on noisy hardware pose a key challenge to reliable quantum computing. Existing techniques such as error correction, mitigation, or suppression typically separate the error handling from the algorithm analysis and design. In…