Quantum expanders from any classical Cayley graph expander

2008 ◽  
Vol 8 (8&9) ◽  
pp. 715-721 ◽  
Author(s):  
A.W. Harrow

We give a simple recipe for translating walks on Cayley graphs of a group G into a quantum operation on any irrep of G. Most properties of the classical walk carry over to the quantum operation: degree becomes the number of Kraus operators, the spectral gap becomes the gap of the quantum operation (viewed as a linear map on density matrices), and the quantum operation is efficient whenever the classical walk and the quantum Fourier transform on G are efficient. This means that using classical constant-degree constant-gap families of Cayley expander graphs on e.g. the symmetric group, we can construct efficient families of quantum expanders.

2004 ◽  
Vol 323 (1-2) ◽  
pp. 48-56 ◽  
Author(s):  
Runyao Duan ◽  
Zhengfeng Ji ◽  
Yuan Feng ◽  
Mingsheng Ying

2005 ◽  
Vol 03 (02) ◽  
pp. 413-424 ◽  
Author(s):  
KAVITA DORAI ◽  
DIETER SUTER

The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits n. The schemes were implemented on a two-qubit NMR quantum information processor and the resultant density matrices reconstructed using standard quantum state tomography techniques. Their experimental fidelities have been measured and compared.


2016 ◽  
Vol 114 (2) ◽  
pp. 20004 ◽  
Author(s):  
Y. S. Nam ◽  
R. Blümel

2012 ◽  
Vol 12 (2) ◽  
pp. 793-803 ◽  
Author(s):  
Wei-Wei Zhang ◽  
Fei Gao ◽  
Bin Liu ◽  
Qiao-Yan Wen ◽  
Hui Chen

2015 ◽  
Vol 13 (07) ◽  
pp. 1550059 ◽  
Author(s):  
Shruti Dogra ◽  
Arvind Dorai ◽  
Kavita Dorai

The quantum Fourier transform (QFT) is a key ingredient of several quantum algorithms and a qudit-specific implementation of the QFT is hence an important step toward the realization of qudit-based quantum computers. This work develops a circuit decomposition of the QFT for hybrid qudits based on generalized Hadamard and generalized controlled-phase gates, which can be implemented using selective rotations in NMR. We experimentally implement the hybrid qudit QFT on an NMR quantum emulator, which uses four qubits to emulate a single qutrit coupled to two qubits.


2018 ◽  
Vol 22 (12) ◽  
pp. 2427-2430 ◽  
Author(s):  
Dan Song ◽  
Chen He ◽  
Zhengwen Cao ◽  
Geng Chai

2018 ◽  
Vol 17 (12) ◽  
Author(s):  
Hai-Sheng Li ◽  
Ping Fan ◽  
Hai-ying Xia ◽  
Shuxiang Song ◽  
Xiangjian He

Sign in / Sign up

Export Citation Format

Share Document