526 research outputs found
Reducing the CNOT count for Clifford+T circuits on NISQ architectures
While mapping a quantum circuit to the physical layer one has to consider the
numerous constraints imposed by the underlying hardware architecture.
Connectivity of the physical qubits is one such constraint that restricts
two-qubit operations such as CNOT to "connected" qubits. SWAP gates can be used
to place the logical qubits on admissible physical qubits, but they entail a
significant increase in CNOT-count, considering the fact that each SWAP gate
can be implemented by 3 CNOT gates.
In this paper we consider the problem of reducing the CNOT-count in
Clifford+T circuits on connectivity constrained architectures such as noisy
intermediate-scale quantum (NISQ) (Preskill, 2018) computing devices. We
"slice" the circuit at the position of Hadamard gates and "build" the
intermediate portions. We investigated two kinds of partitioning - (i) a simple
method of partitioning the gates of the input circuit based on the locality of
H gates and (ii) a second method of partitioning the phase polynomial of the
input circuit. The intermediate {CNOT,T} sub-circuits are synthesized using
Steiner trees, significantly improving on the methods introduced by Nash,
Gheorghiu, Mosca[2020] and Kissinger, de Griend[2019].
We compared the performance of our algorithms while mapping different
benchmark circuits as well as random circuits to some popular architectures
such as 9-qubit square grid, 16-qubit square grid, Rigetti 16-qubit Aspen,
16-qubit IBM QX5 and 20-qubit IBM Tokyo. We found that for both the benchmark
and random circuits our first algorithm that uses the simple slicing technique
dramatically reduces the CNOT-count compared to naively using SWAP gates. Our
second slice-and-build algorithm also performs very well for benchmark
circuits.Comment: 41 pages, 2 figures, 2 tables. Added appendix with example
2D Qubit Placement of Quantum Circuits using LONGPATH
In order to achieve speedup over conventional classical computing for finding
solution of computationally hard problems, quantum computing was introduced.
Quantum algorithms can be simulated in a pseudo quantum environment, but
implementation involves realization of quantum circuits through physical
synthesis of quantum gates. This requires decomposition of complex quantum
gates into a cascade of simple one qubit and two qubit gates. The
methodological framework for physical synthesis imposes a constraint regarding
placement of operands (qubits) and operators. If physical qubits can be placed
on a grid, where each node of the grid represents a qubit then quantum gates
can only be operated on adjacent qubits, otherwise SWAP gates must be inserted
to convert non-Linear Nearest Neighbor architecture to Linear Nearest Neighbor
architecture. Insertion of SWAP gates should be made optimal to reduce
cumulative cost of physical implementation. A schedule layout generation is
required for placement and routing apriori to actual implementation. In this
paper, two algorithms are proposed to optimize the number of SWAP gates in any
arbitrary quantum circuit. The first algorithm is intended to start with
generation of an interaction graph followed by finding the longest path
starting from the node with maximum degree. The second algorithm optimizes the
number of SWAP gates between any pair of non-neighbouring qubits. Our proposed
approach has a significant reduction in number of SWAP gates in 1D and 2D NTC
architecture.Comment: Advanced Computing and Systems for Security, SpringerLink, Volume 1
Time-Sliced Quantum Circuit Partitioning for Modular Architectures
Current quantum computer designs will not scale. To scale beyond small
prototypes, quantum architectures will likely adopt a modular approach with
clusters of tightly connected quantum bits and sparser connections between
clusters. We exploit this clustering and the statically-known control flow of
quantum programs to create tractable partitioning heuristics which map quantum
circuits to modular physical machines one time slice at a time. Specifically,
we create optimized mappings for each time slice, accounting for the cost to
move data from the previous time slice and using a tunable lookahead scheme to
reduce the cost to move to future time slices. We compare our approach to a
traditional statically-mapped, owner-computes model. Our results show strict
improvement over the static mapping baseline. We reduce the non-local
communication overhead by 89.8\% in the best case and by 60.9\% on average. Our
techniques, unlike many exact solver methods, are computationally tractable.Comment: Appears in CF'20: ACM International Conference on Computing Frontier
Optimized Surface Code Communication in Superconducting Quantum Computers
Quantum computing (QC) is at the cusp of a revolution. Machines with 100
quantum bits (qubits) are anticipated to be operational by 2020
[googlemachine,gambetta2015building], and several-hundred-qubit machines are
around the corner. Machines of this scale have the capacity to demonstrate
quantum supremacy, the tipping point where QC is faster than the fastest
classical alternative for a particular problem. Because error correction
techniques will be central to QC and will be the most expensive component of
quantum computation, choosing the lowest-overhead error correction scheme is
critical to overall QC success. This paper evaluates two established quantum
error correction codes---planar and double-defect surface codes---using a set
of compilation, scheduling and network simulation tools. In considering
scalable methods for optimizing both codes, we do so in the context of a full
microarchitectural and compiler analysis. Contrary to previous predictions, we
find that the simpler planar codes are sometimes more favorable for
implementation on superconducting quantum computers, especially under
conditions of high communication congestion.Comment: 14 pages, 9 figures, The 50th Annual IEEE/ACM International Symposium
on Microarchitectur
Towards a Cost Metric for Nearest Neighbor Constraints in Reversible Circuits
Abstract. This work in progress report proposes a new metric for estimating nearest neighbor cost at the reversible circuit level. This is in contrast to existing literature where nearest neighbor constraints are usually considered at the quantum circuit level. In order to define the metric, investigations on a state-of-the-art reversible to quantum mapping scheme have been conducted. From the retrieved information, a proper estimation to be used as a cost metric has been obtained. Using the metric, it becomes possible for the first time to optimize a reversible circuit with respect to nearest neighbor constraints
- …