Results 91 to 100 of about 745,886 (317)

Linear algebra and quantum algorithm [PDF]

open access: yesarXiv, 2020
In mathematical aspect, we introduce quantum algorithm and the mathematical structure of quantum computer. Quantum algorithm is expressed by linear algebra on a finite dimensional complex inner product space. The mathematical formulations of quantum mechanics had been established in around 1930, by von Neumann. The formulation uses functional analysis,
arxiv  

Quantum Emitters in Hexagonal Boron Nitride: Principles, Engineering and Applications

open access: yesAdvanced Functional Materials, EarlyView.
Quantum emitters in hexagonal boron nitride have emerged as a promising candidate for quantum information science. This review examines the fundamentals of these quantum emitters, including their level structures, defect engineering, and their possible chemical structures.
Thi Ngoc Anh Mai   +8 more
wiley   +1 more source

Quantum machine learning of large datasets using randomized measurements

open access: yesMachine Learning: Science and Technology, 2023
Quantum computers promise to enhance machine learning for practical applications. Quantum machine learning for real-world data has to handle extensive amounts of high-dimensional data.
Tobias Haug, Chris N Self, M S Kim
doaj   +1 more source

Self-Protected Quantum Algorithms Based on Quantum State Tomography [PDF]

open access: yesQuantum Information Processing, Vol. 8, 1 (2009), 2007
Only a few classes of quantum algorithms are known which provide a speed-up over classical algorithms. However, these and any new quantum algorithms provide important motivation for the development of quantum computers. In this article new quantum algorithms are given which are based on quantum state tomography.
arxiv  

Generic Quantum Block Compression [PDF]

open access: yes, 2001
A generic approach for compiling any classical block compression algorithm into a quantum block compression algorithm is presented. Using this technique, compression asymptoticaly approaching the von Neumann entropy of a qubit source can be achieved.
arxiv   +1 more source

Feasibility Analysis of Grover-meets-Simon Algorithm [PDF]

open access: yesarXiv, 2023
Quantum algorithm is a key tool for cryptanalysis. At present, people are committed to building powerful quantum algorithms and tapping the potential of quantum algorithms, so as to further analyze the security of cryptographic algorithms under quantum computing.
arxiv  

Quantum algorithms for element distinctness [PDF]

open access: yesProceedings 16th Annual IEEE Conference on Computational Complexity, 2002
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Hoyer, and Tapp, and imply an O(N^{3/4} log N) quantum upper bound for the element distinctness problem in the comparison complexity model (contrasting with Theta(N log N ...
Miklos Santha   +6 more
openaire   +5 more sources

Identification and Reversible Optical Switching of NV+ Centers in Diamond

open access: yesAdvanced Functional Materials, EarlyView.
NV+ centers in diamond are predicted to coexist with NV0 and NV– centers, but direct experimental confirmation remains challenging. Using positron annihilation spectroscopy with in situ light illumination, a charge transition NV+/0 is observed at 1.234(8) eV.
Marcel Dickmann   +13 more
wiley   +1 more source

Fixed-Point Grover Adaptive Search for Quadratic Binary Optimization Problems

open access: yesIEEE Transactions on Quantum Engineering
In this article, we study a Grover-type method for quadratic unconstrained binary optimization (QUBO) problems. For an $n$-dimensional QUBO problem with $m$ nonzero terms, we construct a marker oracle for such problems with a tunable parameter, $\Lambda \
Akos Nagy   +4 more
doaj   +1 more source

A quantum algorithm for greatest common divisor problem [PDF]

open access: yesarXiv, 2017
We present a quantum algorithm solving the greatest common divisor (GCD) problem. This quantum algorithm possesses similar computational complexity with classical algorithms, such as the well-known Euclidean algorithm for GCD. This algorithm is an application of the quantum algorithms for the hidden subgroup problems, the same as Shor factoring ...
arxiv  

Home - About - Disclaimer - Privacy