• Corpus ID: 116658048

Algorithmic constructions of unitary matrices and tight frames

@article{Tremain2011AlgorithmicCO,
  title={Algorithmic constructions of unitary matrices and tight frames},
  author={Janet C. Tremain},
  journal={arXiv: Functional Analysis},
  year={2011}
}
  • J. Tremain
  • Published 23 April 2011
  • Computer Science
  • arXiv: Functional Analysis
We give a number of algorithms for constructing unitary matrices and tight frames with specialized properties. These were produced at the request of researchers at the Frame Research Center (www.framerc.org) to help with their research on fusion frames, the Kadison-Singer Problem and equiangular tight frames. 

A recursive construction of a class of finite normalized tight frames

Finite normalized tight frames are interesting because they provide decompositions in applications and some physical interpretations. In this article, we give a recursive method for constructing them.

Tetris Tight Frames Construction via Hadamard Matrices

We present a new method to construct unit norm tight frames by applying altered Hadamard matrices. Also we determine an elementary construction which can be used to produce a unit norm frame with

Channel-state duality and the separability problem

Separability of quantum states is analyzed with the use of the Choi-Jamiolkowski isomorphism. Spectral separability criteria are derived. The presented approach is illustrated with various examples,

Construction of genuinely entangled subspaces and the associated bounds on entanglement measures for mixed states

  • K. Antipin
  • Physics
    Journal of Physics A: Mathematical and Theoretical
  • 2021
Genuine entanglement is the strongest form of multipartite entanglement. Genuinely entangled pure states contain entanglement in every bipartition and as such can be regarded as a valuable resource

A pr 2 02 1 Construction of genuinely multipartite entangled subspaces and the associated bounds on entanglement measures for mixed states

Genuine entanglement is the strongest form of multipartite entanglement. Genuinely entangled pure states contain entanglement in every bipartition and as such can be regarded as a valuable resource

References

SHOWING 1-3 OF 3 REFERENCES

PROJECTIONS AND THE KADISON-SINGER PROBLEM

We prove some new equivalences of the paving conjecture and obtain some estimates on the paving constants. In addition we give a new family of counterexamples to one of the Akemann-Anderson

CONCRETE CONSTRUCTIONS OF NON-PAVABLE PROJECTIONS

It is known that the paving conjecture fails for 2-paving projections with constant diagonal 1/2. But the proofs of this fact are existence proofs. We will give concrete examples of these projections

The Kadison–Singer Problem in mathematics and engineering

  • P. CasazzaJ. Tremain
  • Mathematics
    Proceedings of the National Academy of Sciences of the United States of America
  • 2006
We will see that the famous intractible 1959 Kadison–Singer Problem in C*-algebras is equivalent to fundamental open problems in a dozen different areas of research in mathematics and engineering.