Efficient quantum algorithms to construct arbitrary Dicke states

K Chakraborty, BS Choi, A Maitra, S Maitra - Quantum information …, 2014 - Springer
Quantum information processing, 2014Springer
In this paper, we study several quantum algorithms toward the efficient construction of
arbitrary arbitrary Dicke state. The proposed algorithms use proper symmetric Boolean
functions that involve manipulation with Krawtchouk polynomials. Deutsch–Jozsa algorithm,
Grover algorithm, and the parity measurement technique are stitched together to devise the
complete algorithm. In addition to that we explore how the biased Hadamard transformation
can be utilized into our strategy, motivated by the work of Childs et al.(Quantum Inf Comput 2 …
Abstract
In this paper, we study several quantum algorithms toward the efficient construction of arbitrary arbitrary Dicke state. The proposed algorithms use proper symmetric Boolean functions that involve manipulation with Krawtchouk polynomials. Deutsch–Jozsa algorithm, Grover algorithm, and the parity measurement technique are stitched together to devise the complete algorithm. In addition to that we explore how the biased Hadamard transformation can be utilized into our strategy, motivated by the work of Childs et al. (Quantum Inf Comput 2(3):181–191, 2002).
Springer
Showing the best result for this search. See all results