Search arXiv⌕ Search

arXiv · 0710.1086

Comment on "Nonexponential Decay Via Tunneling in Tight-Binding Lattices and the Optical Zeno Effect"

Abstract

S. Longhi [1] studied the survival probability P(t) of an unstable state coupled to a tight-binding lattice finding an exact analytical solution that describes the nonexponential decay. When the first coupling is smaller than the others, he shows that P(t) has a natural decomposition into two terms; one is the exponential decay, consistent with the Gamow's approach, and the other is the correction to this decay. The first purpose of this Comment is to show that the condition imposed on the system; the site energy of the first site is set in the center of the band, limits the generality of the results. A decomposition based on the spectral properties of the system removes this restriction [2]. Other point of this Comment is that, for the weak coupling limit, the author stated that a Zeno effect occurs for t less than t*, where t* is the smallest root of the equation g_eff(t*)=g_0, and for the strong coupling limit an anti-Zeno effect occurs for t close to t**, where t** is the first peak of g_eff. By using a spectral formulation we show that, the anti-Zeno effect not only requires a strong coupling limit, also is necessary to choose the resonance energy and width such that a destructive interference can occur. We present this interference and give an analytical expression and physically interpretation for t* and t**.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

E. Rufeil Fiori, H. M. Pastawski. 2007-10-08. Comment on "Nonexponential Decay Via Tunneling in Tight-Binding Lattices and the Optical Zeno Effect". https://arxiv.org/abs/0710.1086

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

KEEP EXPLORING

Related papers

Qubit-efficient embedding of parity-encoded Hamiltonians in quantum annealers

The Sourlas-Lechner-Hauke-Zoller (SLHZ) scheme for quantum annealing uses the parity to encode logical variables and has several advantages, but it has not been implemented for large-scale quantum annealers. If the SLHZ-based approach can be implemented on currently available quantum annealers, we can evaluate its performance. An efficient method to embed the parity-encoded model into the hardware graphs of available quantum annealers is one of the key elements for this approach. We propose a qubit-efficient embedding scheme for parity-encoded Hamiltonians on quantum annealers with the Zephyr connectivity. We give an explicit constructive embedding of the interaction graph of an intermediate Hamiltonian, which contains only one- and two-body interactions, into the Zephyr graph. Our embedding maps each spin to a two-qubit chain using systematic chain-assignment rules. Its validity is verified via the resulting chain-to-chain connectivity. Our embedding also provides practical flexibility. Chains assigned to ancillary spins allow reduction to a single physical qubit, leading to options to avoid inactive qubits. The number of required qubits per spin in the parity Hamiltonian is three, which is fewer than that for a known embedding scheme for the Pegasus graph.

quant-ph↗

Optically detected nuclear magnetic resonance of carbon-13 in bulk diamond

Precision measurements based on optically detected nuclear magnetic resonance offer exquisite sensitivity to absolute shifts in spin transition frequencies, with potential applications in fundamental physics experiments and inertial sensing. We investigate 13C nuclear spins in diamond as a candidate system for solid-state implementations, which hold the promise for high-fidelity readout of large numbers of coherent nuclear spins in millitesla or lower magnetic fields. We demonstrate a technique that allows for both optical polarization and readout of large ensembles of ~10^{16} polarized nuclear spins. Our method takes advantage of state-selective Landau-Zener transitions under microwave frequency sweeping, which bidirectionally transfer spin polarization between Nitrogen-Vacancy (NV) electron spins and remote 13C nuclear spins. Using natural isotopic abundance diamonds with nitrogen densities of ~0.5-10 ppm, we perform optically-detected 13C Ramsey spectroscopy and realize a nuclear-spin-dependent fluorescence contrast exceeding 0.5% peak-to-peak. We observe nuclear spin dephasing times T2*~2 ms that only modestly improve with homonuclear dipolar decoupling, indicating that they are limited by the longitudinal spin relaxation of nearby NV electron spins. We study the magnetic field dependence of the optical readout and find comparable contrast and dephasing times for magnetic fields in the range 8-20 mT. Our method can be interpreted as a type of repetitive readout, where each NV center optically reads out the spin state of ~10^2 nuclei before nuclear spins depolarize.

quant-ph↗

IRIS: A Compiler for Distributed Quantum Systems

Distributed Quantum Computers (DQCs) enable large system sizes by connecting smaller chips via photonic interconnects. DQCs use teleportation to relocate qubits and execute CNOTs between qubits on different chips. But, non-local CNOTs are 4.3-7.7$\times$ slower and 4$\times$ more error-prone than local CNOTs within a chip, which degrades program fidelities. Compilers group CNOTs with overlapping qubits into blocks and collectively optimize teleportations for each block. However, block-level scheduling suffers from two key drawbacks. First, they lack lookahead ability between blocks because they select the best schedule for a block before proceeding. So, they cannot assess the impact of a teleportation on future blocks. Our studies show that naively expanding the lookahead window to include subsequent blocks does not address the issue. Second, they do not schedule future block operations or teleportations they need unless preceding blocks are fully scheduled, introducing delay and latency overheads. We propose IRIS, a DQC compiler that addresses these limitations using two key insights: Utility-driven Lookahead With Multi-Candidate Block Scheduling (UMS) and EPR-Capacity-Aware Early Scheduling (EES). UMS schedules a block by considering only useful future blocks in its lookahead window. A future block has utility if it shares overlapping qubits with the current block being scheduled. UMS also maintains multiple schedules during compilation, allowing it to defer commitment to globally sub-optimal schedules early. EES enables IRIS to schedule future operations and their relocations early if EPR resources are available for teleportations. Our evaluations show that IRIS reduces teleportations by 34% on average and by up to 65%; and latency by 2$\times$ on average and by up to 2.9$\times$ compared to the state-of-the-art DQC compiler.

quant-ph↗