Quantum 1 classical 0 Bell nonlocality universally confirmed in any large communication

first_img Fig. 4. The scheme of the proof of Theorem 1. (A) an initial protocol evaluating function f with bias 1/6, using Q qubits; (B) memoryless protocol, with the same bias, using Q2 qubits; (C) protocol P‾ using quantum correlations and Q2 qubits, with bias still about 1/6; (D) protocol P‾ gives small bias for any classical correlation Rc if Q2 is sufficiently smaller than C(f, 2/3). Harry Buhrman, H. et al. (2016) Quantum communication complexity advantage implies violation of a Bell inequality. Proc Natl Acad Sci USA 113 (12) 3191-3196. Fig. 3. Exchange of the information after simultaneous teleportations to reveal the path of the teleported system in a three-round protocol. After Alice’s teleportation measurement in the first round the state ended up in port 1. Then, Bob teleports each of the two ports from the array that he used in the previous round, obtaining the outcomes 2 and 3 for ports 1 and 2, respectively. Finally, Alice performs a teleportation measurement for each of her four ports, obtaining the outcomes 2,4,5,8 for the ports 1,2,3,4, respectively. A defines a path q to be a sequence of teleportation outcomes: q={i1,1 =1, i2,1 =2, i3,2 =4}. The last node of the path points to the system, whose outcome provides Bob’s guess. Recall that the measurements are performed at the same time, and the sequential multiround protocol consists only of the exchange of classical information obtained after teleportation. The latter is required to identify the last node of the path, which is used to make a guess about the value of the function. Harry Buhrman, H. et al. (2016) Quantum communication complexity advantage implies violation of a Bell inequality. Proc Natl Acad Sci USA 113 (12) 3191-3196. More information: Quantum communication complexity advantage implies violation of a Bell inequality, Proceedings of the National Academy of Sciences March 22, 2016 vol. 113 no. 12 3191-3196, doi:10.1073/pnas.1507647113 Related:1Asymptotic teleportation scheme as a universal programmable quantum processor, Physics Review Letters (2008) 101(24):240501, doi:10.1103/PhysRevLett.101.2405012Quantum teleportation scheme by selecting one of multiple output ports, Physical Review A (2009) 79(4):042306, doi:10.1103/PhysRevA.79.042306 (Phys.org)—The relationship between communication complexity problems, Bell nonlocal correlations and the advantage of quantum over classical strategies has long been recognized, but has been confirmed in only two problems. Recently, however, scientists at University of Cambridge, University of Amsterdam, CWI, QuSoft, Gdansk University, Gdansk University of Technology, Adam Mickiewicz University, and Jagiellonian University employed a two-part method based on port-based teleportation – a scheme of quantum teleportation where a receiver has multiple (N) output ports and obtains the teleported state by merely selecting one of the N ports1,2. The researchers used the quantum protocol based on the given communication complexity game to construct a set of quantum measurements on a maximally entangled state to show that any large advantage over the best known classical strategy makes use of Bell nonlocal correlations. In so doing, the researchers assert, they have provided the missing link to the fundamental equivalence between Bell nonlocality and quantum advantage. Moreover, their results have significant implications for classical information processing and the development of more efficient teleportation protocols. To establish the connection between communication complexity and the violation of a Bell inequality, the scientists had to devise two things: a systematic way of obtaining correlations from any quantum strategy, and a suitable Bell inequality which would be violated by these correlations. “A particular obstacle which we had to overcome was to find a way of dealing with strategies which involved multiple rounds of communication, since previous tools allowed us to address only the case of single round algorithms,” Strelchuk explains. “Our key insight was to utilize a port-based teleportation protocol, which overcame this limitation wonderfully.” Fig. 1. The structure of a single round of the protocol. Alice applies Ux to her system, which if followed by Bob’s unitary Uy. Bob has no information about the outcome of Alice’s port-based teleportation, iA1 , so he teleports each of his qudit* subsystems individually, obtaining iB1,1, iB1,2, …. Credit: Harry Buhrman, H. et al. (2016) Quantum communication complexity advantage implies violation of a Bell inequality. Proc Natl Acad Sci USA 113 (12) 3191-3196. (*a generalization of the qubit to a d-dimensional Hilbert space) , Physical Review A The paper also reports a simpler method for one-way communication complexity problems. “For one-way communication complexity problems – that is, where in order to compute the value of a function one party is allowed to send a single message to another – there is no need to use the heavy guns of port-based teleportation. Instead, we use a much simpler procedure called remote state preparation.” Quantum teleportation uses prior entanglement and forward classical communication to transmit one instance of an unknown quantum state. Remote state preparation (RSP) has the same goal, but the sender knows classically what state is to be transmitted.Relatedly, the paper describes potential approaches for devising a more efficient teleportation protocol or improving one of the existing ones based on more efficient methods of exhibiting the Bell nonlocality of quantum communication complexity schemes. “One potential pathway to improvement is to devise a more efficient teleportation protocol. Our central tool, the port-based teleportation protocol, uses a large entangled state to teleport with a high probability of success. Moreover, a teleportation protocol with higher probability of success which consumes less entanglement would result in even larger values of the ratio of the quantum value to the classical value of the Bell quantity – but at present, we don’t know if such protocols exist.”Finally, the new method does not cover the protocols with initial entanglement, which the researchers describe as paradoxical because protocols that use initial entanglement should be even more explicitly Bell nonlocal. “Interestingly, if the parties which solve a communication complexity problem are already entangled then it should be possible to devise a Bell inequality that will be violated by the correlations originated from the measurement statistics of the algorithm. However,” Strelchuk adds, “a technical requirement in our construction makes it inapplicable to this setting.” As a result, the scientists concluded that it is desirable to search for a method of demonstrating the Bell nonlocality of such protocols. “Devising a method of showing that quantum communication complexity advantage implies violation of a Bell inequality when parties share initial entanglement is highly desirable,” he acknowledges, “as it would not only prove the equivalence between these two areas at the highest possible level of generality, but it may also shed light on how we could take advantage of pre-shared entanglement to make algorithms more efficient.” Moving forward, Strelchuk says that the researchers want to focus on reducing the gap between classical and quantum communication complexity required for their results to hold. “This gap arises as a technical artifact in our proof,” he tells Phys.org, “and there seems to be no apparent reason why it should exist. Another promising direction to pursue is the development of novel teleportation protocols which would consume less entanglement and provide higher probability of success…and the latter direction is interesting in its own right. As witnessed by our results,” Strelchuk concludes, “the applications of new teleportation protocols often surpass their intended purpose and find uses in other unrelated areas of quantum information processing.” Journal information: Proceedings of the National Academy of Scienceslast_img read more

Read More →