Search arXivSearch

arXiv · 1107.4358

Robust quantum gates for systems subject to decoherence via optimal control: Markovian vs non-Markovian dynamics

Abstract

We study the implementation of one-, two-, and three-qubit quantum gates for interacting qubits using optimal control. Different Markovian and non-Markovian environments are compared and efficient optimisation algorithms utilising analytic gradient expressions and quasi-Newton updates are given for both cases. The performance of the algorithms is analysed for a large set of problems in terms of the fidelities attained and the observed convergence behaviour. New notions of success rate and success speed are introduced and density plots are utilised to study the effect of key parameters, such as gate operation times, and random variables, such as the initial fields required to start the iterative algorithm. Core characteristics of the optimal fields are statistically analysed. Substantial differences between Markovian and non-Markovian environments in terms of the possibilities for control and the control mechanisms are uncovered. In particular, in the Markovian case it is found that the optimal fields obtained without considering the environment cannot be improved substantially by taking the environment into account and the fidelities attained are determined mostly by the gate operation time as well as the overall strength of the environmental effects. Computation time is saved if the fields are pre-optimised neglecting decoherence. In the non-Markovian case, on the other hand, substantial improvements in the fidelities are observed when the details of the system-bath coupling are taken into account. In that case, field leakage is shown to be a significant issue which can make high gate fidelities impossible to obtain unless both the system and noise qubits are fully controlled.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Frederik Floether, Pierre de Fouquieres, Sophie Schirmer. 2012-05-28. Robust quantum gates for systems subject to decoherence via optimal control: Markovian vs non-Markovian dynamics. https://doi.org/10.1088/1367-2630%2F14%2F7%2F073023

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fermionic magic resources in disordered quantum spin chains

Fermionic non-Gaussianity quantifies a quantum state's deviation from a classically tractable free-fermionic description, constituting a necessary resource for computational quantum advantage. Here we use fermionic antiflatness (FAF) to measure this deviation across ergodic and many-body localized (MBL) regimes. We focus on the paradigmatic disordered spin-$1\!/2$ XXZ chain and its impurity variant with local interactions. Across highly excited eigenstates, FAF evolves from typical-state behavior at weak disorder to strongly suppressed values deep in the MBL regime, with volume-law scaling in the XXZ chain and an area-law bound in the impurity setting. Rare long-range cat-like eigenstates exhibit a pronounced enhancement of FAF, making it a sensitive diagnostic of mechanisms proposed to destabilize MBL. Starting from product states, we find that in the MBL regime FAF grows slowly in time, approaching saturation via a power-law relaxation. Overall, our results show that MBL suppresses fermionic non-Gaussianity, and the associated complexity beyond free fermions, while ergodicity restores it, motivating explorations of fermionic non-Gaussianity in other ergodicity-breaking phenomena.

quant-ph

Progressive Binarization - Pauli Correlation Encoding: a Continuation Method for Constrained Optimization

Pauli Correlation Encoding (PCE) reduces the qubit requirements of quantum optimization by embedding the problem variables into the expectation values of Pauli observables, so that the number of qubits can be much smaller than the number of variables. PCE has not yet been studied for constrained optimization. We extend it to constrained combinatorial problems, using the budget-constrained MinCut as a case study, and show that the standard formulation fails to reliably enforce the constraint: feasibility hinges on the binarization of the encoded variables, which depends sensitively on hyperparameters that are hard to tune and do not transfer across instances. To address this, we introduce Progressive-Binarization PCE (PB-PCE), an adaptive continuation scheme that progressively increases the binarization parameter while re-optimizing the circuit from the previous solution, driving the variables towards the binary domain. PB-PCE attains near-complete constraint satisfaction (88--100\%) and smaller cut sizes than standard PCE, with a number of stages (10--20) essentially independent of problem size, solving instances of up to 300 variables with only 9-qubit circuits.

quant-ph

A quantum model for synchronizing finite state transition systems

We propose a quantum model for finding a resetting input sequence (RS) which can take a finite state transition system (FA), to particular state independent of its current state. The complexity of finding such sequences for various types of FA can be NP-Hard or even PSPACE-Complete. To this end, we represent the FA states, inputs, and transition function in quantum space. Accordingly, we propose a model to represent the execution of an input sequence of a particular length $l$ starting form an initial FA state. The model is extended considering the application in superposition of all input sequences of length $l$ to an initial state of the FA. The model is further extended considering the application of all input sequences to all initial states of the FA capturing for every input sequence the collection (ordered list) of states reached by applying the sequence to all states of the FA. The amplitude amplification algorithm is then used as it combines similar collections of reached states while preserving all input sequences that reach these collections. A Grover search for a reached collection where its elements correspond to the same FA state provides a RS for the FA. Our approach offers a quadratic gain over the exponential complexity of traditional brute-force method, which is the only method that can be applied to a general FA class.

quant-ph