arXiv subjects

S. Debnath

Publications and source records attributed to S. Debnath.

12 recordsLinked to original sources

arXiv2022

Horizons: Nuclear Astrophysics in the 2020s and Beyond

Nuclear Astrophysics is a field at the intersection of nuclear physics and astrophysics, which seeks to understand the nuclear engines of astronomical objects and the origin of the chemical elements. This white paper summarizes progress and status of the field, the new open questions that have emerged, and the tremendous scientific opportunities that have opened up with major advances in capabilities across an ever growing number of disciplines and subfields that need to be integrated. We take a holistic view of the field discussing the unique challenges and opportunities in nuclear astrophysics in regards to science, diversity, education, and the interdisciplinarity and breadth of the field. Clearly nuclear astrophysics is a dynamic field with a bright future that is entering a new era of discovery opportunities.

nucl-ex↗

arXiv2019

Benchmarking an 11-qubit quantum computer

The field of quantum computing has grown from concept to demonstration devices over the past 20 years. Universal quantum computing offers efficiency in approaching problems of scientific and commercial interest, such as factoring large numbers, searching databases, simulating intractable models from quantum physics, and optimizing complex cost functions. Here, we present an 11-qubit fully-connected, programmable quantum computer in a trapped ion system composed of 13 $^{171}$Yb$^{+}$ ions. We demonstrate average single-qubit gate fidelities of 99.5$\%$, average two-qubit-gate fidelities of 97.5$\%$, and state preparation and measurement errors of 0.7$\%$. To illustrate the capabilities of this universal platform and provide a basis for comparison with similarly-sized devices, we compile the Bernstein-Vazirani (BV) and Hidden Shift (HS) algorithms into our native gates and execute them on the hardware with average success rates of 78$\%$ and 35$\%$, respectively. These algorithms serve as excellent benchmarks for any type of quantum hardware, and show that our system outperforms all other currently available hardware.

quant-ph↗

arXiv2017

Observation of Hopping and Blockade of Bosons in a Trapped Ion Spin Chain

The local phonon modes in a Coulomb crystal of trapped ions can represent a Hubbard system of coupled bosons. We selectively prepare single excitations at each site and observe free hopping of a boson between sites, mediated by the long-range Coulomb interaction between ions. We then implement phonon blockades on targeted sites by driving a Jaynes-Cummings interaction on individually addressed ions to couple their internal spin to the local phonon mode. The resulting dressed states have energy splittings that can be tuned to suppress phonon hopping into the site. This new experimental approach opens up the possibility of realizing large-scale Hubbard systems from the bottom up with tunable interactions at the single-site level.

quant-ph↗

arXiv2017

Fault-tolerant quantum error detection

Quantum computers will eventually reach a size at which quantum error correction becomes imperative. Quantum information can be protected from qubit imperfections and flawed control operations by encoding a single logical qubit in multiple physical qubits. This redundancy allows the extraction of error syndromes and the subsequent detection or correction of errors without destroying the logical state itself through direct measurement. Here we show the encoding and syndrome measurement of a fault-tolerant logical qubit via an error detection protocol on four physical qubits, represented by trapped atomic ions. This demonstrates for the first time the robustness of a fault-tolerant qubit to imperfections in the very operations used to encode it. The advantage persists in the face of large added error rates and experimental calibration errors.

quant-ph↗

arXiv2017

Complete 3-Qubit Grover Search on a Programmable Quantum Computer

Searching large databases is an important problem with broad applications. The Grover search algorithm provides a powerful method for quantum computers to perform searches with a quadratic speedup in the number of required database queries over classical computers. It is an optimal search algorithm for a quantum computer, and has further applications as a subroutine for other quantum algorithms. Searches with two qubits have been demonstrated on a variety of platforms and proposed for others, but larger search spaces have only been demonstrated on a non-scalable NMR system. Here, we report results for a complete three-qubit Grover search algorithm using the scalable quantum computing technology of trapped atomic ions, with better-than-classical performance. The algorithm is performed for all 8 possible single-result oracles and all 28 possible two-result oracles. Two methods of state marking are used for the oracles: a phase-flip method employed by other experimental demonstrations, and a Boolean method requiring an ancilla qubit that is directly equivalent to the state-marking scheme required to perform a classical search. All quantum solutions are shown to outperform their classical counterparts. We also report the first implementation of a Toffoli-4 gate, which is used along with Toffoli-3 gates to construct the algorithms; these gates have process fidelities of 70.5% and 89.6%, respectively.

quant-ph↗

arXiv2017

Experimental Comparison of Two Quantum Computing Architectures

We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device with limited connectivity, and the other is a fully connected trapped-ion system. Even though the two systems have different native quantum interactions, both can be programmed in a way that is blind to the underlying hardware, thus allowing the first comparison of identical quantum algorithms between different physical systems. We show that quantum algorithms and circuits that employ more connectivity clearly benefit from a better connected system of qubits. While the quantum systems here are not yet large enough to eclipse classical computers, this experiment exposes critical factors of scaling quantum computers, such as qubit connectivity and gate expressivity. In addition, the results suggest that co-designing particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future.

quant-ph↗

arXiv2016

Demonstration of a small programmable quantum computer with atomic qubits

Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to implement a particular algorithm or execute a limited number of computational paths. Here, we demonstrate a five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates. We compile algorithms into a fully-connected set of gate operations that are native to the hardware and have a mean fidelity of 98 %. Reconfiguring these gate sequences provides the flexibility to implement a variety of algorithms without altering the hardware. As examples, we implement the Deutsch-Jozsa (DJ) and Bernstein-Vazirani (BV) algorithms with average success rates of 95 % and 90 %, respectively. We also perform a coherent quantum Fourier transform (QFT) on five trappedion qubits for phase estimation and period finding with average fidelities of 62 % and 84 %, respectively. This small quantum computer can be scaled to larger numbers of qubits within a single register, and can be further expanded by connecting several such modules through ion shuttling or photonic quantum channels.

quant-ph↗

arXiv2014

Modular Entanglement of Atomic Qubits using both Photons and Phonons

Quantum entanglement is the central resource behind applications in quantum information science, from quantum computers and simulators of complex quantum systems to metrology and secure communication. All of these applications require the quantum control of large networks of quantum bits (qubits) to realize gains and speedups over conventional devices. However, propagating quantum entanglement generally becomes difficult or impossible as the system grows in size, owing to the inevitable decoherence from the complexity of connections between the qubits and increased couplings to the environment. Here, we demonstrate the first step in a modular approach to scaling entanglement by utilizing a hierarchy of quantum buses on a collection of three atomic ion qubits stored in two remote ion trap modules. Entanglement within a module is achieved with deterministic near-field interactions through phonons, and remote entanglement between modules is achieved through a probabilistic interaction through photons. This minimal system allows us to address generic issues in synchronization and scalability of entanglement with multiple buses, while pointing the way toward a modular large-scale quantum computer architecture that promises less spectral crowding and less decoherence. We generate this modular entanglement faster than the observed qubit decoherence rate, thus the system can be scaled to much larger dimensions by adding more modules.

quant-ph↗

arXiv2014

Optimal quantum control of multi-mode couplings between trapped ion qubits for scalable entanglement

We demonstrate high fidelity entangling quantum gates within a chain of five trapped ion qubits by optimally shaping optical fields that couple to multiple collective modes of motion. We individually address qubits with segmented optical pulses to construct multipartite entangled states in a programmable way. This approach enables both high fidelity and fast quantum gates that can be scaled to larger qubit registers for quantum computation and simulation.

quant-ph↗

arXiv2013

Beat note stabilization of mode-locked lasers for quantum information processing

We stabilize a chosen radiofrequency beat note between two optical fields derived from the same mode-locked laser pulse train, in order to coherently manipulate quantum information. This scheme does not require access or active stabilization of the laser repetition rate. We implement and characterize this external lock, in the context of two-photon stimulated Raman transitions between the hyperfine ground states of trapped 171-Yb+ quantum bits.

quant-ph↗

arXiv2012

Coherent Error Suppression in Multi-Qubit Entangling Gates

We demonstrate a simple pulse shaping technique designed to improve the fidelity of spin-dependent force operations commonly used to implement entangling gates in trapped-ion systems. This extension of the Mølmer-Sørensen gate can theoretically suppress the effects of certain frequency and timing errors to any desired order and is demonstrated through Walsh modulation of a two-qubit entangling gate on trapped atomic ions. The technique is applicable to any system of qubits coupled through collective harmonic oscillator modes.

quant-ph↗

arXiv2009

Tripartite entanglement versus tripartite nonlocality in 3-qubit GHZ-class states

We analyze the relationship between tripartite entanglement and genuine tripartite nonlocality for 3-qubit pure states in the GHZ class. We consider a family of states known as the generalized GHZ states and derive an analytical expression relating the 3-tangle, which quantifies tripartite entanglement, to the Svetlichny inequality, which is a Bell-type inequality that is violated only when all three qubits are nonlocally correlated. We show that states with 3-tangle less than 1/2 do not violate the Svetlichny inequality. On the other hand, a set of states known as the maximal slice states do violate the Svetlichny inequality, and exactly analogous to the two-qubit case, the amount of violation is directly related to the degree of tripartite entanglement. We discuss further interesting properties of the generalized GHZ and maximal slice states.

quant-ph↗