Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Achieving Higher Photon Counting Rates Using Multiplexed Detectors

Published

Author(s)

Stefania Castelletto, Ivo P. Degiovanni, Alan L. Migdall, Sergey Polyakov, V Schettini

Abstract

As the quantum information field advances, the need for improved single-photon devices is becoming more critical. Quantum information systems are often limited by detector deadtime to count rates of a few MHz, at best. We present a multiplexed detection scheme that allows photon counting at higher rates than possible with single detectors. The system uses an array of detectors and an optical switch system to direct incoming photons to detectors known to be live. We model the system for realistic individual detector deadtimes and optical switching times. We show that such a system offers more promise than simply reducing the deadtime of an individual detector. We find that a system of N detectors with a given deadtime, can count photons at faster rates than a single detector with a deadtime reduced by 1/N, even if it were practical to make such a large improvement.
Proceedings Title
SPIE Optics and Photonics Conference | 2006| Proc. SPIE 6305
Volume
6305
Conference Dates
August 14-15, 2006
Conference Location
San Diego, CA, US
Conference Title
SPIE Optics and Photonics Conference

Keywords

deadtime, detector, photon counting, quantum computing, quantum cryptography, single photon

Citation

Castelletto, S. , Degiovanni, I. , Migdall, A. , Polyakov, S. and Schettini, V. (2006), Achieving Higher Photon Counting Rates Using Multiplexed Detectors, SPIE Optics and Photonics Conference | 2006| Proc. SPIE 6305, San Diego, CA, US, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=841037 (Accessed April 20, 2024)
Created August 12, 2006, Updated October 12, 2021