Results 31 to 40 of about 437,004 (281)
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
Geometric quantum computation [PDF]
15 pages, LaTeX, uses cite, eepic, epsfig, graphicx and amsfonts. Accepted by J.
Ekert, A +6 more
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
AbstractQuantum Bayesian computation is an emerging field that levers the computational gains available from quantum computers. They promise to provide an exponential speed‐up in Bayesian computation. Our article adds to the literature in three ways.
Nick Polson, Vadim Sokolov, Jianeng Xu
openaire +2 more sources
Measurement-only verifiable blind quantum computing with quantum input verification
Verifiable blind quantum computing is a secure delegated quantum computing where a client with a limited quantum technology delegates her quantum computing to a server who has a universal quantum computer.
Morimae, Tomoyuki
core +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 +2 more sources
One-way quantum computing in superconducting circuits
We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster-state provides the quantum resource, while ...
Albarrán-Arriagada, F. +6 more
core +1 more source

