Search Results
Adiabatic quantum computing with parameterized quantum circuits
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era.
Quantum Physics
Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover
We investigate the gap between theory and practice for exact branching algorithms.
Data Structures and Algorithms
Optimizing Adiabatic Quantum Program Compilation using a Graph-Theoretic Framework
To encourage the reuse and extension of these techniques, we provide an implementation of the framework and embedding algorithms.
Quantum Physics Data Structures and Algorithms
A Leap among Quantum Computing and Quantum Neural Networks: A Survey
In recent years, Quantum Computing witnessed massive improvements in terms of available resources and algorithms development.
Qibo: a framework for quantum simulation with hardware acceleration
We present Qibo, a new open-source software for fast evaluation of quantum circuits and adiabatic evolution which takes full advantage of hardware accelerators.
HOQST: Hamiltonian Open Quantum System Toolkit
We present an open-source software package called "Hamiltonian Open Quantum System Toolkit" (HOQST), a collection of tools for the investigation of open quantum system dynamics in Hamiltonian quantum computing, including both quantum annealing and the gate-model of quantum computing.
Quantum Physics
Quadratization in discrete optimization and quantum mechanics
This book is therefore useful for writing compilers to transform general optimization problems, into a form that quantum annealing or universal adiabatic quantum computing hardware requires; or for transforming quantum chemistry problems written in the Jordan-Wigner or Bravyi-Kitaev form, into a form where all multi-qubit interactions become 2-qubit pairwise interactions, without changing the desired ground state.
Training a Binary Classifier with the Quantum Adiabatic Algorithm
To bring it into a format that allows the application of adiabatic quantum computing (AQC), we first show that the bit-precision with which the weights need to be represented only grows logarithmically with the ratio of the number of training examples to the number of weak classifiers.
Quantum Physics
Quantum Advantage for All
In particular, we show that any classical algorithm $A$ that runs in $\mathcal{O}(f(n))$ time and $\mathcal{O}(g(n))$ space requires no more than $\mathcal{O}(f(n)\cdot g(n))$ quantum bits to execute, even symbolically, on a quantum computer.
Programming Languages
Qubit-reuse compilation with mid-circuit measurement and reset
In this work, we introduce the idea of qubit-reuse compilation, which takes as input a quantum circuit and produces as output a compiled circuit that requires fewer qubits to execute due to qubit reuse.
Quantum Physics
