Realizing the potential of near-term quantum computers to solve industry-relevant
constrained-optimization problems is a promising path to quantum advantage. In this work …

We present a detailed study of portfolio optimization using different versions of the quantum
approximate optimization algorithm (QAOA). For a given list of assets, the portfolio …

We present short-depth quantum circuits to deterministically prepare any Dicke state
\left|D_k^n\right⟩, which is the equal-amplitude superposition of all n-qubit computational …

Near-term quantum computers are limited by the decoherence of qubits to only being able to
run low-depth quantum circuits with acceptable fidelity. This severely restricts what quantum …

We present a divide-and-conquer approach to deterministically prepare Dicke states (ie,
equal-weight superpositions of all-qubit states with Hamming weight) on quantum …

This paper proposes an asymmetric tridirectional quantum teleportation (TQT) protocol that
uses a seven-qubit cluster states as the quantum channels of each party. In this scheme, any …

Recently, an algorithm has been constructed that shows that the binary icosahedral group 2I
together with a T-like gate forms the most efficient single-qubit universal gate set. To carry …

Quantum state preparation is a key step in all digital quantum simulation algorithms. Here
we propose methods to initialize on a gate-based quantum computer a general class of …

The antisymmetrized geminal power (AGP) is equivalent to the number projected Bardeen–
Cooper–Schrieffer (PBCS) wave function. It is also an elementary symmetric polynomial …

We construct a new family of permutationally invariant codes that correct $ t $ Pauli errors for
any $ t\ge 1$. We also show that codes in the new family correct quantum deletion errors as …