A Tsirelson bound is an upper limit to quantum mechanical correlations between distant events. Given that quantum mechanics is non-local, i.e., that… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

- Avishy Carmi, Daniel Moskovich
- Entropy
- 2018

Why does nature only allow nonlocal correlations up to Tsirelson’s bound and not beyond? We construct a channel whose input is… (More)

Is this relevant?

2015

2015

- Shahar Bar, Joseph Tabrikian
- IEEE Transactions on Signal Processing
- 2015

How accurately can one estimate a random parameter subject to unknown deterministic nuisance parameters? The hybrid Cramér-Rao… (More)

Is this relevant?

2014

2014

- Martin Ringbauer, Alessandro Fedrizzi, Dominic W. Berry, Andrew G. White
- 2014 Conference on Lasers and Electro-Optics…
- 2014

We optically demonstrate violation of the CHSH-Bell inequality and Tsirelson's bound via loss and postselection. This enables us… (More)

Is this relevant?

2008

2008

Tsirelson showed that 2 √ 2 is the maximum value that CHSH expression can take for quantumcorrelations [B. S. Tsirelson Lett… (More)

Is this relevant?

2008

2008

- Hans-Joachim Kroll, Rita Vincenti
- Discrete Mathematics
- 2008

In 1964 F.J.Mac Williams introduced the technique of permutation decoding which uses a subset of the automorphism group of the… (More)

Is this relevant?

2006

2006

No signalling condition by itself does not answer the question why quantum-mechanics violates Bell’s inequality by not more than… (More)

Is this relevant?

2004

2004

- Wen Xu, Arthur B. Baggeroer, Christ D. Richmond
- IEEE Transactions on Signal Processing
- 2004

Matched-field methods concern estimation of source locations and/or ocean environmental parameters by exploiting full wave… (More)

Is this relevant?

1997

1997

- Gary McGuire
- J. Comb. Theory, Ser. A
- 1997

A binary (n, M, d ) code C is a subset of [0, 1] with M elements such that any two elements of C differ in at least d coordinates… (More)

Is this relevant?

1996

1996

- Willem H. Haemers, Vladimir D. Tonchev
- Des. Codes Cryptography
- 1996

A spread of a strongly regular graph is a partition of the vertex set into cliques that meet Delsarte's bound (also called… (More)

Is this relevant?

1982

1982

- O F M I N I M U M TRACE
- 1982

One of the intriguing questions of factor analysis is the extent to which one can reduce the rank of a symmetric matrix by only… (More)

Is this relevant?