- Lens Turns Smartphone Into Microscope
- Sixth DNA Base Discovered?
- Performance Enhancing Drugs Decrease Performance
- Robot Takes a Brisk Walk Outside
- Electronic Sheets Only 3 Atoms Thick
- Black Holes Gorging at Excessive Rates
- Jupiter's Moon Io: Lava Lake Loki Up Close
- Inanimate Beads Behave in Lifelike Ways
- Dementia On the Way to Mars? Cosmic Rays
- Decline of Large Herbivores: Empty Landscape?

Science News

from research organizations

- Date:
- May 26, 2010
- Source:
- Max Planck Institute of Quantum Optics
- Summary:
- The Internet, networks of connections between Hollywood actors, etc., are examples of complex networks, whose properties have been intensively studied in recent times. The 'small-world' property (that everyone has a few-step connection to celebrities), for instance, is a famous example. Scientists have now introduced complex networks in the quantum realm.
- Share:

FULL STORY

The Internet, networks of connections between Hollywood actors, etc., are examples of complex networks, whose properties have been intensively studied in recent times. The 'small-world' property (that everyone has a few-step connection to celebrities), for instance, is a famous example.

A group of scientists led by Prof. J.I. Cirac, Director at the Max Planck Institute of Quantum Optics (Garching near Munich) and Leader of the Theory Division, has now introduced complex networks in the quantum realm. In a study appearing in the journal *Nature Physics*, the scientists show that these quantum complex networks have surprising properties: even in a very weakly connected quantum network, performing some measurements and other simple quantum operations allows the generation of arbitrary graphs of connections that are otherwise impossible in their classical counterparts.

The behaviour of networks has been widely explored in the context of classical statistical mechanics. Periodic networks, by definition, have a regular structure, in which each node is connected to a constant number of 'geometrical' neighbours. If one tries to enlarge these systems, their topology is not altered since the unit cell is just repeated *ad aeternum*. The construction of a random network is completely different: each node has a small probability of being connected to any other node. Depending on the connection probability and in the limit of infinite size, such networks exhibit some typical effects. For instance, if this probability is high enough, nearly all nodes will be part of one giant cluster; if it is too small only sparse groups of connected nodes will be present.

In a quantum network one link between neighbouring nodes is given by one pair of entangled qubits, for example atoms; in other words, one link in a quantum network represents the entanglement between two qubits. Therefore, a node possesses exactly one qubit for each neighbour, and since it can act on these qubits it is called a 'station'. This holds for any kind of quantum networks. However, there are different ways of defining the entanglement between neighbouring qubits. Until now, quantum networks have been mostly modelled as periodically structured graphs, that is, lattices. In the work described here the scientists set the amount of entanglement between two nodes to be equal to the connection probability of the classical random graphs.

In the classical case, some specific subgraphs appear suddenly if one lets the connection probability scale with the size of the network: for very low probabilities only trivial connections (simple links) are present in the network, whereas for higher probabilities the subgraphs become more and more complex (e.g., triangles, squares, or stars). In quantum networks, on the other hand, a qualitatively different behaviour emerges: even for the lowest non-trivial connection probability, i.e., if the entanglement between the nodes is, at first sight, just sufficient to get simple connections, it is in fact possible to generate communication subgraphs of any complexity. This result mainly relies on the superposition principle and on the ability to coherently manipulate the qubits at the stations.

"In our article we want to point out that networks with a disordered structure and not periodic lattices have to be studied in the context of quantum communication," says Sébastien Perseguers, who has worked on this topic in the frame of his doctoral thesis. "In fact, it is well known that real-world communication networks have a complex topology, and we may predict that this will also be the case for quantum networks. Furthermore, we want to emphasize the fact that the best results are obtained if one 'thinks quantumly' not only at the connection scale, but also from a global network perspective. In this respect, it is essential to deepen our knowledge of multipartite entanglement, that is, entanglement shared between more than two particles." In the future the scientists are going to extend their model to networks of a richer structure, the so-called complex networks which describe a wide variety of systems in nature and society, and they expect to find many new and unexpected phenomena.

**Story Source:**

The above story is based on materials provided by **Max Planck Institute of Quantum Optics**. *Note: Materials may be edited for content and length.*

**Journal Reference**:

- S. Perseguers, M. Lewenstein, A. Acín, J. I. Cirac.
**Quantum random networks**.*Nature Physics*, 2010; DOI: 10.1038/NPHYS1665

**Cite This Page**:

Max Planck Institute of Quantum Optics. "Quantum communication in random networks: Theorists find surprising behaviours in quantum random networks." ScienceDaily. ScienceDaily, 26 May 2010. <www.sciencedaily.com/releases/2010/05/100525090337.htm>.

Max Planck Institute of Quantum Optics. (2010, May 26). Quantum communication in random networks: Theorists find surprising behaviours in quantum random networks. *ScienceDaily*. Retrieved May 4, 2015 from www.sciencedaily.com/releases/2010/05/100525090337.htm

Max Planck Institute of Quantum Optics. "Quantum communication in random networks: Theorists find surprising behaviours in quantum random networks." ScienceDaily. www.sciencedaily.com/releases/2010/05/100525090337.htm (accessed May 4, 2015).

Recommended Content

Computers & Math News

May 4, 2015

Latest Headlines

updated 12:56 pm ET

May 4, 2015 — A new study reveals that innovation in an important technology sector is happening faster than experts had previously thought, creating a backdrop for better economic times ... read more

May 1, 2015 — Most new patents are combinations of existing ideas and pretty much always have been, even as the stream of fundamentally ... read more

Apr. 30, 2015 — A technique to allow people to cast their election vote online -- even if their home computers are suspected of being infected with viruses -- has been developed by researchers. Taking inspiration ... read more

Apr. 30, 2015 — High-resolution imaging of plant cells is important in many plant studies, and the most commonly used method is scanning electron microscopy (SEM). But SEM can have ... read more

Apr. 30, 2015 — Computer scientists are developing a promising technique to speed up the development of fifth generation (5G) wireless ... read more

Apr. 30, 2015 — Microsoft's Kinect games controller has been hacked by researchers to relieve one of the most distressing symptoms of Parkinson's - freezing of gait. Many patients are afflicted by freezing of gait ... read more

Apr. 30, 2015 — Introducing flaws into liquid crystals by inserting microspheres and then controlling them with electrical fields: that, in ... read more

Apr. 29, 2015 — A pair of newly published papers lay out a method for outfitting birds with geolocators or radio transmitters that cuts precious weight from the package, allowing the devices to be used on very small ... read more

Apr. 29, 2015 — Researchers have recently developed a device that can turn any smartphone into a DNA-scanning ... read more

Apr. 29, 2015 — Most people are naturally adept at reading facial expressions -- from smiling and frowning to brow-furrowing and eye-rolling -- to tell what others are feeling. Now ... read more