Results 71 to 80 of about 2,063,385 (366)
Noncommutative tori and universal sets of non-binary quantum gates
, 2002 A problem of universality in simulation of evolution of quantum system and in theory of quantum computations is related with the possibility of expression or approximation of arbitrary unitary transformation by composition of specific unitary ...
Alexander Yu. Vlasov, Vlasov A. Y.
core +1 more source
Implementation of universal quantum gates based on nonadiabatic geometric phases [PDF]
, 2002 We propose an experimentally feasible scheme to achieve quantum computation based on nonadiabatic geometric phase shifts, in which a cyclic geometric phase is used to realize a set of universal quantum gates.
D. V. Averin +7 more
core +2 more sources
Efficient verification of quantum gates with local operations [PDF]
Physical Review A, 2019 Efficient verification of the functioning of quantum devices is a key to the development of quantum technologies, but is a daunting task as the system size increases.
Huangjun Zhu, Haoyu Zhang
semanticscholar +1 more source
Demonstrating a Continuous Set of Two-Qubit Gates for Near-Term Quantum Algorithms. [PDF]
Physical Review Letters, 2020 Quantum algorithms offer a dramatic speedup for computational problems in material science and chemistry. However, any near-term realizations of these algorithms will need to be optimized to fit within the finite resources offered by existing noisy ...
B. Foxen +56 more
semanticscholar +1 more source
High-Dimensional Single-Photon Quantum Gates: Concepts and Experiments. [PDF]
Physical Review Letters, 2017 Transformations on quantum states form a basic building block of every quantum information system. From photonic polarization to two-level atoms, complete sets of quantum gates for a variety of qubit systems are well known. For multilevel quantum systems
A. Babazadeh +6 more
semanticscholar +1 more source
Demonstrating quantum algorithm acceleration with NMR quantum computer
, 2004 In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger modules, such ...
Hata, Kazuya +3 more
core +1 more source
Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems [PDF]
, 1998 If quantum states exhibit small nonlinearities during time evolution, then quantum computers can be used to solve NP-complete problems in polynomial time. We provide algorithms that solve NP-complete and #P oracle problems by exploiting nonlinear quantum
A. Ekert +20 more
core +2 more sources
Advanced Functional Materials, EarlyView.Novel ferrocene derivatives (e.g., FcPhc2) are used as an ultrathin layer hole‐blocking layer, reducing hole injection from the Ag contact. This results in an ultralow noise spectral density of 1.2 × 10−14 A Hz−1/2, and a high specific detectivity of 8.1 × 1012 Jones at −0.5 V.
Eunyoung Hong +16 more
wiley +1 more source
Parallel Entangling Operations on a Universal Ion Trap Quantum Computer
, 2018 The circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations.
Figgatt, C. +6 more
core +1 more source
Dequantizing read-once quantum formulas [PDF]
, 2013 Quantum formulas, defined by Yao [FOCS '93], are the quantum analogs of classical formulas, i.e., classical circuits in which all gates have fanout one.
Cosentino, Alessandro +2 more
core +2 more sources