SearcharxivSearch

arXiv · 2503.20424

Charging free fermion quantum batteries

Abstract

The performances of many-body quantum batteries strongly depend on the Hamiltonian of the battery, the initial state, and the charging protocol. In this article we derive an analytical expression for the energy stored via a double sudden quantum quench in a large class of quantum systems whose Hamiltonians can be reduced to 2x2 free fermion problems, whose initial state is thermal. Our results apply to conventional two-band electronic systems across all dimensions and quantum spin chains that can be solved through the Jordan-Wigner transformation. In particular, we apply our analytical relation to the quantum Ising chain, to the quantum XY chain, to the cluster Ising and to the long range SSH models. We obtain several results: (i) The strong dependence of the stored energy on the quantum phase diagram of the charging Hamiltonian persists even when the charging starts from a thermal state. Interestingly, in the thermodynamic limit, such a strong dependence manifests itself as non-analyticities of the stored energy corresponding to the quantum phase transition points of the charging Hamiltonian. (ii) The dependence of the stored energy on the parameters of the Hamiltonian can, in the Ising chain case, be drastically reduced by increasing temperature; (iii) Charging the Ising or the XY chain prepared in the ground state of their classical points leads to an amount of stored energy that, within a large parameter range, does not depend on the charging parameters; (iv) The cluster Ising model and the long range SSH model, despite showing quantum phase transitions (QPTs) between states with orders dominated by different interaction ranges, do not exhibit super-extensive, i.e. more than linear in the number of sites, scaling of the charging power.

Explore related subjects

Keep this discovery

BibTeXRIS

Riccardo Grazi, Fabio Cavaliere, Maura Sassetti, Dario Ferraro, Niccolò Traverso Ziani. 2025-03-26. Charging free fermion quantum batteries. https://doi.org/10.1016/j.chaos.2025.116383

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

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph