Resource-efficient quantum computing by breaking abstractions
Building a quantum computer that surpasses the computational power of its classical
counterpart is a great engineering challenge. Quantum software optimizations can provide …
counterpart is a great engineering challenge. Quantum software optimizations can provide …
Asymptotic improvements to quantum circuits via qutrits
Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this
work, we instead consider three-level qu trits. Past work with qutrits has demonstrated only …
work, we instead consider three-level qu trits. Past work with qutrits has demonstrated only …
Optimization of quantum circuit map** using gate transformation and commutation
This paper addresses quantum circuit map** for Noisy Intermediate-Scale Quantum
(NISQ) computers. Since NISQ computers constrain two-qubit operations to limited …
(NISQ) computers. Since NISQ computers constrain two-qubit operations to limited …
[BOOK][B] Introduction to reversible computing
KS Perumalla - 2013 - books.google.com
Few books comprehensively cover the software and programming aspects of reversible
computing. Filling this gap, Introduction to Reversible Computing offers an expanded view of …
computing. Filling this gap, Introduction to Reversible Computing offers an expanded view of …
A genetic algorithm (GA) and swarm-based binary decision diagram (BDD) reordering optimizer reinforced with recent operators
The use of binary decision diagrams (BDDs) has proliferated in numerous fields. When a
system criterion is formulated in form of a Boolean function, its BDD is constructed. Each …
system criterion is formulated in form of a Boolean function, its BDD is constructed. Each …
Exact reordering of circuit lines for nearest neighbor quantum architectures
Research in the domain of quantum computation is mainly driven by their promising
applications eg, for factorization or database search. At the same time, physical …
applications eg, for factorization or database search. At the same time, physical …
Quantum circuit compilers using gate commutation rules
The use of noisy intermediate-scale quantum computers (NISQCs), which consist of dozens
of noisy qubits with limited coupling constraints, has been increasing. A circuit compiler …
of noisy qubits with limited coupling constraints, has been increasing. A circuit compiler …
Formal constraint-based compilation for noisy intermediate-scale quantum systems
Noisy, intermediate-scale quantum (NISQ) systems are expected to have a few hundred
qubits, minimal or no error correction, limited connectivity and limits on the number of gates …
qubits, minimal or no error correction, limited connectivity and limits on the number of gates …
A Heuristic for Linear Nearest Neighbor Realization of Quantum Circuits by SWAP Gate Insertion Using -Gate Lookahead
With recent interest in reversible and quantum computation, research in synthesis of
reversible and quantum circuits has increased in momentum. With additional requirements …
reversible and quantum circuits has increased in momentum. With additional requirements …
Improving the map** of reversible circuits to quantum circuits using multiple target lines
The efficient synthesis of quantum circuits is an active research area. Since many of the
known quantum algorithms include a large Boolean component (eg the database in the …
known quantum algorithms include a large Boolean component (eg the database in the …