Full control by locally induced relaxation

Abstract

We demonstrate a scheme for controlling a large quantum system by acting on a small subsystem only. The local control is mediated to the larger system by some fixed coupling Hamiltonian. The scheme allows to transfer arbitrary and unknown quantum states from a memory on the large system (``upload access'') as well as the inverse (``download access''). We study sufficient conditions of the coupling Hamiltonian and give lower bounds on the fidelities for downloading and uploading.

4 pages, 2 figures

References in corpus (9)

• Randomizing quantum states: Constructions and applications
• Universal Control of Decoupled Quantum Systems
• Thermalizing Quantum Machines: Dissipation and Entanglement
• The problem of equilibration and the computation of correlation functions on a quantum computer
• Purification through Zeno-like Measurements
• Improved transfer of quantum information using a local memory
• Universal quantum interfaces
• The Generalized Lyapunov Theorem and its Application to Quantum Channels
• Strictly contractive quantum channels and physically realizable quantum computers

Cited by in corpus (74)

• Quantum control theory and applications: A survey
• Modeling and Control of Quantum Systems: An Introduction
• Zero forcing sets and controllability of dynamical systems defined on graphs
• Charge and spin transport in strongly correlated one-dimensional quantum systems driven far from equilibrium
• Local controllability of quantum networks
• Propagation time for zero forcing on a graph
• Ergodic and Mixing Quantum Channels in Finite Dimensions
• Heat transport in the $XXZ$ spin chain: from ballistic to diffusive regimes and dephasing enhancement
• Indirect Hamiltonian Identification through a small gateway
• Zero forcing, linear and quantum controllability for systems evolving on networks
• Thermalization and ergodicity in many-body open quantum systems
• Quantum state transfer and time-dependent disorder in Quantum Chains
• Control by quantum dynamics on graphs
• Symmetry & Controllability for Spin Networks with a Single-Node Control
• Logic circuits from zero forcing
• Structure identification and state initialization of spin networks with limited access
• Nondiscriminatory Propagation on Trees
• A lower bound on the zero forcing number
• Mediated Homogenization
• Variants on the minimum rank problem: A survey II
• Lindblad equation approach to the optimal working point in nonequilibrium stationary states of an interacting electronic one-dimensional system: Application to the spinless Hubbard chain in the clean and in the weakly disordered limit
• Throttling positive semidefinite zero forcing propagation time on graphs
• Quantum state preparation via engineered ancilla resetting
• Probabilistic Zero Forcing in Graphs
• Universal quantum uncertainty relations between non-ergodicity and loss of information
• The zero forcing polynomial of a graph
• Dilute measurement-induced cooling into many-body ground states
• Upper bounds on the k-forcing number of a graph
• Quantum control with spectral constraints
• High fidelity state transfer in binary tree spin networks
• Fractional Zero Forcing via Three-color Forcing Games
• Various methods of optimizing control pulses for quantum systems with decoherence
• Finding Traps in Non-linear Spin Arrays
• Characterizations of the Connected Forcing Number of a Graph
• Propagation time for probabilistic zero forcing
• Bounds on expected propagation time of probabilistic zero forcing
• Minimum rank and zero forcing number for butterfly networks
• On Zero Forcing Number of Graphs and Their Complements
• Exploring Non-Markovianity in Ergodic Channels: Measuring Memory Retention through Ergotropy
• Zero forcing in iterated line digraphs
• Using Markov chains to determine expected propagation time for probabilistic zero forcing
• Speeding up Quantum Annealing with Engineered Dephasing
• Local controllability of quantum systems
• Power propagation time and lower bounds for power domination number
• Translationally invariant conservation laws of local Lindblad equations
• Total Forcing Sets in Trees
• Dephasing enhanced transport in nonequilibrium strongly correlated quantum systems
• Universal Preparability of States and Asymptotic Completeness
• On the Complexity of the Positive Semidefinite Zero Forcing Number
• The relationship between $k$-forcing and $k$-power domination
• Uniform forcing and immune sets in graphs and hypergraphs
• Graphs with Extremal Connected Forcing Numbers
• Zero forcing number, constrained matchings and strong structural controllability
• Zero Forcing sets and Power Dominating sets of cardinality at most 2
• Quantum Defragmentation Algorithm
• A Short Proof for a Lower Bound on the Zero Forcing Number
• Extremal $k$-forcing sets in oriented graphs
• Power domination polynomials of graphs
• Failed zero forcing and critical sets on directed graphs
• Proof of a conjecture on the zero forcing number of a graph
• Optimal Sensor Placement in Power Grids: Power Domination, Set Covering, and the Neighborhoods of Zero Forcing Forts
• On the power propagation time of a graph
• Edge Forcing in Butterfly Networks
• Zero forcing parameters and minimum rank problems
• The zero forcing numbers and propagation times of gear graphs and helm graphs
• Decoherence Cancellation through Noise Interference
• Characterizing errors in parameter estimation by local measurements
• A Comparison between the Zero Forcing Number and the Strong Metric Dimension of Graphs
• On the Relationships between Zero Forcing Numbers and Certain Graph Coverings
• Propagation time for weighted zero forcing
• Failed power domination on graphs
• Multi-color forcing in graphs
• Maximum Nullity and Forcing Number on Graphs with Maximum Degree at most Three
• Note on Nordhaus-Gaddum problems for power domination