Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Science News

Quantum cocoon: Diamonds are a physicist's—and perhaps quantum computing's—best friend

Davide Castelvecchi

Published Apr 5, 2008• 1 citation
Publisher
DOI
10.1002/scin.2008.5591731410

Related papers

Glowing diamonds are a quantum scientist’s best friend

Lachlan J. Rogers

Futurum Careers•Jan 1, 2021•0 citations

On QBism and Assumption (Q)

Blake C. Stacey

I correct two misapprehensions, one historical and one conceptual, in the recent literature on extensions of the Wigner's Friend thought-experiment. Perhaps fittingly, both concern the accurate description of some quantum physicists' beliefs by others.

arXiv:1907.03805•Jul 8, 2019•8 citations

Video: The quantum world of diamonds

Nature•Mar 24, 2021•0 citations

Diamond — A quantum engineer's best friend

Marko Lončar

Diamond possesses remarkable physical and chemical properties, and in many ways is the ultimate engineering material. For example, it is transparent from the ultra-violet to infrared, has a high refractive index (n = 2.4), strong optical nonlinearity (Kerr and Raman) and a wide variety of light-emitting defects. These properties make diamond a highly desirable material for many applications, including those in quantum and nonlinear photonics, high power optics and optomechanics.

Technical digest - International Electron Devices Meeting/Technical digest•Dec 1, 2016•1 citation

Diamond NV centers for quantum computing and quantum networks

Lilian Childress, Ronald Hanson

MRS Bulletin•Feb 1, 2013•550 citations

Quantum

Lance Fortnow

This chapter examines the power of quantum computing, as well as the related concepts of quantum cryptography and teleportation. In 1982, the Nobel prize-winning physicist Richard Feynman noticed there was no simple way of simulating quantum physical systems using digital computers. He turned this problem into an opportunity—perhaps a computational device based on quantum mechanics could solve problems more efficiently than more traditional computers. In the decades that followed, computer scientists and physicists, often working together, showed in theory that quantum computers can solve certain problems, such as factoring numbers, much faster. Whether one can actually build large or even medium-scale working quantum computers and determine exactly what these computers can or cannot do still remain significant challenges.

Princeton University Press eBooks•Feb 28, 2017•0 citations
This chapter examines the power of quantum computing, as well as the related concepts of quantum cryptography and teleportation. In 1982, the Nobel prize-winning physicist Richard Feynman noticed there was no simple way of simulating quantum physical systems using digital computers. He turned this problem into an opportunity—perhaps a computational device based on quantum mechanics could solve problems more efficiently than more traditional computers. In the decades that followed, computer scientists and physicists, often working together, showed in theory that quantum computers can solve certain problems, such as factoring numbers, much faster. Whether one can actually build large or even medium-scale working quantum computers and determine exactly what these computers can or cannot do still remain significant challenges.