01856nas a2200121 4500008004100000245005700041210005700098260001400155520150000169100001301669700001501682856003701697 2021 eng d00aExploiting anticommutation in Hamiltonian simulation0 aExploiting anticommutation in Hamiltonian simulation c3/14/20213 a

Quantum computing can efficiently simulate Hamiltonian dynamics of many-body quantum physics, a task that is generally intractable with classical computers. The hardness lies at the ubiquitous anti-commutative relations of quantum operators, in corresponding with the notorious negative sign problem in classical simulation. Intuitively, Hamiltonians with more commutative terms are also easier to simulate on a quantum computer, and anti-commutative relations generally cause more errors, such as in the product formula method. Here, we theoretically explore the role of anti-commutative relation in Hamiltonian simulation. We find that, contrary to our intuition, anti-commutative relations could also reduce the hardness of Hamiltonian simulation. Specifically, Hamiltonians with mutually anti-commutative terms are easy to simulate, as what happens with ones consisting of mutually commutative terms. Such a property is further utilized to reduce the algorithmic error or the gate complexity in the truncated Taylor series quantum algorithm for general problems. Moreover, we propose two modified linear combinations of unitaries methods tailored for Hamiltonians with different degrees of anti-commutation. We numerically verify that the proposed methods exploiting anti-commutative relations could significantly improve the simulation accuracy of electronic Hamiltonians. Our work sheds light on the roles of commutative and anti-commutative relations in simulating quantum systems.

1 aZhao, Qi1 aYuan, Xiao uhttps://arxiv.org/abs/2103.0798801683nas a2200145 4500008004100000245003900041210003800080260001400118520131100132100001501443700001401458700001501472700001301487856003701500 2020 eng d00aOne-shot dynamical resource theory0 aOneshot dynamical resource theory c12/4/20203 a

A fundamental problem in resource theory is to study the manipulation of the resource. Focusing on a general dynamical resource theory of quantum channels, here we consider tasks of one-shot resource distillation and dilution with a single copy of the resource. For any target of unitary channel or pure state preparation channel, we establish a universal strategy to determine upper and lower bounds on rates that convert between any given resource and the target. We show that the rates are related to resource measures based on the channel robustness and the channel hypothesis testing entropy, with regularization factors of the target resource measures. The strategy becomes optimal with converged bounds when the channel robustness is finite and measures of the target resource collapse to the same value. The single-shot result also applies to asymptotic parallel manipulation of channels to obtain asymptotic resource conversion rates. We give several examples of dynamical resources, including the purity, classical capacity, quantum capacity, non-uniformity, coherence, and entanglement of quantum channels. Our results are applicable to general dynamical resource theories with potential applications in quantum communication, fault-tolerant quantum computing, and quantum thermodynamics.

1 aYuan, Xiao1 aZeng, Pei1 aGao, Minbo1 aZhao, Qi uhttps://arxiv.org/abs/2012.0278101566nas a2200157 4500008004100000245005100041210005100092260001300143520114100156100001501297700001701312700001501329700001301344700001401357856003701371 2020 eng d00aQuantum simulation with hybrid tensor networks0 aQuantum simulation with hybrid tensor networks c7/2/20203 a

Tensor network theory and quantum simulation are respectively the key classical and quantum methods in understanding many-body quantum physics. Here we show hybridization of these two seemingly independent methods, inheriting both their distinct advantageous features of efficient representations of many-body wave functions. We introduce the framework of hybrid tensor networks with building blocks consisting of measurable quantum states and classically contractable tensors. As an example, we demonstrate efficient quantum simulation with hybrid tree tensor networks that use quantum hardware whose size is significantly smaller than the one of the target system. We numerically test our method for finding the ground state of 1D and 2D spin systems of up to 8×8 and 4×3 qubits with operations only acting on 8+1 and 4+1 qubits, respectively. Our approach paves the way to the near-term quantum simulation of large practical problems with intermediate size quantum hardware, with potential applications in quantum chemistry, quantum many-body physics, quantum field theory, and quantum gravity thought experiments.

1 aYuan, Xiao1 aSun, Jinzhao1 aLiu, Junyu1 aZhao, Qi1 aZhou, You uhttps://arxiv.org/abs/2007.00958