Results 21 to 30 of about 1,033,899 (283)
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
We investigate the problem of synthesizing T-depth optimal quantum circuits for exactly implementable unitaries over the Clifford+T gate set. We construct a subset, $${{\mathbb{V}}}_{n}$$ V n , of T-depth 1 unitaries.
Vlad Gheorghiu+2 more
doaj +1 more source
The quantum field as a quantum computer [PDF]
4 PRL-style pages with 4 eps ...
Giacomo Mauro DʼAriano+1 more
openaire +4 more sources
Laser annealing heals radiation damage in avalanche photodiodes
Avalanche photodiodes (APDs) are a practical option for space-based quantum communications requiring single-photon detection. However, radiation damage to APDs significantly increases their dark count rates and thus reduces their useful lifetimes in ...
Jin Gyu Lim+5 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
Defects in Quantum Computers [PDF]
AbstractThe shift of interest from general purpose quantum computers to adiabatic quantum computing or quantum annealing calls for a broadly applicable and easy to implement test to assess how quantum or adiabatic is a specific hardware. Here we propose such a test based on an exactly solvable many body system–the quantum Ising chain in transverse ...
Gardas, Bartłomiej+3 more
openaire +6 more sources
Control electronics for superconducting quantum processors have strict requirements for accurate command of the sensitive quantum states of their qubits. Hinging on the purity of ultra-phase-stable oscillators to upconvert very-low-noise baseband pulses,
William D. Kalfus+7 more
doaj +1 more source
A Uniform Quantum Computing Model Based on Virtual Quantum Processors [PDF]
Quantum Computers, one fully realized, can represent an exponential boost in computing power. However, the computational power of the current quantum computers, referred to as Noisy Internediate Scale Quantum, or NISQ, is severely limited because of environmental and intrinsic noise, as well as the very low connectivity between qubits compared to their
arxiv +1 more source
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
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 ...
Jiannis K. Pachos+2 more
openaire +3 more sources
Subdivided Phase Oracle for NISQ Search Algorithms
Because noisy intermediate-scale quantum (NISQ) machines accumulate errors quickly, we need new approaches to designing NISQ-aware algorithms and assessing their performance.
Takahiko Satoh+2 more
doaj +1 more source