Explore the vast range of titles available.

We present a coherent counter-diabatic quantum protocol to prepare ground states in the lattice gauge mapping of all-to-all Ising models (LHZ) with considerably enhanced final ground state fidelity compared to a quantum annealing protocol. We make use of a variational method to find approximate counter-diabatic Hamiltonians that has recently been introduced by Sels and Polkovnikov (2017 Proc. Natl. Acad. Sci. 114 3909). The resulting additional terms in our protocol are time-dependent local on-site y-magnetic fields. These additional Hamiltonian terms do not increase the minimal energy gap, but instead compensate for the Berry curvature. A single free parameter is introduced which is optimized via classical updates. The protocol consists only of local and nearest-neighbor terms which makes it attractive for implementation in near term experiments.

For the adiabatic version of Grover's quantum search algorithm as proposed by Roland and Cerf, we study the impact of decoherence caused by a rather general coupling to some environment. For quite generic conditions, we find that the quantum Zeno effect poses strong limitations on the performance (quantum speed-up) since the environment effectively measures the state of the system permanently and thereby inhibits or slows down quantum transitions. Generalizing our results, we find that similar restrictions should apply universally to adiabatic quantum algorithms and quantum annealing schemes which are based on analogous isolated Landau-Zener type transitions at avoided level crossings (similar to first-order phase transitions). As a possible resort, more gradual changes of the quantum state (as in second-order phase transitions) or suitable error-correcting schemes such as the spin-echo method may alleviate this problem.

As first proposed for the adiabatic quantum information processing by Wu et al (2002 Phys. Rev. Lett. 89 057904), the Trotterization technique is a very useful tool for universal quantum computing, and in particular, the adiabatic quantum simulation of quantum systems. Given a boson Hamiltonian involving arbitrary bilinear interactions, we propose a static version of this technique to perform an optical simulation that would enable the identification of the ground state of the Hamiltonian. By this method, the dynamical process of the adiabatic evolution is mapped to a static linear optical array which is robust to the errors caused by dynamical fluctuations. We examine the cost of the physical implementation of the Trotterization, i.e. the number of discrete steps required for a given accuracy. Two conclusions are drawn. One is that the number of required steps grows much more slowly than the system size if the number of non-zero matrix elements of Hamiltonian is not too large. The second is that small fluctuations of the parameters of optical elements do not affect the first conclusion. This implies that the method is robust against the certain type of errors as we considered. Last but not least, we present an example of implementation of the simulation on a photonic chip as well as an optimized scheme. By such examples, we show a reduction of the costs compared to its classical counterpart and the potential for further improvement, which promotes a more general application.

We analyzed the accuracy of digitized adiabatic quantum computing to form the entangled three-qubit Greenberger–Horne–Zeilinger (GHZ) state on two IBM quantum computers and four quantum simulators by comparison with direct calculations using a Python code (version 3.12). We initialized three-qubit systems in the ground state of the Hamiltonian for noninteracting spins in an applied magnetic field in the x direction. We then gradually varied the Hamiltonian to an Ising model form with nearest-neighbor zz spin coupling with an eight-step discretization. The von Neumann entropy provides an indicator of the accuracy of the discretized adiabatic evolution. The von Neumann entropy of the density matrix from the Python code remains very close to zero, while the von Neumann entropy of the density matrices on the quantum computers increases almost linearly with the step number in the process. The GHZ witness operator indicates that the quantum simulators incorporate a GHZ component in part. The states on the two quantum computers acquire partial GHZ character, even though the trace of the product of the GHZ witness operator with the density matrix not only remains positive but also rises monotonically from Step 5 to Step 8. Each of the qubits becomes entangled during the adiabatic evolution in all of the calculations, as shown by the single-qubit reduced density matrices.

Phosphorene monolayers exhibit a range of advanced functional properties; however, their spin configurations and structural phase transitions remain unexplored in the context of enhancing performance in quantum computation and information. In this study, we employ a two-dimensional (2D) Ising model with nearest- and next-nearest-neighbor interactions, denoted as and respectively, alongside a Monte Carlo approach, to investigate the structural phase transitions and spin behavior of phosphorene. Using this model, we derive the temperature-dependent phase diagram of the phosphorene in terms of the interaction strength ratio ( ), revealing three distinct phases—checkerboard-ordered, glassy, and quasi-ordered—with a phase boundary at . Additionally, we analyze the effects of possible defects and strains in the phosphorene lattice induced by the substrate on the phase transitions. Our findings have potential applications in adiabatically switching states through gradual variations in coupling constants, offering new possibilities for adiabatic quantum computing (AQC) and π-ring arrays.

Adiabatic quantum computing is implemented on specialized hardware using the heuristics of the quantum annealing algorithm. To solve a problem using quantum annealing, the problem requires formatting as a discrete quadratic function without constraints. The problem of finding Nash equilibrium in two-player, non-cooperative games is a two-fold quadratic optimization problem with constraints. This problem was formatted as a single, constrained quadratic optimization in 1964 by Mangasarian and Stone. Here, we show that adding penalty terms to the quadratic function formulation of Nash equilibrium gives a quadratic unconstrained binary optimization (QUBO) formulation of this problem that can be executed on quantum annealers. Three examples are discussed to highlight the success of the formulation, and an overall, time-to-solution (hardware + software processing) speed up by seven to ten times is reported on quantum annealers developed by D-Wave System.

The accelerated progress in manufacturing noisy, intermediate-scale quantum (NISQ) computing hardware has opened the possibility of exploring its application in transforming approaches to solving computationally challenging problems. The important limitations common among all NISQ computing technologies are the absence of error correction and the short coherence time, which limit the computational power of these systems. Shortening the required time of a single run of a quantum algorithm is essential for reducing environment-induced errors and for the efficiency of the computation. We have investigated the ability of a variational version of adiabatic state preparation (ASP) to generate an accurate state more efficiently compared to existing adiabatic methods. The standard ASP method uses a time-dependent Hamiltonian, connecting the initial Hamiltonian with the final Hamiltonian. In the current approach, a navigator Hamiltonian is introduced which has a non-zero amplitude only in the middle of the annealing process. Both the initial and navigator Hamiltonians are determined using variational methods. A Hermitian cluster operator, inspired by coupled-cluster theory and truncated to single and double excitations/de-excitations, is used as a navigator Hamiltonian. A comparative study of our variational algorithm (VanQver) with that of standard ASP, starting with a Hartree-Fock Hamiltonian, is presented. The results indicate that the introduction of the navigator Hamiltonian significantly improves the annealing time required to achieve chemical accuracy by two to three orders of magnitude. The efficiency of the method is demonstrated in the ground-state energy estimation of molecular systems, namely, H2, P4, and LiH.

We investigate the irreconcilability issue that arises when translating the search algorithm from the Continuous Time Quantum Walk (CTQW) framework to the Adiabatic Quantum Computing (AQC) framework. For the AQC formulation to evolve along the same path as the CTQW, it requires a constant energy gap in the Hamiltonian throughout the AQC schedule. To resolve the constant gap issue, we modify the CTQW-inspired AQC catalyst Hamiltonian from an XZ operator to a Z oracle operator. Through simulation, we demonstrate that the total running time for the proposed approach for AQC with the modified catalyst Hamiltonian remains optimal as CTQW. Inspired by this solution, we further investigate adaptive scheduling for the catalyst Hamiltonian and its coefficient function in the adiabatic path of Grover-inspired AQC to improve the adiabatic local search.

We study a quantum annealer where bosons mediate the Ising-type interactions between qubits. We compare the efficiency of ground state preparation for direct and mediated couplings, for which Ising and spin-boson Hamiltonian are employed respectively. This comparison is done numerically for a small frustrated antiferromagnet, with a careful choice of the optimal adiabatic passage that reveals the features of the boson-mediated interactions. Those features can be explained by taking into account what we called excited solutions: states with the same spin correlations as the ground-state but with a larger bosonic occupancy. For similar frequencies of the bosons and qubits, the performance of quantum annealing depends on how excited solutions interchange population with local spin errors. We report an enhancement of quantum annealing thanks to this interchange under certain circumstances.

The quantum adiabatic unstructured search algorithm is one of only a handful of quantum adiabatic optimization algorithms to exhibit provable speedups over their classical counterparts. With no fault tolerance theorems to guarantee the resilience of such algorithms against errors, understanding the impact of imperfections on their performance is of both scientific and practical significance. We study the robustness of the algorithm against various types of imperfections: limited control over the interpolating schedule, Hamiltonian misspecification, and interactions with a thermal environment. We find that the unstructured search algorithm's quadratic speedup is generally not robust to the presence of any one of the above non-idealities, and in some cases we find that it imposes unrealistic conditions on how the strength of these noise sources must scale to maintain the quadratic speedup.