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 ...
(Phys.org)—How do you arrange a group of points on the surface of a sphere so that all the points are as far apart from each other as possible? With two points, the answer is easy: place them on opposite sides of the sphere, ...
(Phys.org) —UCLA computer science professor Amit Sahai and a team of researchers have designed a system to encrypt software so that it only allows someone to use a program as intended while preventing any deciphering of ...
Computer Sciences
Jul 29, 2013
22
0
(Phys.org) —The American Nobel Prize Laureate for Physics Richard Feynman once described turbulence as "the most important unsolved problem of classical physics", because a description of the phenomenon from first principles ...
General Physics
Apr 3, 2013
1
0
(Phys.org) —What is the shortest route that a traveling salesman must take to visit a number of specified cities in a tour, stopping at each city once and only once before returning to the starting point? The most accurate ...
(PhysOrg.com) -- In the basement of Hoyt Laboratory at Princeton University, Alexei Tyryshkin clicked a computer mouse and sent a burst of microwaves washing across a silicon crystal suspended in a frozen cylinder of stainless ...
General Physics
Jan 12, 2012
1
0
(PhysOrg.com) -- Bumblebees can find the solution to a complex mathematical problem which keeps computers busy for days.
Plants & Animals
Oct 25, 2010
23
0
One of the most complex mathematical problems in the world is proving either that P ≠ NP or P=NP, a riddle that was first formulated in 1971 by mathematicians Leonid Levin and Stephen Cook. The question was one of seven ...
A researcher from the University of Bath has found a new approach to an old geometric problem of modelling the most efficient way of packing shapes to form a foam.
Mathematics
Sep 2, 2009
0
0
The traveling salesman problem is considered a prime example of a combinatorial optimization problem. Now a Berlin team led by theoretical physicist Prof. Dr. Jens Eisert of Freie Universität Berlin and HZB has shown that ...
Quantum Physics
Mar 18, 2024
1
232
