Experimental Validation of Enhanced Information Capacity by Quantum Switch in Accordance with Thermodynamic Laws.

We experimentally probe the interplay of the quantum switch with the laws of thermodynamics. The quantum switch places two channels in a superposition of orders and may be applied to thermalizing channels. Quantum-switching thermal channels has been shown to give apparent violations of the second law. Central to these apparent violations is how quantum switching channels can increase the capacity to communicate information. We experimentally show this increase and how it is consistent with the laws of thermodynamics, demonstrating how thermodynamic resources are consumed. We use a nuclear magnetic resonance approach with coherently controlled interactions of nuclear spin qubits. We verify an analytical upper bound on the increase in capacity for channels that preserve energy and thermal states, and demonstrate that the bound can be exceeded for an energy-altering channel. We show that the switch can be used to take a thermal state to a state that is not thermal, while consuming free energy associated with the coherence of a control system. The results show how the switch can be incorporated into quantum thermodynamics experiments as an additional resource.

General limit to thermodynamic annealing performance.

Annealing has proven highly successful in finding minima in a cost landscape. Yet, depending on the landscape, systems often converge towards local minima rather than global ones. In this Letter, we analyze the conditions for which annealing is approximately successful in finite time. We connect annealing to stochastic thermodynamics to derive a general bound on the distance between the system state at the end of the annealing and the ground state of the landscape. This distance depends on the amount of state updates of the system and the accumulation of nonequilibrium energy, two protocol and energy landscape-dependent quantities which we show are in a trade-off relation. We describe how to bound the two quantities both analytically and physically. This offers a general approach to assess the performance of annealing from accessible parameters, both for simulated and physical implementations.

Bound on annealing performance from stochastic thermodynamics, with application to simulated annealing.

Annealing is the process of gradually lowering the temperature of a system to guide it towards its lowest energy states. In an accompanying paper [Y. Luo et al., Phys. Rev. E 108, L052105 (2023)10.1103/PhysRevE.108.L052105], we derived a general bound on annealing performance by connecting annealing with stochastic thermodynamics tools, including a speed limit on state transformation from entropy production. We here describe the derivation of the general bound in detail. In addition, we analyze the case of simulated annealing with Glauber dynamics in depth. We show how to bound the two case-specific quantities appearing in the bound, namely the activity, a measure of the number of microstate jumps, and the change in relative entropy between the state and the instantaneous thermal state, which is due to temperature variation. We exemplify the arguments by numerical simulations on the Sherrington-Kirkpatrick (SK) model of spin glasses.

Bifurcation behaviors shape how continuous physical dynamics solves discrete Ising optimization.

Simulating physical dynamics to solve hard combinatorial optimization has proven effective for medium- to large-scale problems. The dynamics of such systems is continuous, with no guarantee of finding optimal solutions of the original discrete problem. We investigate the open question of when simulated physical solvers solve discrete optimizations correctly, with a focus on coherent Ising machines (CIMs). Having established the existence of an exact mapping between CIM dynamics and discrete Ising optimization, we report two fundamentally distinct bifurcation behaviors of the Ising dynamics at the first bifurcation point: either all nodal states simultaneously deviate from zero (synchronized bifurcation) or undergo a cascade of such deviations (retarded bifurcation). For synchronized bifurcation, we prove that when the nodal states are uniformly bounded away from the origin, they contain sufficient information for exactly solving the Ising problem. When the exact mapping conditions are violated, subsequent bifurcations become necessary and often cause slow convergence. Inspired by those findings, we devise a trapping-and-correction (TAC) technique to accelerate dynamics-based Ising solvers, including CIMs and simulated bifurcation. TAC takes advantage of early bifurcated "trapped nodes" which maintain their sign throughout the Ising dynamics to reduce computation time effectively. Using problem instances from open benchmark and random Ising models, we validate the superior convergence and accuracy of TAC.

Thermodynamics of Quantum Switch Information Capacity Activation.

We address a new setting where the second law is under question: thermalizations in a quantum superposition of causal orders, enacted by the so-called quantum switch. This superposition has been shown to be associated with an increase in the communication capacity of the channels, yielding an apparent violation of the data-processing inequality and a possibility to separate hot from cold. We analyze the thermodynamics of this information capacity increasing process. We show how the information capacity increase is compatible with thermodynamics. We show that there may indeed be an information capacity increase for consecutive thermalizations obeying the first and second laws of thermodynamics if these are placed in an indefinite order and moreover that only a significantly bounded increase is possible. The increase comes at the cost of consuming a thermodynamic resource, the free energy of coherence associated with the switch.

Quantum speedup in the identification of cause-effect relations.

The ability to identify cause-effect relations is an essential component of the scientific method. The identification of causal relations is generally accomplished through statistical trials where alternative hypotheses are tested against each other. Traditionally, such trials have been based on classical statistics. However, classical statistics becomes inadequate at the quantum scale, where a richer spectrum of causal relations is accessible. Here we show that quantum strategies can greatly speed up the identification of causal relations. We analyse the task of identifying the effect of a given variable, and we show that the optimal quantum strategy beats all classical strategies by running multiple equivalent tests in a quantum superposition. The same working principle leads to advantages in the detection of a causal link between two variables, and in the identification of the cause of a given variable.

Enhanced Communication with the Assistance of Indefinite Causal Order.

In quantum Shannon theory, the way information is encoded and decoded takes advantage of the laws of quantum mechanics, while the way communication channels are interlinked is assumed to be classical. In this Letter, we relax the assumption that quantum channels are combined classically, showing that a quantum communication network where quantum channels are combined in a superposition of different orders can achieve tasks that are impossible in conventional quantum Shannon theory. In particular, we show that two identical copies of a completely depolarizing channel become able to transmit information when they are combined in a quantum superposition of two alternative orders. This finding runs counter to the intuition that if two communication channels are identical, using them in different orders should not make any difference. The failure of such intuition stems from the fact that a single noisy channel can be a random mixture of elementary, noncommuting processes, whose order (or lack thereof) can affect the ability to transmit information.

Efficient Quantum Compression for Ensembles of Identically Prepared Mixed States.

We present one-shot compression protocols that optimally encode ensembles of N identically prepared mixed states into O(logN) qubits. In contrast to the case of pure-state ensembles, we find that the number of encoding qubits drops down discontinuously as soon as a nonzero error is tolerated and the spectrum of the states is known with sufficient precision. For qubit ensembles, this feature leads to a 25% saving of memory space. Our compression protocols can be implemented efficiently on a quantum computer.