Efficient quantum algorithms to construct arbitrary Dicke states

DOI10.1007/s11128-014-0797-8zbMath1307.81026arXiv1209.5932OpenAlexW2011339338MaRDI QIDQ481642

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

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

Grover algorithmsymmetric Boolean functionsDeutsch-Jozsa algorithmDicke stateKrawtchouk polynomialbiased Hadamard transformparity measurement

Mathematics Subject Classification ID

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

Related Items (1)

Entanglement generation and entanglement concentration of two-photon four-dimensional spatial modes partially entangled Dicke state

Cites Work

• New upper bounds on the Boolean circuit complexity of symmetric functions
• The spectrum of symmetric Krawtchouk matrices
• On integral zeros of Krawtchouk polynomials
• Universal gates for transforming multipartite entangled Dicke states
• Rapid solution of problems by quantum computation
• THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS
• Coherence in Spontaneous Radiation Processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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