12,269 research outputs found
Network Community Detection On Small Quantum Computers
In recent years a number of quantum computing devices with small numbers of
qubits became available. We present a hybrid quantum local search (QLS)
approach that combines a classical machine and a small quantum device to solve
problems of practical size. The proposed approach is applied to the network
community detection problem. QLS is hardware-agnostic and easily extendable to
new quantum computing devices as they become available. We demonstrate it to
solve the 2-community detection problem on graphs of size up to 410 vertices
using the 16-qubit IBM quantum computer and D-Wave 2000Q, and compare their
performance with the optimal solutions. Our results demonstrate that QLS
perform similarly in terms of quality of the solution and the number of
iterations to convergence on both types of quantum computers and it is capable
of achieving results comparable to state-of-the-art solvers in terms of quality
of the solution including reaching the optimal solutions
Programming Quantum Computers Using Design Automation
Recent developments in quantum hardware indicate that systems featuring more
than 50 physical qubits are within reach. At this scale, classical simulation
will no longer be feasible and there is a possibility that such quantum devices
may outperform even classical supercomputers at certain tasks. With the rapid
growth of qubit numbers and coherence times comes the increasingly difficult
challenge of quantum program compilation. This entails the translation of a
high-level description of a quantum algorithm to hardware-specific low-level
operations which can be carried out by the quantum device. Some parts of the
calculation may still be performed manually due to the lack of efficient
methods. This, in turn, may lead to a design gap, which will prevent the
programming of a quantum computer. In this paper, we discuss the challenges in
fully-automatic quantum compilation. We motivate directions for future research
to tackle these challenges. Yet, with the algorithms and approaches that exist
today, we demonstrate how to automatically perform the quantum programming flow
from algorithm to a physical quantum computer for a simple algorithmic
benchmark, namely the hidden shift problem. We present and use two tool flows
which invoke RevKit. One which is based on ProjectQ and which targets the IBM
Quantum Experience or a local simulator, and one which is based on Microsoft's
quantum programming language Q.Comment: 10 pages, 10 figures. To appear in: Proceedings of Design, Automation
and Test in Europe (DATE 2018
- …