Weighing matrices and optical quantum computing

DOI10.1088/1751-8113/42/6/065302zbMATH Open1156.81009arXiv0808.2057OpenAlexW2055108425MaRDI QIDQ3605883FDOQ3605883

Authors: Simone Severini, Steven T. Flammia 

Publication date: 25 February 2009

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Abstract: Quantum computation in the one-way model requires the preparation of certain resource states known as cluster states. We describe how the construction of continuous-variable cluster states for optical quantum computing relate to the existence of certain families of matrices. The relevant matrices are known as weighing matrices, with a few additional constraints. We prove some results regarding the structure of these matrices, and their associated graphs.

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

Recommendations

• Quantum algorithms for weighing matrices and quadratic residues
• Publication:4939174
• Publication:4939175
• Quantum computation with scattering matrices
• QUANTUM OPTICS NETWORKS, UNITARY OPERATORS AND COMPUTER ALGEBRA
• Quantum computing and quadratically signed weight enumerators
• Weighted quantum measurements
• Efficient linear optics quantum computation
• Weighting gates in circuit complexity and holography
• Probabilistic quantum computation and linear optical realizations

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum optics (81V80)

Cited In (3)

• A feasibility approach for constructing combinatorial designs of circulant type
• Block weighing matrices
• New weighing matrices via partitioned group actions

This page was built for publication: Weighing matrices and optical quantum computing

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