Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
Quantum computers may provide good solutions to combinatorial optimization problems by
leveraging the Quantum Approximate Optimization Algorithm (QAOA). The QAOA is often …
leveraging the Quantum Approximate Optimization Algorithm (QAOA). The QAOA is often …
Factoring integers with sublinear resources on a superconducting quantum processor
B Yan, Z Tan, S Wei, H Jiang, W Wang, H Wang… - arXiv preprint arXiv …, 2022 - arxiv.org
Shor's algorithm has seriously challenged information security based on public key
cryptosystems. However, to break the widely used RSA-2048 scheme, one needs millions of …
cryptosystems. However, to break the widely used RSA-2048 scheme, one needs millions of …
Density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity
We develop a density-matrix renormalization group (DMRG) algorithm for the simulation of
quantum circuits. This algorithm can be seen as the extension of the time-dependent DMRG …
quantum circuits. This algorithm can be seen as the extension of the time-dependent DMRG …
Circuit transformations for quantum architectures
Quantum computer architectures impose restrictions on qubit interactions. We propose
efficient circuit transformations that modify a given quantum circuit to fit an architecture …
efficient circuit transformations that modify a given quantum circuit to fit an architecture …
Synthesis of quantum circuits for linear nearest neighbor architectures
While a couple of impressive quantum technologies have been proposed, they have several
intrinsic limitations which must be considered by circuit designers to produce realizable …
intrinsic limitations which must be considered by circuit designers to produce realizable …
Elementary quantum gate realizations for multiple-control Toffoli gates
A new method for determining elementary quantum gate realizations for multiple-control
Toffoli (MCT) gates is presented. The realization for each MCT gate is formed as a …
Toffoli (MCT) gates is presented. The realization for each MCT gate is formed as a …
Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits
Ensuring nearest neighbor compliance of quantum circuits by inserting SWAP gates has
heavily been considered in the past. Here, quantum gates are considered which work on …
heavily been considered in the past. Here, quantum gates are considered which work on …
Design and execution of quantum circuits using tens of superconducting qubits and thousands of gates for dense Ising optimization problems
We develop a hardware-efficient ansatz for variational optimization, derived from existing
ansatzes in the literature, that parametrizes subsets of all interactions in the cost Hamiltonian …
ansatzes in the literature, that parametrizes subsets of all interactions in the cost Hamiltonian …
Benchmarking quantum coprocessors in an application-centric, hardware-agnostic, and scalable way
Existing protocols for benchmarking current quantum coprocessors fail to meet the usual
standards for assessing the performance of high-performance-computing platforms. After a …
standards for assessing the performance of high-performance-computing platforms. After a …
Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits
A Lye, R Wille, R Drechsler - The 20th Asia and South Pacific …, 2015 - ieeexplore.ieee.org
Motivated by the promises of significant speed-ups for certain problems, quantum computing
received significant attention in the past. While much progress has been made in the …
received significant attention in the past. While much progress has been made in the …