Searcharxiv⌕ Search

arXiv · quant-ph/0605038

Room temperature coherent control of coupled single spins in solid

Abstract

Coherent coupling between single quantum objects is at the heart of modern quantum physics. When coupling is strong enough to prevail over decoherence, it can be used for the engineering of correlated quantum states. Especially for solid-state systems, control of quantum correlations has attracted widespread attention because of applications in quantum computing. Such coherent coupling has been demonstrated in a variety of systems at low temperature1, 2. Of all quantum systems, spins are potentially the most important, because they offer very long phase memories, sometimes even at room temperature. Although precise control of spins is well established in conventional magnetic resonance3, 4, existing techniques usually do not allow the readout of single spins because of limited sensitivity. In this paper, we explore dipolar magnetic coupling between two single defects in diamond (nitrogen-vacancy and nitrogen) using optical readout of the single nitrogen-vacancy spin states. Long phase memory combined with a defect separation of a few lattice spacings allow us to explore the strong magnetic coupling regime. As the two-defect system was well-isolated from other defects, the long phase memory times of the single spins was not diminished, despite the fact that dipolar interactions are usually seen as undesirable sources of decoherence. A coherent superposition of spin pair quantum states was achieved. The dipolar coupling was used to transfer spin polarisation from a nitrogen-vacancy centre spin to a nitrogen spin, with optical pumping of a nitrogen-vacancy centre leading to efficient initialisation. At the level anticrossing efficient nuclear spin polarisation was achieved. Our results demonstrate an important step towards controlled spin coupling and multi-particle entanglement in the solid state.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

T. Gaebel, M. Domhan, I. Popa, C. Wittmann, P. Neumann, F. Jelezko, J. R. Rabeau, N. Stavrias, A. D. Greentree, S. Prawer, J. Meijer, J. Twamley, P. R. Hemmer, J. Wrachtrup. 2006-05-03. Room temperature coherent control of coupled single spins in solid. https://doi.org/10.1038/nphys318

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A quantum central path algorithm for linear optimization

We propose a novel quantum algorithm for solving linear optimization problems by quantum-mechanical simulation of the central path. While interior point methods follow the central path with an iterative algorithm that works with successive linearizations of the perturbed KKT conditions, we perform a simulation working directly with the nonlinear complementarity equations. Using a two-stage quantum eigenpath traversal schedule, this approach yields an algorithm for solving linear optimization problems involving $m$ constraints and $n$ variables to $\varepsilon$-optimality using $\widetilde{O}\!\left((m+n)^{3/2}\,\varepsilon^{-1}+(m+n)^{1/2}\,\varepsilon^{-3/2}\right)$ queries to an oracle that evaluates a potential function. In the standard gate model (i.e., without access to quantum RAM), our algorithm can obtain $\varepsilon$-precise solutions to LO problems using at most $$\widetilde{O}\!\left(\left[\frac{(m+n)^{3/2}}{\varepsilon} + \frac{(m+n)^{1/2}}{\varepsilon^{3/2}}\right] \cdot \mathrm{nnz}(A)\right)$$ elementary gates, where $\mathrm{nnz}(A)$ is the total number of non-zero elements found in the constraint matrix.

quant-ph↗

Entanglement Scaling of Motzkin Chains under Spiral Hamiltonian-path Embeddings

We investigate how a two-dimensional spatial embedding changes the entanglement observed across geometrically local bipartitions of a one-dimensional quantum spin chain. A $q$-deformed colored Motzkin chain is placed along a spiral-inspired Hamiltonian path that visits $N(L)=Θ(L^2)$ sites of a square-lattice region while retaining a path interaction graph. Straight ambient-space cuts then correspond to unions of $Θ(L)$ disconnected intervals in the chain ordering. We derive the scaling of a height-variation proxy for the leading color-pairing contribution and predict ambient-space entropy scaling proportional to $L^2$, $L$, and $O(1)$ for $q>1$, $q=1$, and $q<1$, respectively. We evaluate this proxy numerically using the matrix-product-state representation and verify its predicted finite-size scaling. The embedded and original Hamiltonians have exactly identical spectra and spectral gaps at fixed chain length. We also describe a sparse tensor-network representation and propose a two-chain junction extension. These results isolate the roles of interaction connectivity, spatial embedding, and subsystem geometry in entanglement scaling.

quant-ph↗

Brace for impact: ECDLP challenges for quantum cryptanalysis

Precise suites of benchmarks are required to assess the progress of early fault-tolerant quantum computers at economically impactful applications such as cryptanalysis. Appropriate challenges exist for factoring but those for elliptic curve cryptography are either too sparse or inadequate for standard applications of Shor's algorithm. We introduce a difficulty-graded suite of elliptic curve discrete logarithm (ECDLP) challenges that use Bitcoin's curve y^2=x^3+7 mod p while incrementally lowering the prime field from 256 down to 6 bits. For each bit-length, we provide the prime, the prime group order, and two deterministic nothing-up-my-sleeve (NUMS) points in compressed SEC1 form. All challenges are generated by a deterministic, reproducible procedure, and no private challenge scalar is chosen in advance. We calibrate classical cost against Pollard's rho records and quantum cost against resource estimation results for Shor's algorithm. We compile Shor's ECDLP circuit to logical counts and map them to physical resources for various parameters of the surface code, the repetition cat code and the LDPC cat codes. Under explicit and testable assumptions on physical error rates, code distances, and non-Clifford supply, our scenarios place the full 256-bit instance within a 2027--2033 window. The challenge ladder thus offers a transparent ruler to track fault-tolerant progress on a cryptanalytic target of immediate relevance, and it motivates proactive migration of digital assets to post-quantum signatures.

quant-ph↗