Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Noisy intermediate-scale quantum algorithms
A universal fault-tolerant quantum computer that can efficiently solve problems such as
integer factorization and unstructured database search requires millions of qubits with low …
integer factorization and unstructured database search requires millions of qubits with low …
The resurgence of the linear optics quantum interferometer—recent advances & applications
Linear optics has seen a resurgence for applications in quantum information processing
owing to its miniaturisation on-chip, and increase in production efficiency and quality of …
owing to its miniaturisation on-chip, and increase in production efficiency and quality of …
Applications of near-term photonic quantum computers: software and algorithms
Gaussian boson sampling (GBS) is a near-term platform for photonic quantum computing.
Recent efforts have led to the discovery of GBS algorithms with applications to graph-based …
Recent efforts have led to the discovery of GBS algorithms with applications to graph-based …
Universal quantum circuits for quantum chemistry
Universal gate sets for quantum computing have been known for decades, yet no universal
gate set has been proposed for particle-conserving unitaries, which are the operations of …
gate set has been proposed for particle-conserving unitaries, which are the operations of …
The Goldilocks principle of learning unitaries by interlacing fixed operators with programmable phase shifters on a photonic chip
Programmable photonic integrated circuits represent an emerging technology that
amalgamates photonics and electronics, paving the way for light-based information …
amalgamates photonics and electronics, paving the way for light-based information …
Efficient decomposition of unitary matrices in quantum circuit compilers
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary
set of quantum gates. Efficient implementation of this decomposition allows for the …
set of quantum gates. Efficient implementation of this decomposition allows for the …
Quantum geometry beyond projective single bands
The past few years have seen a revived interest in quantum geometrical characterizations of
band structures due to the rapid development of topological insulators and semi-metals …
band structures due to the rapid development of topological insulators and semi-metals …
The complexity of bipartite Gaussian boson sampling
Gaussian boson sampling is a model of photonic quantum computing that has attracted
attention as a platform for building quantum devices capable of performing tasks that are out …
attention as a platform for building quantum devices capable of performing tasks that are out …
Exact simulation of Gaussian boson sampling in polynomial space and exponential time
We introduce an exact classical algorithm for simulating Gaussian boson sampling (GBS).
The complexity of the algorithm is exponential in the number of photons detected, which is …
The complexity of the algorithm is exponential in the number of photons detected, which is …
Matrix decompositions in quantum optics: Takagi/Autonne, Bloch–Messiah/Euler, Iwasawa, and Williamson
In this tutorial, we summarize four important matrix decompositions commonly used in
quantum optics, namely the Takagi/Autonne, Bloch–Messiah/Euler, Iwasawa, and …
quantum optics, namely the Takagi/Autonne, Bloch–Messiah/Euler, Iwasawa, and …