Exponentially fast scrambling of an initial state characterizes quantum chaotic systems. Given the importance of quickly populating higher energy levels from low-energy states in quantum battery charging protocols, this Letter investigates the role of quantum scrambling in quantum batteries and its effect on optimal power and charging times. We adopt a bare representation with normalized bandwidths to suppress system energy dependence. To our knowledge, this is the first in-depth exploration of quantum scrambling in the context of quantum batteries. By analyzing the dynamics of out-of-time-order correlators, our findings indicate that quantum scrambling does not necessarily lead to faster charging, despite its potential for accelerating the process.
We present an enhanced bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm to address higher-order unconstrained binary optimization (HUBO) problems. Combinatorial optimization plays a crucial role in many industrial applications, yet classical computing often struggles with complex instances. By encoding these problems as Ising spin glasses and leveraging the advancements in quantum computing technologies, quantum optimization methods emerge as a promising alternative. We apply BF-DCQO with an enhanced bias term to a HUBO problem featuring three-local terms in the Ising spin-glass model. Our protocol is experimentally validated using 156 qubits on an IBM quantum processor with a heavy-hex architecture. In the studied instances, the results outperform standard methods, including the quantum approximate optimization algorithm (QAOA), quantum annealing, simulated annealing, and Tabu search. Furthermore, we perform an MPS simulation and provide numerical evidence of the feasibility of a similar HUBO problem on a 433-qubit Osprey-like quantum processor. Both studied cases, the experiment on 156 qubits and the simulation on 433 qubits, can be considered as the start of the commercial quantum advantage era, Kipu dixit, and even more when extended soon to denser industry-level HUBO problems.
The Su-Schrieffer-Heeger (SSH) chain, which serves as a paradigmatic model for comprehending topological phases and their associated edge states, plays an essential role in advancing our understanding of quantum materials and quantum information processing and technology. In this paper, we introduce a hybrid analog-digital protocol designed for the nonadiabatic yet high-fidelity transfer of edge states in an SSH chain, featuring two sublattices, A and B. The core of our approach lies in harnessing the approximate time-dependent counterdiabatic (CD) interaction, derived from adiabatic gauge potentials. However, to enhance transfer fidelity, particularly in long-distance chains, higher-order nested commutators become crucial. To simplify the experimental implementation and navigate computational complexities, we identify the next-to-nearest-neighbor hopping terms between sublattice A sites as dominant CD driving and further optimize them by using variational quantum circuits. Through digital quantum simulation, our protocol showcases the capability to achieve rapid and robust solutions, even in the presence of disorder. This analog-digital transfer protocol, an extension of quantum control methodology, establishes a robust framework for edge-state transfer. Importantly, the optimal CD driving identified can be seamlessly implemented across various quantum registers, highlighting the versatility of our approach.
We present an algorithm for solving systems of linear equations based on the HHL algorithm with a novel qudits methodology, a generalization of the qubits with more states, to reduce the number of gates to be applied and the amount of resources. Based on this idea, we perform a quantum-inspired version on tensor networks, taking advantage of their ability to perform non-unitary operations such as projection. The main novelty of this proposal is to perform a simulation as efficient as possible of the HHL algorithm in order to benchmark the algorithm steps according to its input parameters and the input matrix. Finally, we use this algorithm to obtain a solution for the harmonic oscillator with an external force, the forced damped oscillator and the 2D static heat equation differential equations.
Efficient packing of items into bins is a common daily task. Known as Bin Packing Problem, it has been intensively studied in the field of artificial intelligence, thanks to the wide interest from industry and logistics. Since decades, many variants have been proposed, with the three-dimensional Bin Packing Problem as the closest one to real-world use cases. We introduce a hybrid quantum-classical framework for solving real-world three-dimensional Bin Packing Problems (Q4RealBPP), considering different realistic characteristics, such as: i) package and bin dimensions, ii) overweight restrictions, iii) affinities among item categories and iv) preferences for item ordering. Q4RealBPP permits the solving of real-world oriented instances of 3dBPP, contemplating restrictions well appreciated by industrial and logistics sectors.
We introduce a simple algorithm that efficiently computes tensor products of Pauli matrices. This is done by tailoring the calculations to this specific case, which allows to avoid unnecessary calculations. The strength of this strategy is benchmarked against state-of-the-art techniques, showing a remarkable acceleration. As a side product, we provide an optimized method for one key calculus in quantum simulations: the Pauli basis decomposition of Hamiltonians.
Coherent states, known as displaced vacuum states, play an important role in quantum information processing, quantum machine learning,and quantum optics. In this article, two ways to digitally prepare coherent states in quantum circuits are introduced. First, we construct the displacement operator by decomposing it into Pauli matrices via ladder operators, i.e., creation and annihilation operators. The high fidelity of the digitally generated coherent states is verified compared with the Poissonian distribution in Fock space. Secondly, by using Variational Quantum Algorithms, we choose different ansatzes to generate coherent states. The quantum resources -- such as numbers of quantum gates, layers and iterations -- are analyzed for quantum circuit learning. The simulation results show that quantum circuit learning can provide high fidelity on learning coherent states by choosing appropriate ansatzes.