<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:media="http://search.yahoo.com/mrss/">
    <channel>
                    <title>Phys.org news tagged with:computer proof</title>
            <link>https://phys.org/</link>
            <language>en-us</language>
            <description>Phys.org internet news portal provides the latest news on science including: Physics, Nanotechnology, Life Sciences, Space Science, Earth Science, Environment, Health and Medicine.</description>

                            <item>
                    <title>Study proves the difficulty of simulating random quantum circuits for classical computers</title>
                    <description>Quantum computers, technologies that perform computations leveraging quantum mechanical phenomena, could eventually outperform classical computers on many complex computational and optimization problems. While some quantum computers have attained remarkable results on some tasks, their advantage over classical computers is yet to be conclusively and consistently demonstrated.</description>
                    <link>https://phys.org/news/2023-09-difficulty-simulating-random-quantum-circuits.html</link>
                    <category>Quantum Physics</category>                    <pubDate>Wed, 06 Sep 2023 06:30:01 EDT</pubDate>
                    <guid isPermaLink="false">news613124221</guid>
                                            <media:thumbnail url="https://scx1.b-cdn.net/csz/news/tmb/2023/study-proves-the-hardn.jpg" width="90" height="90" />
                                    </item>
                            <item>
                    <title>A peculiar protected structure links Viking knots with quantum vortices</title>
                    <description>Scientists have shown how three vortices can be linked in a way that prevents them from being dismantled. The structure of the links resembles a pattern used by Vikings and other ancient cultures, although this study focused on vortices in a special form of matter known as a Bose-Einstein condensate. The findings have implications for quantum computing, particle physics and other fields.</description>
                    <link>https://phys.org/news/2022-12-peculiar-links-viking-quantum-vortices.html</link>
                    <category>Soft Matter</category>                    <pubDate>Mon, 12 Dec 2022 08:55:03 EST</pubDate>
                    <guid isPermaLink="false">news590057702</guid>
                                            <media:thumbnail url="https://scx1.b-cdn.net/csz/news/tmb/2022/a-peculiar-protected-s.jpg" width="90" height="90" />
                                    </item>
                            <item>
                    <title>Space-borne quantum source to secure communication</title>
                    <description>Soon, powerful quantum computers will be able to easily crack conventional mathematically encrypted codes. Entangled photons generated by a spaceborne quantum source could enable hack-proof key exchange for ultra high security applications. A Fraunhofer research team has developed a high performance quantum source robust enough for deployment in space. They aim to launch the first European quantum satellite in some four years&#039; time.</description>
                    <link>https://phys.org/news/2018-10-space-borne-quantum-source.html</link>
                    <category>Optics &amp; Photonics</category>                    <pubDate>Mon, 01 Oct 2018 08:38:31 EDT</pubDate>
                    <guid isPermaLink="false">news457601907</guid>
                                            <media:thumbnail url="https://scx1.b-cdn.net/csz/news/tmb/2018/spacebornequ.jpg" width="90" height="90" />
                                    </item>
                            <item>
                    <title>Spliddit helps divide bills, credit, material items fairly</title>
                    <description>Dividing bills, credit and material items between two people is a fairly simple and straightforward task.</description>
                    <link>https://phys.org/news/2014-11-spliddit-bills-credit-material-items.html</link>
                    <category>Software</category>                    <pubDate>Tue, 25 Nov 2014 14:50:01 EST</pubDate>
                    <guid isPermaLink="false">news336146945</guid>
                                    </item>
                            <item>
                    <title>Computer generated math proof is too large for humans to check</title>
                    <description>(Phys.org) —A pair of mathematicians, Alexei Lisitsa and Boris Konev of the University of Liverpool, U.K., have come up with an interesting problem—if a computer produces a proof of a math problem that is too big to study, can it be judged as true anyway? In a paper they&#039;ve uploaded to the preprint server arXiv, the two describe how they set a computer program to proving a small part of what&#039;s known as &quot;Erdős discrepancy problem&quot;—the proof produced a data file that was 13-gigabytes in size—far too large for any human to check, leading to questions as to whether the proof can be taken as a real proof.</description>
                    <link>https://phys.org/news/2014-02-math-proof-large-humans.html</link>
                    <category>Mathematics</category>                    <pubDate>Wed, 19 Feb 2014 11:00:02 EST</pubDate>
                    <guid isPermaLink="false">news312027154</guid>
                                            <media:thumbnail url="https://scx1.b-cdn.net/csz/news/tmb/2014/hbjnmkl.jpg" width="90" height="90" />
                                    </item>
                            <item>
                    <title>&#039;Zero knowledge&#039; may answer computer security question</title>
                    <description>(Phys.org) —In the age of the Internet, it&#039;s getting harder and harder to keep secrets. When you type in your password, there&#039;s no telling who might be watching it go by. New research at Cornell may offer a pathway to more secure communications.</description>
                    <link>https://phys.org/news/2013-08-knowledge.html</link>
                    <category>Computer Sciences</category>                    <pubDate>Thu, 29 Aug 2013 06:48:13 EDT</pubDate>
                    <guid isPermaLink="false">news296977668</guid>
                                    </item>
                            <item>
                    <title>For honest voting, write a message the &#039;man in the middle&#039; can&#039;t intercept</title>
                    <description>(Phys.org)—In the run-up to the last election warnings about computer hacking were rampant. Experts demonstrated how the hardware in voting machines could be modified. Touch-screen machines visibly changed votes. One possibility that wasn&#039;t mentioned was the &quot;man in the middle&quot; who might change totals as they are sent in.</description>
                    <link>https://phys.org/news/2012-12-honest-voting-message-middle-intercept.html</link>
                    <category>Computer Sciences</category>                    <pubDate>Tue, 11 Dec 2012 09:07:03 EST</pubDate>
                    <guid isPermaLink="false">news274439213</guid>
                                    </item>
                            <item>
                    <title>10-year-old problem in theoretical computer science falls</title>
                    <description>(Phys.org) -- Interactive proofs, which MIT researchers helped pioneer, have emerged as one of the major research topics in theoretical computer science. In the classic interactive proof, a questioner with limited computational power tries to extract reliable information from a computationally powerful but unreliable respondent. Interactive proofs are the basis of cryptographic systems now in wide use, but for computer scientists, they&amp;#146;re just as important for the insight they provide into the complexity of computational problems.</description>
                    <link>https://phys.org/news/2012-07-year-old-problem-theoretical-science-falls.html</link>
                    <category>Computer Sciences</category>                    <pubDate>Mon, 30 Jul 2012 10:39:45 EDT</pubDate>
                    <guid isPermaLink="false">news262863567</guid>
                                            <media:thumbnail url="https://scx1.b-cdn.net/csz/news/tmb/2012/10yearoldpro.jpg" width="90" height="90" />
                                    </item>
                            <item>
                    <title>Why rumors spread fast in social networks</title>
                    <description>Information spreads fast in social networks. This could be observed during recent events. Now computer scientists from the German Saarland University provide the mathematical proof for this and come up with a surprising explanation.</description>
                    <link>https://phys.org/news/2012-05-rumors-fast-social-networks.html</link>
                    <category>Mathematics</category>                    <pubDate>Mon, 21 May 2012 10:21:27 EDT</pubDate>
                    <guid isPermaLink="false">news256814416</guid>
                                    </item>
                        </channel>
</rss>