Connect with us


Trump Administration slashes basic science research while boosting space, AI and quantum tech funding



The new fiscal year 2021 budget proposal from the Trump Administration would increase funding for research and development by $142 billion over the Administration’s previous year’s budget, but will still reduce overall spending for science and technology from alternative proposals coming from the U.S. House of Representatives.

Basic science funding would be hard hit under the Trump Administration priorities.

A rundown of all of the programs that would be cut under the Administration’s budget was published by Science Magazine and it includes:

  • National Institutes of Health: a cut of 7%, or $2.942 billion, to $36.965 billion
  • National Science Foundation (NSF): a cut of 6%, or $424 million, to $6.328 billion
  • Department of Energy’s (DOE’s) Office of Science: a cut of 17%, or $1.164 billion, to $5.760 billion
  • NASA science: a cut of 11%, or $758 million, to $6.261 billion
  • DOE’s Advanced Research Projects Agency-Energy: a cut of 173%, which would not only eliminate the $425 million agency, but also force it to return $311 million to the U.S. Department of the Treasury
  • U.S. Department of Agriculture’s (USDA’s) Agricultural Research Service: a cut of 12%, or $190 million, to $1.435 billion
  • National Institute of Standards and Technology: a cut of 19%, or $154 million, to $653 million
  • National Oceanic and Atmospheric Administration: a cut of 31%, or $300 million, to $678 million
  • Environmental Protection Agency science and technology: a cut of 37%, or $174 million, to $318 million
  • Department of Homeland Security science and technology: a cut of 15%, or $65 million, to $357 million
  • U.S. Geological Survey: a cut of 30%, or $200 million, to $460 million

However, certain areas where venture investors and startups spend a lot of time should see a funding boost. These include new money for research and development in industries developing new machine learning and quantum computing technologies.

Artificial intelligence allocations across the National Science Foundation, the Department of Energy’s Office of science, and the Defense Advanced Research Projects Agency and the Department of Defense’s Joint AI Center will reach a combined $1.724 billion — with portions of an additional $150 million allocation for the Department of Agriculture and the National Institutes of Health going to AI research.

Quantum information science is another area that’s set for a windfall of government dollars under the proposed Trump Administration Budget. The National Science Foundation will receive $210 million for quantum research, while the Department of Energy will receive a $237 million boost and an additional carve out of $25 million for the Depart of Energy to begin development of a nationwide Quantum Internet.

“Quantum computing, networking and sensing technologies are areas of incredible potential,” said Paul Dabbar, the under secretary for science at the Department of Energy.

As part of this development, Dabbar pointed to the work underway at the University of Chicago, where partners including the Argonne National Laboratory, Fermi Laboratory and the university have already launched a 52 mile quantum communication loop in Chicago.

There are plans underway to create six quantum internet nodes in the midwest and another node in Long Island near New York City to create a Northeastern quantum network hub.

“This will be the backbone of a national quantum internet extending coast to coast and border to border,” said Dabbar. “If we don’t, others will do it,” he said. “China and the EU have announced plans for investments in the area.”

White House reportedly aims to double AI research budget to $2B

Space is another area where spending will see a boost, under the Trump budget.

A key part of the package is a 12 percent boost to the budget of the National Aeronautics and Space Administration, as the administration aims to get astronauts back on the surface of the moon by 2024. In all, the new budget will add $3 billion to funding for NASA to develop things like human landers and other technologies to capitalize on the potential assets and strategic importance of space. In all NASA will receive $25.2 billion, while the newly created Space Force will see an allocation of $15.4 billion in the new budget.

The budget will double research and development spending for quantum information science and non-defense artificial intelligence by the 2022 fiscal year, according to a statement from the administration.

2021 NASA budget request includes $3.3B for human lunar landers, $430M for Moon resource development

Much of the administration’s budget seems focused on spending to catch up in areas where the U.S. may be losing its technological edge. China already spends tens of billions of dollars on research in both quantum computing and artificial intelligence.

While spending on quantum computing and artificial intelligence advances, the Trump Administration continues to slash budgets in other areas dependent on scientific study — where the discoveries of the scientific community and their implications contradict the political wishes of the President.

That includes the Environmental Protection Agency, which would see its total budget slashed by 26.5 percent over the next year. The Department of Health and Human Services would see its budget allocation shrink by 9 percent — although the administration actually plans to avoid cutting the budget for combating infections diseases through the Centers for Disease Control and Prevention.

Few of these allocations will actually make it through the Congressional budgeting process, since the Democrats control the House of Representatives and the most draconian parts of the budget proposed by the administration couldn’t even pass a Congress controlled by Republicans.

Read more:

Continue Reading


President Reif testifies before Congress on U.S. competitiveness



No U.S. strategy to respond to competition from China will succeed unless it includes increased investment in research, a concerted effort to attract more students to key research fields, and a more creative approach to turning ideas into commercial products, MIT President L. Rafael Reif said in congressional testimony on Wednesday, Feb. 26.

Reif spoke at a hearing of the House Ways and Means Committee on “U.S.-China Trade and Competition.”

“Whatever else the U.S. does to counter the challenges posed by China, we must increase our investment in research in key technology areas, and we must enhance our capacity to get the most out of that investment,” he told the panel. “U.S. strategy is unlikely to succeed if it is merely defensive; to stay ahead, the U.S. needs to do more to capitalize on our own strengths.”

Reif’s Capitol Hill appearance came immediately after he delivered an opening talk at a National Academy of Sciences (NAS)_event commemorating the 75th anniversary of “Science, The Endless Frontier,” a 1945 report to U.S. President Harry S. Truman that is seen as the founding document of the post-World War II research system in the U.S. The report was written by the late Vannevar Bush, who had a long career at MIT, including service as the Institute’s vice president and dean of engineering.

At both the NAS and on Capitol Hill, Reif called for a “visible, focused, and sustained” federal program that would increase funding for research and target the increase at key technologies, such as artificial intelligence, quantum computing, and advanced communications.

“The U.S. lacks an effective, coordinated way to target research toward specific areas and funding has fallen far behind what’s needed to stay ahead of our competitors,” Reif told Congress. “One promising proposal is to create a new directorate at the National Science Foundation with that mission, and giving that new unit the authority to be run more like the Defense Advanced Research Projects Agency (DARPA).”

Reif also said that attracting top talent is another essential element of a successful strategy. “At the university level, that requires two parallel tasks — attracting top U.S. students to key fields, and attracting and retaining the best researchers from around the world,” he said.

Specifically, he called for new programs to offer federal support to undergraduates, graduate students, and postdocs who are willing to study in fields related to key technologies. He also said foreign students who receive a U.S. doctorate should immediately be given a green card to settle in the U.S., and he warned against anti-immigrant rhetoric.

Finally, Reif said the U.S. needs to experiment with ways to speed the transition of ideas from lab to market. He called for new ways to de-risk technologies and to create more patient capital, and suggested that the Ways and Means Committee, which has jurisdiction over tax policy, should look at tax policies to create incentives for longer-term investment and to foster more university-industry cooperation.

“The U.S. edge in science and technology has been a foundation for U.S. security, prosperity, and quality of life,” Reif said, in conclusion. “But that edge has to be regularly honed; it is not ours by right or by nature. We can best sharpen it with a strategy founded on confidence in ourselves, not fear of others.”

Two weeks ago, Vice President for Research Maria Zuber delivered a similar message to Congress, in testimony before the House Permanent Select Committee on Intelligence on how to improve the intelligence services’ access to science and technology.

Zuber said that to help the intelligence services, the U.S. needs to capitalize on its strengths, which she said include “world-class universities, an open research system, and the ability to attract and retain top talent from around the world.”

Like Reif, Zuber highlighted a proposal to create a new technology directorate at the National Science Foundation, as well as the need to attract talent domestically and from abroad. She also cited MIT’s AI Accelerator — a cooperative project between MIT and the U.S. Air Force — as the kind of cooperative work that the intelligence services could foster.

In her testimony, Zuber emphasized the need to maintain an open U.S. research system: “The U.S. faces new challenges and competitors,” she said, “but we are well-placed to succeed if we get the most from our unrivaled strengths.”


Continue Reading


Classical and Quantum Algorithms for Tensor Principal Component Analysis



Matthew B. Hastings

Station Q, Microsoft Research, Santa Barbara, CA 93106-6105, USA
Microsoft Quantum and Microsoft Research, Redmond, WA 98052, USA

Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.


We present classical and quantum algorithms based on spectral methods for a problem in tensor principal component analysis. The quantum algorithm achieves a $quartic$ speedup while using exponentially smaller space than the fastest classical spectral algorithm, and a super-polynomial speedup over classical algorithms that use only polynomial space. The classical algorithms that we present are related to, but slightly different from those presented recently in Ref. [1]. In particular, we have an improved threshold for recovery and the algorithms we present work for both even and odd order tensors. These results suggest that large-scale inference problems are a promising future application for quantum computers.

► BibTeX data

► References

[1] Alexander S Wein, Ahmed El Alaoui, and Cristopher Moore. The kikuchi hierarchy and tensor pca. 2019. arXiv:1904.03858.

[2] Andrea Montanari and Emile Richard. A statistical model for tensor pca. In Advances in Neural Information Processing Systems, pages 2897–2905, 2014.

[3] Thibault Lesieur, Leo Miolane, Marc Lelarge, Florent Krzakala, and Lenka Zdeborova. Statistical and computational phase transitions in spiked tensor estimation. In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, jun 2017. doi:10.1109/​isit.2017.8006580.

[4] Samuel B Hopkins, Jonathan Shi, and David Steurer. Tensor principal component analysis via sum-of-square proofs. In Conference on Learning Theory, pages 956–1006, 2015.

[5] Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, and David Steurer. Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing – STOC 2016. ACM Press, 2016. doi:10.1145/​2897518.2897529.

[6] Vijay V. S. P. Bhattiprolu, Mrinalkanti Ghosh, Euiwoong Lee, Venkatesan Guruswami, and Madhur Tulsiani. Multiplicative approximations for polynomial optimization over the unit sphere. CoRR, abs/​1611.05998, 2016. URL: http:/​/​​abs/​1611.05998, arXiv:1611.05998.

[7] Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, and Madhur Tulsiani. Weak decoupling, polynomial folds and approximate optimization over the sphere. In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, oct 2017. doi:10.1109/​focs.2017.97.

[8] R.F. Werner. Large deviations and mean-field quantum systems. In Quantum Probability and Related Topics, pages 349–381. WORLD SCIENTIFIC, jul 1992. doi:10.1142/​9789814354783_0024.

[9] Christina V. Kraus, Maciej Lewenstein, and J. Ignacio Cirac. Ground states of fermionic lattice hamiltonians with permutation symmetry. Physical Review A, 88(2), aug 2013. doi:10.1103/​physreva.88.022335.

[10] Fernando G. S. L. Brandão and Aram W. Harrow. Product-state approximations to quantum states. Communications in Mathematical Physics, 342(1):47–80, jan 2016. doi:10.1007/​s00220-016-2575-1.

[11] Scott Aaronson and Lijie Chen. Complexity-theoretic foundations of quantum supremacy experiments. In 32nd Computational Complexity Conference (CCC 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017. arXiv:1612.05903.

[12] Madan Lal Mehta. Random matrices, volume 142. Elsevier, 2004.

[13] James Demmel, Ioana Dumitriu, and Olga Holtz. Fast linear algebra is stable. Numerische Mathematik, 108(1):59–91, oct 2007. doi:10.1007/​s00211-007-0114-x.

[14] Guang Hao Low and Isaac L. Chuang. Optimal Hamiltonian simulation by quantum signal processing. Phys. Rev. Lett., 118:010501, 2017. arXiv:1606.02685v2, doi:10.1103/​PhysRevLett.118.010501.

[15] Guang Hao Low and Isaac L Chuang. Hamiltonian simulation by qubitization. 2016. arXiv:1610.06546 https:/​/​​10.22331/​q-2019-07-12-163.

[16] Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma. Exponential improvement in precision for simulating sparse Hamiltonians. pages 283–292, 2014. arXiv:1312.1414, doi:10.1145/​2591796.2591854.

[17] Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma. Simulating Hamiltonian dynamics with a truncated Taylor series. Phys. Rev. Lett., 114:090502, 2015. arXiv:1412.4687, doi:10.1103/​PhysRevLett.114.090502.

[18] D. W. Berry, A. M. Childs, and R. Kothari. Hamiltonian simulation with nearly optimal dependence on all parameters. In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pages 792–809, Oct 2015. arXiv:1501.01715, doi:10.1109/​FOCS.2015.54.

[19] Alexei Yu Kitaev, Alexander Shen, and Mikhail N Vyalyi. Classical and quantum computation, volume 47. American Mathematical Society Providence, 2002. doi:10.1090/​gsm/​047.

[20] Gilles Brassard, Peter Hoyer, Michele Mosca, and Alain Tapp. Quantum amplitude amplification and estimation. Contemporary Mathematics, 305:53–74, 2002. doi:10.1090/​conm/​305.

[21] Anthony Carbery and James Wright. Distributional and ${L^q}$ norm inequalities for polynomials over convex bodies in ${R^n}$. Mathematical Research Letters, 8(3):233–248, 2001. doi:10.4310/​mrl.2001.v8.n3.a1.

[22] Dave Wecker, Matthew B. Hastings, Nathan Wiebe, Bryan K. Clark, Chetan Nayak, and Matthias Troyer. Solving strongly correlated electron models on a quantum computer. Physical Review A, 92(6), dec 2015. doi:10.1103/​physreva.92.062318.

[23] Matthew B. Hastings. The asymptotics of quantum max-flow min-cut. Communications in Mathematical Physics, 351(1):387–418, nov 2016. doi:10.1007/​s00220-016-2791-8.

Cited by

[1] Alexander S. Wein, Ahmed El Alaoui, and Cristopher Moore, “The Kikuchi Hierarchy and Tensor PCA”, arXiv:1904.03858.

The above citations are from SAO/NASA ADS (last updated successfully 2020-02-28 01:28:52). The list may be incomplete as not all publishers provide suitable and complete citation data.

On Crossref’s cited-by service no data on citing works was found (last attempt 2020-02-28 01:28:50).


Continue Reading


Analysing causal structures in generalised probabilistic theories



Mirjam Weilenmann1,2 and Roger Colbeck2

1Institute for Quantum Optics and Quantum Information (IQOQI) Vienna, Austrian Academy of Sciences, Boltzmanngasse 3, 1090 Vienna, AT
2Department of Mathematics, University of York, Heslington, York, YO10 5DD, UK

Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.


Causal structures give us a way to understand the origin of observed correlations. These were developed for classical scenarios, but quantum mechanical experiments necessitate their generalisation. Here we study causal structures in a broad range of theories, which include both quantum and classical theory as special cases. We propose a method for analysing differences between such theories based on the so-called measurement entropy. We apply this method to several causal structures, deriving new relations that separate classical, quantum and more general theories within these causal structures. The constraints we derive for the most general theories are in a sense minimal requirements of any causal explanation in these scenarios. In addition, we make several technical contributions that give insight for the entropic analysis of quantum causal structures. In particular, we prove that for any causal structure and for any generalised probabilistic theory, the set of achievable entropy vectors form a convex cone.

Quantum theory has many strange features that set it apart from the classical theory before it. Perhaps the most striking is the ‘spooky action at a distance’, where a quantum measurement on one particle leads to a state update on another that appears to go against the spirit of relativity theory, although without allowing superluminal signalling. In the 1960s Bell pinned this down more precisely by showing that describing quantum correlations in a causal model requires either dropping the notion of locality, or modifying the usual definition of causation.

In this work we consider modified notions of causation within a broad class of theories (generalised probabilistic theories) that include classical and quantum theory as special cases but also theories whose correlations are more ‘spooky’ than those in quantum mechanics. We show how to derive causal constraints within such theories, and apply our technique to a variety of causal structures. By studying causation in the most general post-quantum theory, we derive constraints that must hold for any causal explanations of correlations, and so can be understood as minimal requirements of causation itself. Furthermore, by comparing general constraints to those in quantum theory provides a way to investigate what is special about quantum mechanics.

► BibTeX data

► References

[1] J. S. Bell. On the Einstein Podolsky Rosen paradox. Physics, 1 (3): 195–200, 1964. ISSN 01923188. 10.1002/​prop.19800281202.

[2] C. J. Wood and R. W. Spekkens. The lesson of causal discovery algorithms for quantum correlations: causal explanations of Bell-inequality violations require fine-tuning. New Journal of Physics, 17 (3): 033002, 2015. ISSN 1367-2630. 10.1088/​1367-2630/​17/​3/​033002.

[3] M. Pawlowski, T. Paterek, D. Kaszlikowski, V. Scarani, A. Winter, and M. Zukowski. Information causality as a physical principle. Nature, 461 (7267): 1101–1104, 2009. ISSN 0028-0836. 10.1038/​nature08400.

[4] S. W. Al-Safi and A. J. Short. Information causality from an entropic and a probabilistic perspective. Physical Review A, 84 (4): 042323, 2011. ISSN 1050-2947. 10.1103/​PhysRevA.84.042323.

[5] J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt. Proposed experiment to test local hidden-variable theories. Physical Review Letters, 23 (15): 880–884, 1969. ISSN 0031-9007. 10.1103/​PhysRevLett.23.880.

[6] D. M. Greenberger, M. A. Horne, and A. Zeilinger. Going beyond Bell’s theorem. In M. Kafatos, editor, Bell’s Theorem, Quantum Mechanics and Conceptions of the Universe, pages 69–72. Kluwer Academic, Dordrecht, The Netherlands, 1989. 10.1007/​978-94-017-0849-4.

[7] T. Fritz. Beyond Bell’s theorem: correlation scenarios. New Journal of Physics, 14 (10): 103001, 2012. ISSN 1367-2630. 10.1088/​1367-2630/​14/​10/​103001.

[8] T. Fritz and R. Chaves. Entropic inequalities and marginal problems. IEEE Transactions on Information Theory, 59 (2): 803–817, 2013. ISSN 0018-9448. 10.1109/​TIT.2012.2222863.

[9] R. Chaves, C. Majenz, and D. Gross. Information-theoretic implications of quantum causal structures. Nature communications, 6: 5766, 2015. ISSN 2041-1723. 10.1038/​ncomms6766.

[10] M. Weilenmann and R. Colbeck. Non-Shannon inequalities in the entropy vector approach to causal structures. Quantum, 2, 2018. 10.22331/​q-2018-03-14-57.

[11] E. Wolfe, R. W. Spekkens, and T. Fritz. The Inflation Technique for Causal Inference with Latent Variables. Journal of Causal Inference, 2016. 10.1515/​jci-2017-0020.

[12] B. S. Tsirelson. Quantum generalizations of Bell’s inequality. Letters in Mathematical Physics, 4 (2): 93–100, 1980. ISSN 1573-0530. 10.1007/​BF00417500.

[13] T. Van Himbeeck, J. Bohr Brask, S. Pironio, R. Ramanathan, A. B. Sainz, and E. Wolfe. Quantum violations in the Instrumental scenario and their relations to the Bell scenario. Quantum, 3: 186, 2019. ISSN 2521-327X. 10.22331/​q-2019-09-16-186.

[14] J. Henson, R. Lal, and M. F. Pusey. Theory-independent limits on correlations from generalized Bayesian networks. New Journal of Physics, 16 (11): 113043, 2014. ISSN 1367-2630. 10.1088/​1367-2630/​16/​11/​113043.

[15] R. Chaves and C. Budroni. Entropic nonsignaling correlations. Physical Review Letters, 116 (24): 240501, 2016. ISSN 0031-9007. 10.1103/​PhysRevLett.116.240501.

[16] A. J. Short and J. Barrett. Strong nonlocality: a trade-off between states and measurements. New Journal of Physics, 12 (3): 033034, 2010. ISSN 1367-2630. 10.1088/​1367-2630/​12/​3/​033034.

[17] H. Barnum, J. Barrett, L. O. Clark, M. Leifer, R. Spekkens, N. Stepanik, A. Wilce, and R. Wilke. Entropy and information causality in general probabilistic theories. New Journal of Physics, 12 (3): 033024, 2010. ISSN 1367-2630. 10.1088/​1367-2630/​12/​3/​033024.

[18] S. L. Braunstein and C. M. Caves. Information-theoretic Bell inequalities. Physical Review Letters, 61 (6): 662–665, 1988. ISSN 0031-9007. 10.1103/​PhysRevLett.61.662.

[19] B. Steudel and N. Ay. Information-theoretic inference of common ancestors. Entropy, 17 (4): 2304–2327, 2015. ISSN 1099-4300. 10.3390/​e17042304.

[20] R. Chaves and T. Fritz. Entropic approach to local realism and noncontextuality. Physical Review A, 85 (3): 032113, 2012. ISSN 1050-2947. 10.1103/​PhysRevA.85.032113.

[21] J. Pienaar. Which causal structures might support a quantum–classical gap? New Journal of Physics, 19 (4): 043021, 2017. 10.1088/​1367-2630/​aa673e.

[22] M. Weilenmann and R. Colbeck. Analysing causal structures with entropy. Proceedings of the Royal Society A, 473 (2207), 2017. 10.1098/​rspa.2017.0483.

[23] A. J. Short and S. Wehner. Entropy in general physical theories. New Journal of Physics, 12 (3): 033023, 2010. ISSN 1367-2630. 10.1088/​1367-2630/​12/​3/​033023.

[24] Z. Zhang and R. W. Yeung. A non-Shannon-type conditional inequality of information quantities. IEEE Transactions on Information Theory, 43 (6): 1982–1986, 1997. ISSN 00189448. 10.1109/​18.641561.

[25] J. Barrett. Information processing in generalized probabilistic theories. Physical Review A, 75 (3): 032304, 2007. ISSN 1050-2947. 10.1103/​PhysRevA.75.032304.

[26] H. P. Williams. Fourier’s method of linear programming and its dual. The American Mathematical Monthly, 93 (9): 681–695, 1986. 10.2307/​2322281.

[27] D. Monniaux. Quantifier elimination by lazy model enumeration. In International Conference on Computer Aided Verification, pages 585–599. Springer, 2010. 10.1007/​978-3-642-14295-6_51.

[28] J. Cadney and N. Linden. Measurement entropy in generalized nonsignalling theory cannot detect bipartite nonlocality. Physical Review A, 86 (5): 052103, 2012. ISSN 1050-2947. 10.1103/​PhysRevA.86.052103.

[29] M. Weilenmann and R. Colbeck. Inability of the entropy vector method to certify nonclassicality in linelike causal structures. Physical Review A, 94: 042112, 2016. 10.1103/​PhysRevA.94.042112.

[30] N. Pippenger. The inequalities of quantum information theory. IEEE Transactions on Information Theory, 49 (4): 773–789, 2003. 10.1109/​TIT.2003.809569.

[31] J. Pearl. On the testability of causal models with latent and instrumental variables. In Proceedings of the Eleventh conference on Uncertainty in artificial intelligence, pages 435–443. Morgan Kaufmann Publishers Inc., 1995. 10.5555/​2074158.2074208.

[32] R. Chaves, G. Carvacho, I. Agresti, V. Di Giulio, L. Aolita, S. Giacomini, and F. Sciarrino. Quantum violation of an instrumental test. Nature Physics, 14 (3): 291, 2018. 10.1038/​s41567-017-0008-5.

[33] R. Chaves, L. Luft, T. Maciel, D. Gross, D. Janzing, and B. Schölkopf. Inferring latent structures via information inequalities. In Proceedings of the 30th Conference on Uncertainty in Artificial Intelligence, pages 112–121, Corvallis, Oregon, 2014. AUAI Press. 10.5555/​3020751.3020764.

[34] M. Weilenmann. Quantum causal structure and quantum thermodynamics. PhD thesis, University of York, 2017. Also available as arXiv:1807.06345.

[35] M. Navascues and E. Wolfe. The inflation technique solves completely the classical inference problem. e-print arXiv:1707.06476, 2017.

[36] C. Branciard, N. Gisin, and S. Pironio. Characterizing the nonlocal correlations created via entanglement swapping. Physical Review Letters, 104 (17): 170401, 2010. ISSN 1079-7114. 10.1103/​PhysRevLett.104.170401.

[37] C. Branciard, D. Rosset, N. Gisin, and S. Pironio. Bilocal versus nonbilocal correlations in entanglement-swapping experiments. Physical Review A, 85 (3): 032119, 2012. ISSN 1050-2947. 10.1103/​PhysRevA.85.032119.

[38] C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Physical Review Letters, 70 (13): 1895–1899, 1993. ISSN 0031-9007. 10.1103/​PhysRevLett.70.1895.

[39] H.-J. Briegel, W. Dür, J. I. Cirac, and P. Zoller. Quantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication. Physical Review Letters, 81 (26): 5932–5935, 1998. ISSN 0031-9007. 10.1103/​PhysRevLett.81.5932.

[40] M. Zukowski, A. Zeilinger, M. A. Horne, and A. Ekert. “Event-ready-detectors” Bell experiment via entanglement swapping. Physical Review Letters, 71 (26): 4287–4290, 1993. ISSN 1079-7114. 10.1103/​PhysRevLett.71.4287.

[41] N. Gisin. The elegant joint quantum measurement and some conjectures about N-locality in the triangle and other configurations. e-print arXiv:1708.05556, 2017.

[42] R. Chaves. Entropic inequalities as a necessary and sufficient condition to noncontextuality and locality. Physical Review A, 87 (2): 022102, 2013. ISSN 1050-2947. 10.1103/​PhysRevA.87.022102.

[43] V. Vilasini and R. Colbeck. On the sufficiency of entropic inequalities for detecting non-classicality in the Bell causal structure. e-print arXiv:1912.01031, 2019.

[44] O. Klein. Zur quantenmechanischen Begründung des zweiten Hauptsatzes der Wärmelehre. Zeitschrift für Physik, 72 (11): 767–775, 1931. ISSN 0044-3328. 10.1007/​BF01341997.

Cited by

[1] V. Vilasini and Roger Colbeck, “Analyzing causal structures using Tsallis entropies”, Physical Review A 100 6, 062108 (2019).

The above citations are from SAO/NASA ADS (last updated successfully 2020-02-27 12:15:38). The list may be incomplete as not all publishers provide suitable and complete citation data.

Could not fetch Crossref cited-by data during last attempt 2020-02-27 12:15:36: Could not fetch cited-by data for 10.22331/q-2020-02-27-236 from Crossref. This is normal if the DOI was registered recently.


Continue Reading
Cyber Security9 mins ago

6 Truths About Disinformation Campaigns

Blockchain40 mins ago

Bitfinex Completes Another $100M Loan Facility Repayment to Tether

Ai1 hour ago

Stair-climbing robot snake is almost as agile as the IRL version

Cyber Security2 hours ago

USA Freedom Act reauthorizations in doubt after Paul says Trump supports FISA reform

Ai2 hours ago

Tempo reveals $17M-funded $2000 weight lift training screen

Blockchain2 hours ago

Blockchain Firm AVA Labs Acquires Private Investments Platform Investery

Blockchain2 hours ago

Hackers send cryptocurrency exchange offline with DDoS attacks

Fintech2 hours ago

Europes Target Global raises new 120M early-stage fund

Blockchain2 hours ago

Cash App’s Bitcoin Income Rises, Retails Continues to Drive Growth

Blockchain2 hours ago

Microsoft Updates Edge Browser to Protect Against Illicit Crypto Miners

Blockchain2 hours ago

Grammy-Nominated Artist Akon to Launch Cryptocurrency on Stellar

Ai3 hours ago

This cute tentacle robot will make you feel like a tiny Cthulhu

VC3 hours ago

Funding Friday: Rocketbook Orbit

Blockchain3 hours ago

‘Transition to multi-polar currency world likely’

Blockchain3 hours ago

Why Banks Aren’t Banking Your Crypto Startup

Cyber Security3 hours ago

SC Media RSA 2020 Video roundup

Automotive3 hours ago

Cancelled: Geneva Motor Show 2020 – Here's the electric and plug-in hybrid cars…

Blockchain3 hours ago

Bitstamp adds full support for SegWit bitcoin addresses

Cyber Security3 hours ago

Is the CISO a second-class executive?

Artificial Intelligence4 hours ago

Why are the NBA and Walmart using Clearview AI?

Blockchain2 days ago

Privacy Study: Brave Browser Smacks Down Chrome, Firefox & Safari

Blockchain2 days ago

Presumed Guilty: Financial Watchdogs See Crypto as Illicit by Default

Automotive2 days ago

Tesla driver was playing iPhone game during crash. Investigators blame Tesla and Apple.

Cyber Security2 days ago

New Wi-Fi Encryption Vulnerability Affects Over A Billion Devices

Blockchain2 days ago

Formula 1 Open Tokenized Crate Sale on Ethereum Blockchain

Cyber Security2 days ago

Commonsense Security: Leveraging Dialogue & Collaboration for Better Decisions

VC2 days ago

10 Tips for Solo Attendees at SaaStr Annual

Blockchain1 day ago

Crypto Payments Provider Partners With Travala Bookings Platform

Quantum2 days ago

Daily Crunch: Disney CEO Bob Iger steps down

Automotive1 day ago

Don’t call the Lucid Air a Tesla killer

Ai2 days ago

Hacker swipes customer list from controversial face-recog-for-Feds Clearview. Its reaction? ‘A part of life’

Blockchain1 day ago

FCoin Working to Resume Operations, Promises to Return Lost Funds

Blockchain1 day ago

Cryptocurrency Adoption: How Can Crypto Change the Travel Industry?

Ai2 days ago

Apple to begin online sales in India this year, open first retail store in 2021

Blockchain2 days ago

Binance’s CZ Overtakes Bitmain Co-Founder in New Hurun Rich List

Ai1 day ago

Elon Musk tweets out #DeleteFacebook, saying its lame

Blockchain2 days ago

Coinbase Wallet Now Allows to Send Crypto Through Usernames

Blockchain1 day ago

Ahead of Bitcoin Halving, Bitmain Announces Upcoming Antiminer S19

Blockchain2 days ago

Operas new browser can tame your tabs

Cyber Security1 day ago

Munson Healthcare data breach exposes PHI