Preparing Dicke States on a Quantum Computer

Exact requirement of controlled NOT (CNOT) and single-qubit gates to implement a quantum algorithm in a given architecture is one of the central problems in this computational paradigm. In this article, we take a tutorial approach in explaining the preparation of Dicke states (|D k n 〉) using concise realizations of partially defined unitary transformations. We show how […]

Multiblock ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers

Solving combinatorial optimization problems on current noisy quantum devices is currently being advocated for (and restricted to) binary polynomial optimization with equality constraints via quantum heuristic approaches. This is achieved using, for example, the variational quantum eigensolver (VQE) and the quantum approximate optimization algorithm (QAOA). In this article, we present a decomposition-based approach to extend […]

A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era

Due to several physical limitations in the realization of quantum hardware, today’s quantum computers are qualified as noisy intermediate-scale quantum (NISQ) hardware. NISQ hardware is characterized by a small number of qubits (50 to a few hundred) and noisy operations. Moreover, current realizations of superconducting quantum chips do not have the ideal all-to-all connectivity between […]

Experimental Characterization, Modeling, and Analysis of Crosstalk in a Quantum Computer

In this article, we present the experimental characterization of crosstalk in quantum information processor using idle tomography and simultaneous randomized benchmarking. We quantify both “quantum” and “classical” crosstalk in the device and analyze quantum circuits considering crosstalk. We show that simulation considering only gate-error deviates from experimental results up to 27%, whereas simulation considering both […]

Subdivided Phase Oracle for NISQ Search Algorithms

Because noisy intermediate-scale quantum (NISQ) machines accumulate errors quickly, we need new approaches to designing NISQ-aware algorithms and assessing their performance. Algorithms with characteristics that appear less desirable under ideal circumstances, such as lower success probability, may in fact outperform their ideal counterparts on existing hardware. We propose an adaptation of Grover’s algorithm, subdividing the […]