MPStab, a quantum circuit simulator based on a hybrid formalism combining stabilizers and tensor networks, recently introduced in Ref.
Abstract
The development of techniques for simulating quantum systems using classical computers is a paramount task for two primary reasons: i) there exist configurations for which classical computers are remarkably effective and will continue to be so, and ii) exploring the limits of classical computation facilitates the identification of the regimes of competence for quantum computers. In this work, we present MPStab, a quantum circuit simulator based on a hybrid formalism combining stabilizers and tensor networks, recently introduced in Ref. [1]. We present the package, its core functionalities, and explore its performances in a few interesting simulation regimes.
This work establishes a framework for the representation of quantum dynamics in molecular and condensed matter systems, designed for execution on topological quantum hardware, by leveraging the non-Abelian braiding statistics of Fibonacci and Ising anyons and the Solovay-Kitaev algorithm to approximate unitary propagat...
This work introduces Matrix Product Evolution (MPE), a tensor-train representation of quantum circuits constructed along the circuit depth rather than along the qubit index, and develops an efficient contraction strategy based on a zip-up procedure to carry out this contraction in practice.
Haruyuki Kawabe, Minoru Nagai, Tsuyoshi Okubo et al.· 0 citations
The emergence of Quantum Computing has resulted in a slate of quantum algorithms that can solve a wide variety of algorithmic and computational problems faster than any classical computer. How we can apply these various quantum algorithms to practical problems in computing is still an ongoing area of research. In this...
Kahlil Dozier, Justin Beltran, Hugo Matousek et al.· ACM SIGMETRICS Performance E...· 0 citations
DF-SQD is introduced, a hybrid algorithm that derives deterministic auxiliary-field circuits from selected double-factorization leaves of the two-electron tensor and is able to discover better results with shallower circuits, is sample efficient, uses configuration recovery and has empirical convergence observation.
Simulation of quantum many-body systems is a principal application of quantum computing, but available devices remain limited by the number of qubits and cannot accommodate systems of the desired size. One approach is to host a large evolution across several modest distributed systems that exchange classical informatio...
Yong Liu, Guang-Yao Huang, Wei-Xu Shi et al.· 0 citations
Feedback-based quantum algorithms recently gained attention by demonstrating how quantum computers can be used to solve optimization problems without resorting to hybrid quantum-classical architectures. Recent progress made with Feedback-based Algorithm for Quantum Optimization (FALQON) variants significantly reduced t...
Letícia Bertuzzi, João P. Engster, Evandro C. R. da Rosa et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
