Publication | Open Access
A Divide-and-Conquer Approach to Dicke State Preparation
46
Citations
36
References
2022
Year
EngineeringComputer ArchitectureComputer-aided VerificationIbm Quantum SydneyFormal VerificationDicke State PreparationQuantum EngineeringState Space SearchQuantum ComputingQuantum Machine LearningQuantum ControlQuantum SciencePhysicsQuantum AlgorithmQuantum SwitchesQuantum RoutersDicke StatesComputer ScienceQuantum Error MitigationFinite-state SystemQuantum TransducersQuantum CharacterizationQuantum CompilersState FidelityAutomated ReasoningQuantum DevicesQuantum Error CorrectionQuantum HardwareQuantum Algorithms
We present a divide-and-conquer approach to deterministically prepare Dicke states |D<sub>k</sub><sup>n</sup>> (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 [Mukherjee et.al. TQE'2020, Cruz et.al. QuTe'2019]. 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 [Brtschi 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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1