A strongly coupled Heisenberg chain provides an important channel for quantum communication through its many-body ground state. Yet, the nature of the effective interactions and the ability to mediate long-range entanglement differs significantly for chains of opposite parity. Here, we contrast the characters of even- and odd-size chains when they are coupled to external qubits. Additional parity effects emerge in both cases, depending on the positions of the attached qubits. Some striking results include (i) the emergence of maximal entanglement and (ii) spin-chain Ruderman-Kittel-Kasuya-Yosida interactions for qubits attached to an even chain, and (iii) the ability of chains of either parity to mediate qubit entanglement that is undiminished by distance.
A restricted Boltzmann machine is a generative probabilistic graphic network. A probability of finding the network in a certain configuration is given by the Boltzmann distribution. Given training data, its learning is done by optimizing the parameters of the energy function of the network. In this paper, we analyze the training process of the restricted Boltzmann machine in the context of statistical physics. As an illustration, for small size bar-and-stripe patterns, we calculate thermodynamic quantities such as entropy, free energy, and internal energy as a function of the training epoch. We demonstrate the growth of the correlation between the visible and hidden layers via the subadditivity of entropies as the training proceeds. Using the Monte-Carlo simulation of trajectories of the visible and hidden vectors in the configuration space, we also calculate the distribution of the work done on the restricted Boltzmann machine by switching the parameters of the energy function. We discuss the Jarzynski equality which connects the path average of the exponential function of the work and the difference in free energies before and after training.
Random circuit sampling, the task of sampling bit strings from a random unitary operator, has been implemented to demonstrate quantum advantage on the Sycamore quantum processor with 53 qubits and on the Zuchongzhi quantum processor with 56 and 61 qubits. Recently, it was claimed that classical computers using tensor network simulation could catch on to current noisy quantum processors for random circuit sampling. While the linear cross-entropy benchmark fidelity was used to certify all these claims, it may not capture statistical properties of outputs in detail. Here, we compare the bit strings sampled from classical computers using tensor network simulation by Pan et al. [F. Pan, K. Chen, and P. Zhang, Phys. Rev. Lett. 129, 090502 (2022)] and by Kalachev et al. [G. Kalachev, P. Panteleev, P. Zhou, and M.-H. Yung, arXiv:2112.15083] with the bit strings from the Sycamore quantum processor. It is shown that all of Kalachev et al.'s samples passed the NIST random number tests. The heat maps of bit strings show that Pan et al.'s and Kalachev et al.'s samples are quite different from the Sycamore or Zuchongzhi samples. The analysis with the Marchenko-Pastur distribution and the Wasssertein distances demonstrates that Kalachev et al.'s samples are statistically closer to the Sycamore samples than Pan et al.'s while the three datasets have similar values for the linear cross-entropy fidelity. Our finding implies that further study is needed to certify or beat the claims of quantum advantage using random circuit sampling.
Typical experimental implementations of single-qubit gates involve two or three fixed rotation axes and up to three rotation steps. In this work, we prove that if the rotation axes can be tuned arbitrarily in a fixed plane, then two rotation steps are sufficient for implementing a single-qubit gate, and one rotation step is sufficient for implementing a state transformation. As concrete examples, we demonstrate two-step single-qubit gate implementations in two different physical qubit systems: (i) a transmon superconducting qubit coupled to an external microwave drive, such as a transmission line; and (ii) a quantum-dot based exchange-only qubit encoded in a three-spin block. These results provide a significant speedup for many common gate implementations, such as Rabi oscillations with phase control.
We investigate the quantum thermodynamics of two quantum systems, a two-level system and a four-level quantum photocell, each driven by photon pulses as a quantum heat engine. We set these systems to be in thermal contact only with a cold reservoir while the heat (energy) source, conventionally given from a hot thermal reservoir, is supplied by a sequence of photon pulses. The dynamics of each system is governed by a coherent interaction due to photon pulses in terms of the Jaynes-Cummings Hamiltonian together with the system-bath interaction described by the Lindblad master equation. We calculate the thermodynamic quantities for the two-level system and the quantum photocell including the change in system energy, the power delivered by photon pulses, the power output to an external load, the heat dissipated to a cold bath, and the entropy production. We thereby demonstrate how a quantum photocell in the cold bath can operate as a continuum quantum heat engine with a sequence of photon pulses continuously applied. We specifically introduce the power efficiency of the quantum photocell in terms of the ratio of output power delivered to an external load with current and voltage to the input power delivered by the photon pulse. Our study indicates a possibility that a quantum system driven by external fields can act as an efficient quantum heat engine under non-equilibrium thermodynamics.
Random circuit sampling, the task to sample bit strings from a random unitary operator, has been performed to demonstrate quantum advantage on the Sycamore quantum processor with 53 qubits and on the Zuchongzhi quantum processor with 56 and 61 qubits. Recently, it has been claimed that classical computers using tensor network simulation could catch on current noisy quantum processors for random circuit sampling. While the linear cross entropy benchmark fidelity is used to certify all these claims, it may not capture in detail statistical properties of outputs. Here, we compare the bit strings sampled from classical computers using tensor network simulation by Pan et al. [Phys. Rev. Lett. 129, 090502 (2022)] and by Kalachev et al. [arXiv:2112.15083 (2021)] and from the Sycamore and Zuchongzhi quantum processors. It is shown that all Kalachev et al.'s samples pass the NIST random number tests. The heat maps of bit strings show that Pan et al.'s and Kalachev et al.'s samples are quite different from the Sycamore or Zuzhongzhi samples. The analysis with the Marchenko-Pastur distribution and the Wasssertein distances demonstrates that Kalachev et al.'s samples are statistically close to the Sycamore samples than Pan et al.'s while the three datasets have similar values of the linear cross entropy fidelity. Our finding implies that further study is needed to certify or beat the claims of quantum advantage for random circuit sampling.