Efficient quantum algorithms to construct arbitrary Dicke states

DOI10.1007/S11128-014-0797-8MaRDI QIDQ481642zbMATH OpenOpenAlexFDO

Authors Kaushik Chakraborty, Byung-Soo Choi, Arpita Maitra, Subhamoy Maitra

Publication date 12 December 2014

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1209.5932

zbMATH Keywords

symmetric Boolean functionsDeutsch-Jozsa algorithmDicke stateGrover algorithmKrawtchouk polynomialbiased Hadamard transformparity measurement

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Abstract: In this paper, we study efficient algorithms towards the construction of any arbitrary Dicke state. Our contribution is to use proper symmetric Boolean functions that involve manipulations with Krawtchouk polynomials. Deutsch-Jozsa algorithm, Grover algorithm and the parity measurement technique are stitched together to devise the complete algorithm. Further, motivated by the work of Childs et al (2002), we explore how one can plug the biased Hadamard transformation in our strategy. Our work compares fairly with the results of Childs et al (2002).

Recommendations

• Efficient Quantum Algorithms for Simulating Lindblad Evolution
• An algorithmic construction of quantum circuits of high descriptive complexity
• Efficient quantum algorithms for state measurement and linear algebra applications
• Efficient Algorithms for Universal Quantum Simulation
• Deterministic preparation of Dicke states
• Efficient discrete approximations of quantum gates
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Efficient algebraic representation of quantum circuits
• Efficient Construction of Functional Representations for Quantum Algorithms
• Efficient circuits for exact-universal computation with qudits

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 5320186 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1894268 (Why is no real title available?)
• Chaos for a class of complex epidemiological models
• Coherence in Spontaneous Radiation Processes
• Efficient search for symmetric Boolean functions under constraints on Walsh spectrum values
• New upper bounds on the Boolean circuit complexity of symmetric functions
• On integral zeros of Krawtchouk polynomials
• Rapid solution of problems by quantum computation
• THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS
• The spectrum of symmetric Krawtchouk matrices
• Universal gates for transforming multipartite entangled Dicke states

Cited in

(3)

• Universal gates for transforming multipartite entangled Dicke states
• Entanglement generation and entanglement concentration of two-photon four-dimensional spatial modes partially entangled Dicke state
• q-analog qudit Dicke states

This page was built for publication: Efficient quantum algorithms to construct arbitrary Dicke states

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q481642)