A Divide-and-Conquer Approach to Dicke State Preparation

We present a divide-and-conquer approach to deterministically prepare Dicke states |D^{n}_{k}\rangle (i.e., equal-weight superpositions of all n-qubit states with Hamming weight k) on quantum computers. In an experimental evaluation for up to n=6 qubits on IBM Quantum Sydney and Montreal devices, we...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on quantum engineering 2022, Vol.3, p.1-16
Main Authors: Aktar, Shamminuj, Bartschi, Andreas, Badawy, Abdel-Hameed A., Eidenbenz, Stephan
Format: Article
Language:English
Subjects:
Accuracy
Circuit
Circuits
Dicke state
Error analysis
fidelity
Hamming weight
IBM Q
Logic gates
noisy intermediate scale quantum (NISQ)
Probabilistic logic
QISKIT
Quantum computers
quantum computing
Quantum entanglement
Quantum state
Qubit
Qubits (quantum computing)
Topology
transpiler
Weight measurement
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a divide-and-conquer approach to deterministically prepare Dicke states |D^{n}_{k}\rangle (i.e., equal-weight superpositions of all n-qubit states with Hamming weight k) on quantum computers. In an experimental evaluation for up to n=6 qubits on IBM Quantum Sydney and Montreal devices, we achieve significantly higher state fidelity compared to previous results. The fidelity gains are achieved through several techniques: our circuits first "divide" the Hamming weight between blocks of n/2 qubits, and then "conquer" those blocks with improved versions of Dicke state unitaries (Bärtschi et al. FCT'2019). Due to the sparse connectivity on IBM's heavy-hex-architectures, these circuits are implemented for linear nearest neighbor topologies. Further gains in (estimating) the state fidelity are due to our use of measurement error mitigation and hardware progress.
ISSN:2689-1808
2689-1808
DOI:10.1109/TQE.2022.3174547