VTechWorks staff will be away for the Thanksgiving holiday beginning at noon on Wednesday, November 27, through Friday, November 29. We will resume normal operations on Monday, December 2. Thank you for your patience.

Browsing by Author "Qin, Zhangjie"

Now showing 1 - 3 of 3
  • Thumbnail Image
    Benchmarking measurement-based quantum computation on graph states
    Qin, Zhangjie (Virginia Tech, 2024-08-26)
    Measurement-based quantum computation is a form of quantum computing that operates on a prepared entangled graph state, typically a cluster state. In this dissertation, we will detail the creation of graph states across various physical platforms using different entangling gates. We will then benchmark the quality of graph states created with error-prone interactions through quantum wire teleportation experiments. By leveraging underlying symmetry, we will design graph states as measurement-based quantum error correction codes to protect against perturbations, such as ZZ crosstalk in quantum wire teleportation. Additionally, we will explore other measurement-based algorithms used for the quantum simulation of time evolution in fermionic systems, using the Kitaev model and the Hubbard model as examples.
  • Thumbnail Image
    Measurement-based time evolution for quantum simulation of fermionic systems
    Lee, Woo-Ram; Qin, Zhangjie; Raussendorf, Robert; Sela, Eran; Scarola, V. W. (American Physical Society, 2022-07-25)
    Quantum simulation using time evolution in phase-estimation-based quantum algorithms can yield unbiased solutions of classically intractable models. However, long runtimes open such algorithms to decoherence. We show how measurement-based quantum simulation uses effective time evolution via measurement to allow runtime advantages over conventional circuit-based algorithms that use real-time evolution with quantum gates. We construct a hybrid algorithm to find energy eigenvalues in fermionic models using only measurements on graph states. We apply the algorithm to the Kitaev and Hubbard chains. Resource estimates show a runtime advantage if measurements can be performed faster than gates, and graph states compactification is fully used. In this letter, we set the stage to allow advances in measurement precision to improve quantum simulation.
  • Thumbnail Image
    Quantifying entanglement in cluster states built with error-prone interactions
    Qin, Zhangjie; Lee, Woo-Ram; DeMarco, Brian; Gadway, Bryce; Kotochigova, Svetlana; Scarola, V. W. (2021-11-15)
    Measurement-based quantum computing is an alternative paradigm to the circuit-based model. This approach can be advantageous in certain scenarios, such as when read-out is fast and accurate, but two-qubit gates realized via inter-particle interactions are slow and can be parallelized to efficiently create a cluster state. However, understanding how two-qubit errors impact algorithm accuracy and developing experimentally viable approaches to characterize cluster-state fidelity are outstanding challenges. Here, we consider one-dimensional cluster states built from controlled phase, Ising, and XY interactions with slow two-qubit error in the interaction strength, consistent with error models of interactions found in a variety of qubit architectures. We detail an experimentally viable teleportation fidelity that offers a measure of the impact of these errors on the cluster state. Our fidelity calculations show that the error has a distinctly different impact depending on the underlying interaction used for the two-qubit entangling gate. In particular, the Ising and XY interactions can allow perfect teleportation through the cluster state even with large errors, but the controlled phase interaction does not. Nonetheless, we find that teleportation through cluster state chains of size N has a maximum two-qubit error for teleportation along a quantum channel that decreases as N-1/2. To enable the construction of larger cluster states, we design lowest-order refocusing pulses for correcting these slow errors in the interaction strength. Our work generalizes to higher-dimensional cluster states and sets the stage for experiments to monitor the growth of entanglement in cluster states built from error-prone interactions.