Results 31 to 40 of about 80,618 (310)
The original PDF and HTML versions of this Article omitted the ORCID ID of the authors L. Magazzù and P. Forn-Díaz. (L. Magazzù: 0000-0002-4377-8387; P. Forn-Diaz: 0000-0003-4365-5157). The original PDF version of this Article contained errors in Eqs. (2)
L. Magazzù +8 more
doaj +1 more source
Mitigating radiation damage of single photon detectors for space applications
Single-photon detectors in space must retain useful performance characteristics despite being bombarded with sub-atomic particles. Mitigating the effects of this space radiation is vital to enabling new space applications which require high-fidelity ...
Elena Anisimova +9 more
doaj +1 more source
T-count and T-depth of any multi-qubit unitary
We design an algorithm to determine the (minimum) T-count of any n-qubit (n ≥ 1) unitary W of size 2 n × 2 n , over the Clifford+T gate set. The space and time complexity of our algorithm are $$O\left({2}^{2n}\right)$$ O 2 2 n and $$O\left({2}^{2n ...
Vlad Gheorghiu +2 more
doaj +1 more source
We describe how physics of computation determines computational complexity. In particular we show how quantum phenomena lead to qualitatively new modes of computation. An ideal quantum computer would allow to face certain tasks out of reach of classical computers, the factorization problem being the most striking example.
Barenco, A, Huelga, S, Ekert, A
openaire +4 more sources
Probing the strongly driven spin-boson model in a superconducting quantum circuit
Two-level systems interacting with a bosonic environment appear everywhere in physics. Here, the authors use a superconducting device to study this spin-boson model in the presence of coherent driving, showing that the drive enhances dissipation into the
L. Magazzù +8 more
doaj +1 more source
QUANTUM HOLONOMIES FOR QUANTUM COMPUTING [PDF]
Holonomic Quantum Computation (HQC) is an all-geometrical approach to quantum information processing. In the HQC strategy information is encoded in degenerate eigen-spaces of a parametric family of Hamiltonians. The computational network of unitary quantum gates is realized by driving adiabatically the Hamiltonian parameters along loops in a control ...
Pachos, Jiannis, Zanardi, Paolo
openaire +3 more sources
Quantum Computing: Selected Internet Resources for Librarians, Researchers, and the Casually Curious
This article is an annotated selection of the most important and informative Internet resources for learning about quantum computing, finding quantum computing literature, and tracking quantum computing ...
Jill Cirasella, Cirasella, Jill
core +1 more source
Investigations in Quantum Computing: Causality and Graph Isomorphism [PDF]
In this thesis I explore two different types of limits on the time complexity of quantum computation---that is, limits on how much time is required to perform a given class of quantum operations on a quantum system. Upper limits can be found by explicit
Beckman, David Eugene
core +1 more source
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation [PDF]
Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which implies that the adiabatic computation model and the conventional quantum computation model are polynomially ...
Dorit Aharonov +5 more
openaire +3 more sources
Deep neural network analysis models for complex random telegraph signals
Time-fluctuating signals are ubiquitous and diverse in many physical, chemical, and biological systems, among which random telegraph signals (RTSs) refer to a series of instantaneous switching events between two discrete levels from single-particle ...
Marcel Robitaille +4 more
doaj +1 more source

