Zobrazeno 1 - 10
of 147
pro vyhledávání: '"Eddy Z"'
Rapid development in quantum computing leads to the appearance of several quantum applications. Quantum Fourier Transformation (QFT) sits at the heart of many of these applications. Existing work leverages SAT solver or heuristics to generate a hardw
Externí odkaz:
http://arxiv.org/abs/2408.11226
Compiling a given quantum algorithm into a target hardware architecture is a challenging optimization problem. The compiler must take into consideration the coupling graph of physical qubits and the gate operation dependencies. The existing noise in
Externí odkaz:
http://arxiv.org/abs/2402.09705
In this research paper, our primary focus revolves around the domain-specific hardware mapping strategy tailored for Quantum Fourier Transformation (QFT) circuits. While previous approaches have heavily relied on SAT solvers or heuristic methods to g
Externí odkaz:
http://arxiv.org/abs/2312.16114
Quantum computing has shown promise in solving complex problems by leveraging the principles of superposition and entanglement. Variational quantum algorithms (VQA) are a class of algorithms suited for near term quantum computers due to their modest
Externí odkaz:
http://arxiv.org/abs/2309.01905
Autor:
Hua, Fei, Wang, Meng, Li, Gushu, Peng, Bo, Liu, Chenxu, Zheng, Muqing, Stein, Samuel, Ding, Yufei, Zhang, Eddy Z., Humble, Travis S., Li, Ang
The success of a quantum algorithm hinges on the ability to orchestrate a successful application induction. Detrimental overheads in mapping general quantum circuits to physically implementable routines can be the deciding factor between a successful
Externí odkaz:
http://arxiv.org/abs/2308.07581
Autor:
Hua, Fei, Jin, Yuwei, Chen, Yanhao, Vittal, Suhas, Krsulich, Kevin, Bishop, Lev S., Lapeyre, John, Javadi-Abhari, Ali, Zhang, Eddy Z.
Quantum measurement is important to quantum computing as it extracts the outcome of the circuit at the end of the computation. Previously, all measurements have to be done at the end of the circuit. Otherwise, it will incur significant errors. But it
Externí odkaz:
http://arxiv.org/abs/2211.01925
Autor:
Hua, Fei, Jin, Yuwei, Li, Ang, Liu, Chenxu, Wang, Meng, Chen, Yanhao, Zhang, Chi, Hayes, Ari, Stein, Samuel, Guo, Minghao, Huang, Yipeng, Zhang, Eddy Z.
Near-term quantum systems tend to be noisy. Crosstalk noise has been recognized as one of several major types of noises in superconducting Noisy Intermediate-Scale Quantum (NISQ) devices. Crosstalk arises from the concurrent execution of two-qubit ga
Externí odkaz:
http://arxiv.org/abs/2207.05751
Autor:
Jin, Yuwei, Luo, Jason, Fong, Lucent, Chen, Yanhao, Hayes, Ari B., Zhang, Chi, Hua, Fei, Zhang, Eddy Z.
Quantum Approximation Optimization Algorithm (QAOA) is a highly advocated variational algorithm for solving the combinatorial optimization problem. One critical feature in the quantum circuit of QAOA algorithm is that it consists of two-qubit operato
Externí odkaz:
http://arxiv.org/abs/2112.06143
The rapid progress of physical implementation of quantum computers paved the way for the design of tools to help users write quantum programs for any given quantum device. The physical constraints inherent in current NISQ architectures prevent most q
Externí odkaz:
http://arxiv.org/abs/2009.02346
The rapid progress of physical implementation of quantum computers paved the way of realising the design of tools to help users write quantum programs for any given quantum devices. The physical constraints inherent to the current NISQ architectures
Externí odkaz:
http://arxiv.org/abs/2002.07289