Unraveling Rodeo Algorithm Through the Zeeman Model

Abstract

We unravel the Rodeo Algorithm to determine the eigenstates and eigenvalues spectrum for a general Hamiltonian considering arbitrary initial states. By presenting a novel methodology, we detail the original method and show how to define all properties without having prior knowledge regarding the eigenstates. To this end, we exploit Pennylane and Qiskit platforms resources to analyze scenarios where the Hamiltonians are described by the Zeeman model for one and two spins. We also introduce strategies and techniques to improve the algorithm's performance by adjusting its intrinsic parameters and reducing the fluctuations inherent to data distribution. First, we explore the dynamics of a single qubit on Xanadu simulators to set the parameters that optimize the method performance and select the best strategies to execute the algorithm. On the sequence, we extend the methodology for bipartite systems to discuss how the algorithm works when degeneracy and entanglement are taken into account. Finally, we compare the predictions with the results obtained on a real superconducting device provided by the IBM Q Experience program, establishing the conditions to increase the protocol efficiency for multi-qubit systems.

References in corpus (23)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Thermalization and its mechanism for generic isolated quantum systems
• Quantum Simulation
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Efficient Learning for Deep Quantum Neural Networks
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• A Density Matrix-based Algorithm for Solving Eigenvalue Problems
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Using Quantum Computers for Quantum Simulation
• Rodeo Algorithm for Quantum Computing
• Variational approaches to constructing the many-body nuclear ground state for quantum computing
• Statistical properties of eigenstate amplitudes in complex quantum systems
• Accessing ground state and excited states energies in many-body system after symmetry restoration using quantum computers
• Quantum state preparation by adiabatic evolution with customized gates
• Quantum variational learning for quantum error-correcting codes
• Mitigating algorithmic errors in quantum optimization through energy extrapolation
• Simulating noisy variational quantum eigensolver with local noise models
• A variational quantum algorithm for Hamiltonian diagonalization
• Demonstration of the Rodeo Algorithm on a Quantum Computer
• Improving the efficiency of single and multiple teleportation protocols based on the direct use of partially entangled states
• Estimating the Number of States via the Rodeo Algorithm for Quantum Computation