Related papers: Genetic braid optimization: A heuristic approach t…
We propose a gate optimization method, which we call variational quantum gate optimization (VQGO). VQGO is a method to construct a target multi-qubit gate by optimizing a parametrized quantum circuit which consists of tunable single-qubit…
Despite using a novel model of computation, quantum computers break down programs into elementary gates. Among such gates, entangling gates are the most expensive. In the context of fermionic simulations, we develop a suite of compilation…
Variational quantum algorithms offer fascinating prospects for the solution of combinatorial optimization problems using digital quantum computers. However, the achievable performance in such algorithms and the role of quantum correlations…
We develop a theory based on quasi-geometric (QG) approach to transform a small number of qubits into a larger number of error-correcting qubits by considering four different cases. More precisely, we use the 2-dimensional quasi-orthogonal…
Genetic algorithms are heuristic optimization techniques inspired by Darwinian evolution. Quantum computation is a new computational paradigm which exploits quantum resources to speed up information processing tasks. Therefore, it is…
Distributed quantum computing offers a potential solution to the complexity of superconducting chip hardware layouts and error correction algorithms. High-quality gates between distributed chips enable the simplification of existing error…
While there is a general consensus about the structure of one qubit operations in topological quantum computer, two qubits are as usual a more difficult and complex story of different attempts with varying approaches, problems and…
The gate version of quantum computation exploits several quantum key resources as superposition and entanglement to reach an outstanding performance. In the way, this theory was constructed adopting certain supposed processes imitating…
Branch-and-bound is a widely used technique for solving combinatorial optimisation problems where one has access to two procedures: a branching procedure that splits a set of potential solutions into subsets, and a cost procedure that…
Quantum computing is gaining popularity across a wide range of scientific disciplines due to its potential to solve long-standing computational problems that are considered intractable with classical computers. One promising area where…
Topological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasi-particle excitations. We develop an efficient means to map between dense and…
Genetic algorithms are modeled after the biological evolutionary processes that use natural selection to select the best species to survive. They are heuristics based and low cost to compute. Genetic algorithms use selection, crossover, and…
Traditional quantum circuit optimization is performed directly at the circuit level. Alternatively, a quantum circuit can be translated to a ZX-diagram which can be simplified using the rules of the ZX-calculus, after which a simplified…
We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. The algorithm can be seen as an analogue of quantum annealing under the restriction of a product state space, where…
Quantum computing has the potential to improve our ability to solve certain optimization problems that are computationally difficult for classical computers, by offering new algorithmic approaches that may provide speedups under specific…
The challenge in building high-fidelity quantum gates lies in overcoming control errors and decoherence effects caused by the coupling between the quantum system and the external environment. Nonadiabatic holonomic quantum computation uses…
We present an efficient algorithm to reduce the number of non-Clifford gates in quantum circuits and the number of parametrized rotations in parametrized quantum circuits. The method consists in finding rotations that can be merged into a…
Quantum algorithm design usually assumes access to a perfect quantum computer with ideal properties like full connectivity, noise-freedom and arbitrarily long coherence time. In Noisy Intermediate-Scale Quantum (NISQ) devices, however, the…
The optimal implementation of quantum gates for closed $N$-qubit systems is one of the key challenges for practical realization of many quantum information processing tasks. In the present article, based on the generalized Bloch vectors…
Fault-tolerant quantum computation using two-dimensional topological quantum error correcting codes can benefit from multi-qubit long-range operations. By using simple commutation rules, a quantum circuit can be transpiled into a sequence…