Accedi

Bibliografie tematiche / Pseudo-Telepathy

Indice

Articoli di riviste
Tesi
Capitoli di libri
Atti di convegni

Letteratura scientifica selezionata sul tema "Pseudo-Telepathy"

Autore: Grafiati

Pubblicato: 4 giugno 2021

Ultima modifica: 1 febbraio 2022

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Pseudo-Telepathy".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Articoli di riviste sul tema "Pseudo-Telepathy"

1

Brassard, Gilles, Anne Broadbent e Alain Tapp. "Quantum Pseudo-Telepathy". Foundations of Physics 35, n. 11 (novembre 2005): 1877–907. http://dx.doi.org/10.1007/s10701-005-7353-4.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

2

FIALÍK, IVAN. "SEPARATION BETWEEN CLASSICAL AND QUANTUM WINNING STRATEGIES FOR THE MATCHING GAME". International Journal of Foundations of Computer Science 19, n. 06 (dicembre 2008): 1449–59. http://dx.doi.org/10.1142/s0129054108006388.

Testo completo

Abstract (sommario):

Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems. Quantum information processing can be used to reduce the amount of communication required to carry out some distributed problems. We speak of pseudo-telepathy when it is able to completely eliminate the need for communication. The matching game is the newest member of the family of pseudo-telepathy games. After introducing a general model for pseudo-telepathy games, we focus on the question what the smallest size of inputs is for which the matching game is a pseudo-telepathy game.

Gli stili APA, Harvard, Vancouver, ISO e altri

3

Gawron, P., e Ł. Pawela. "Relativistic Quantum Pseudo-telepathy". Acta Physica Polonica B 47, n. 4 (2016): 1147. http://dx.doi.org/10.5506/aphyspolb.47.1147.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

4

GISIN, NICOLAS, ANDRÉ ALLAN MÉTHOT e VALERIO SCARANI. "PSEUDO-TELEPATHY: INPUT CARDINALITY AND BELL-TYPE INEQUALITIES". International Journal of Quantum Information 05, n. 04 (agosto 2007): 525–34. http://dx.doi.org/10.1142/s021974990700289x.

Testo completo

Abstract (sommario):

Pseudo-telepathy is the most recent form of rejection of locality. Many of its properties have already been discovered: for instance, the minimal entanglement, as well as the minimal cardinality of the output sets, have been characterized. This paper contains two main results. First, we prove that no bipartite pseudo-telepathy game exists, in which one of the partners receives only two questions; as a corollary, we show that the minimal "input cardinality", that is, the minimal number of questions required in a bipartite pseudo-telepathy game, is 3 × 3. Second, we study the Bell-type inequality derived from the pseudo-telepathy game known as the Magic Square game: we demonstrate that it is a tight inequality for 3 inputs and 4 outputs on each side and discuss its weak resistance to noise.

Gli stili APA, Harvard, Vancouver, ISO e altri

5

Brassard, G., A. A. Methot e A. Tapp. "Minimum entangled state dimension required for pseudo-telepathy". Quantum Information and Computation 5, n. 4&5 (luglio 2005): 275–84. http://dx.doi.org/10.26421/qic5.45-2.

Testo completo

Abstract (sommario):

Pseudo-telepathy provides an intuitive way of looking at Bell's inequalities, in which it is often obvious that feats achievable by use of quantum entanglement would be classically impossible. A~two-player pseudo-telepathy game proceeds as follows: Alice and Bob are individually asked a question and they must provide an answer. They are \emph{not} allowed any form of communication once the questions are asked, but they may have agreed on a common strategy prior to the execution of the game. We~say that they \emph{win} the game if the questions and answers fulfil a specific relation. A~game exhibits \emph{pseudo-telepathy} if there is a quantum strategy that makes Alice and Bob win the game for all possible questions, provided they share prior entanglement, whereas it would be impossible to win this game systematically in a classical setting. In~this paper, we show that any two-player pseudo-telepathy game requires the quantum players to share an entangled quantum system of dimension at least~\mbox{$3 \times 3$}. This is optimal for two-player games, but the most efficient pseudo-telepathy game possible, in terms of total dimension, involves \emph{three} players who share a quantum system of dimension~\mbox{$2 \times 2 \times 2$}.

Gli stili APA, Harvard, Vancouver, ISO e altri

6

Kunkri, S., G. Kar, S. Ghosh e A. Roy. "Winning strategies for pseudo-telepathy games using single non-local box". Quantum Information and Computation 7, n. 4 (maggio 2007): 319–28. http://dx.doi.org/10.26421/qic7.4-3.

Testo completo

Abstract (sommario):

Using a single NL-box, a winning strategy is given for the impossible colouring pseudo-telepathy game for the set of vectors having Kochen-Specker property in four dimension. A sufficient condition given regarding the structure of the impossible colouring pseudo-telepathy game for general $d$-dimension. A winning strategy for this game is then described with single use of NL-box.

Gli stili APA, Harvard, Vancouver, ISO e altri

7

Anshu, Anurag, e Mehdi Mhalla. "Pseudo-telepathy games using graph states". Quantum Information and Computation 13, n. 9&10 (settembre 2013): 833–45. http://dx.doi.org/10.26421/qic13.9-10-6.

Testo completo

Abstract (sommario):

We define a family of pseudo-telepathy games using graph states that extends the Mermin games. This family also contains a game used to define a quantum probability distribution that cannot be simulated by any number of nonlocal boxes. We extend this result, proving that the probability distribution obtained by the Paley graph state on 13 vertices (each vertex corresponds to a player) cannot be simulated by any number of 4-partite nonlocal boxes and that the Paley graph states on $k^{2}2^{2k-2}$ vertices provide a probability distribution that cannot be simulated by $k$-partite nonlocal boxes, for any $k$.

Gli stili APA, Harvard, Vancouver, ISO e altri

8

Anshu, Anurag, Peter Høyer, Mehdi Mhalla e Simon Perdrix. "Contextuality in multipartite pseudo-telepathy graph games". Journal of Computer and System Sciences 107 (febbraio 2020): 156–65. http://dx.doi.org/10.1016/j.jcss.2019.06.005.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

9

Veljković, Bojan M. "Nauka ili pseudonauka – primer istraživanja telepatije". Узданица 18, n. 1 (giugno 2021): 83–101. http://dx.doi.org/10.46793/uzdanica18.1.083v.

Testo completo

Abstract (sommario):

It is not always easy to draw a dividing line between true scientific theo- ries, erroneous but verifiable scientific theories and pseudo-scientific ones that are impos- sible to verify. As an example, this paper presents researches on various phenomena of extra-sensory perception, precognition, clairvoyance, distance communication, premonition for receiving SMS messages, phone calls or e-mails, which are classified in the domain of telepathy research. They were conducted within different paradigms, with diverse re- search methodologies and approaches, from anecdotal experiences, case studies and intui- tive reasoning, to careful recording of data and their statistical processing. In recent years, researches have been conducted using state-of-the-art “brain-to-brain” technology, which is used to register brain activities of the research participants. Telepathy has not remained uninteresting even to some modern physicists who find in Einstein’s theory of relativity and the laws of quantum physics the possibility of postulating a new quantum model of telepathy. This new, unconventional approach to the research of telepathy is conditioned by the paradigm shift in the research of this phenomenon and significant shifts from the pseudo-scientific to the scientific approach. This paper aims to point out the necessity of setting a clear demarcation line between scientific and pseudo-scientific research and building the ability of critical thinking, which is a condition for differentiating science from pseudoscience. Using a specific example of the phenomenon of telepathy, we underlined the importance of research in the development of scientific knowledge, but the kind of research that meets the reproducibility and verifiability criteria that clearly differentiate science from pseudoscience.

Gli stili APA, Harvard, Vancouver, ISO e altri

10

Pawela, Łukasz, Piotr Gawron, Zbigniew Puchała e Jan Sładkowski. "Enhancing Pseudo-Telepathy in the Magic Square Game". PLoS ONE 8, n. 6 (6 giugno 2013): e64694. http://dx.doi.org/10.1371/journal.pone.0064694.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Più fonti

Tesi sul tema "Pseudo-Telepathy"

1

Ambühl, Tobias. "Secure bits with quantum pseudo-telepathy". Zurich : ETH, Swiss Federal Institute of Technology, Department of Computer Science, Institute of Theoretical Computer Science, 2009. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=428.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

2

Newman, Michael William. "Independent Sets and Eigenspaces". Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1151.

Testo completo

Abstract (sommario):

The problems we study in this thesis arise in computer science, extremal set theory and quantum computing. The first common feature of these problems is that each can be reduced to characterizing the independent sets of maximum size in a suitable graph. A second common feature is that the size of these independent sets meets an eigenvalue bound due to Delsarte and Hoffman. Thirdly, the graphs that arise belong to association schemes that have already been studied in other contexts. Our first problem involves covering arrays on graphs, which arises in computer science. The goal is to find a smallest covering array on a given graph G. It is known that this is equivalent to determining whether G has a homomorphism into a covering array graph, CAG(n,g). Thus our question: Are covering array graphs cores? A covering array graph has as vertex set the partitions of {1,. . . ,n} into g cells each of size at least g, with two vertices being adjacent if their meet has size g². We determine that CAG(9,3) is a core. We also determine some partial results on the family of graphs CAG(g²,g). The key to our method is characterizing the independent sets that meet the Delsarte-Hoffman bound---we call these sets ratio-tight. It turns out that CAG(9,3) sits inside an association scheme, which will be useful but apparently not essential. We then turn our attention to our next problem: the Erdos-Ko-Rado theorem and its q-analogue. We are motivated by a desire to find a unifying proof that will cover both versions. The EKR theorem gives the maximum number of pairwise disjoint k-sets of a fixed v-set, and characterizes the extremal cases. Its q-analogue does the same for k-dimensional subspaces of a fixed v-dimensional space over GF(q). We find that the methods we developed for covering array graphs apply to the EKR theorem. Moreover, unlike most other proofs of EKR, our argument applies equally well to the q-analogue. We provide a proof of the characterization of the extremal cases for the q-analogue when v=2k; no such proof has appeared before. Again, the graphs we consider sit inside of well-known association schemes; this time the schemes play a more central role. Finally, we deal with the problem in quantum computing. There are tasks that can be performed using quantum entanglement yet apparently are beyond the reach of methods using classical physics only. One particular task can be solved classically if and only if the graph Ω(n) has chromatic number n. The graph Ω(n) has as vertex set the set of all ± 1 vectors of length n, with two vertices adjacent if they are orthogonal. We find that n is a trivial upper bound on the chromatic number, and that this bound holds with equality if and only if the Delsarte-Hoffman bound on independent sets does too. We are thus led to characterize the ratio-tight independent sets. We are then able to leverage our result using a recursive argument to show that χ(Ω(n)) > n for all n > 8. It is notable that the reduction to independent sets, the characterization of ratio-tight sets, and the recursive argument all follow from different proofs of the Delsarte-Hoffman bound. Furthermore, Ω(n) also sits inside a well-known association scheme, which again plays a central role in our approach.

Gli stili APA, Harvard, Vancouver, ISO e altri

3

Broadbent, Anne Lise. "Quantum pseudo-telepathy games". Thèse, 2004. http://hdl.handle.net/1866/14563.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

4

Broadbent, Anne Lise. "Quantum nonlocality, cryptography and complexity". Thèse, 2008. http://hdl.handle.net/1866/6448.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Capitoli di libri sul tema "Pseudo-Telepathy"

1

Brassard, Gilles, Anne Broadbent e Alain Tapp. "Multi-party Pseudo-Telepathy". In Lecture Notes in Computer Science, 1–11. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45078-8_1.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

2

Anshu, Anurag, Peter Høyer, Mehdi Mhalla e Simon Perdrix. "Contextuality in Multipartite Pseudo-Telepathy Graph Games". In Fundamentals of Computation Theory, 41–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-55751-8_5.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

3

Mančinska, Laura. "Maximally Entangled State in Pseudo-Telepathy Games". In Computing with New Resources, 200–207. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-13350-8_15.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

4

Basak, Jyotirmoy, Arpita Maitra e Subhamoy Maitra. "Device Independent Quantum Key Distribution Using Three-Party Pseudo-Telepathy". In Lecture Notes in Computer Science, 456–71. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-35423-7_23.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Atti di convegni sul tema "Pseudo-Telepathy"

1

Kunkri, Samir. "Understanding quantum non-locality through pseudo-telepathy game". In QUANTUM COMPUTING: Back Action 2006. AIP, 2006. http://dx.doi.org/10.1063/1.2400894.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!