59 citations · 256 across the 22 of their papers we have counts for
22 papers
Enhancing Entanglement Purification with Shared Randomness
Allen Zang, Bikun Li, Xinan Chen +4
Entanglement purification protocols (EPPs) are essential for improving entanglement fidelity to support fault-tolerant distributed quantum information processing. Practical entangl…
Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations
James Brown, Jason Iaconis, Yuri Alexeev +6
Quantum simulation of fermionic Hamiltonians is a leading application of quantum computing, but accurate execution on present-day hardware is limited by error accumulation in deep…
Enhancing Noisy Quantum Sensing by GHZ State Partitioning
Allen Zang, Tian-Xing Zheng, Peter C. Maurer +3
Presence of harmful noise is inevitable in entanglement-enhanced sensing systems, requiring careful allocation of resources to optimize sensing performance in practical scenarios.…
Entanglement Purification in Quantum Networks: Guaranteed Improvement and Optimal Time
Allen Zang, Xin-An Chen, Eric Chitambar +2
While the concept of entanglement purification protocols (EPPs) is straightforward, the integration of EPPs in network architectures requires careful performance evaluations and op…
Hardware-Software Co-design for Distributed Quantum Computing
Ji Liu, Allen Zang, Martin Suchara +2
Distributed quantum computing (DQC) offers a pathway for scaling up quantum computing architectures beyond the confines of a single chip. Entanglement is a crucial resource for imp…
No-Go Theorems for Universal Entanglement Purification
Allen Zang, Xinan Chen, Eric Chitambar +2
An entanglement purification protocol (EPP) aims to transform multiple noisy entangled states into a single entangled state with higher fidelity. In this work we consider EPPs that…
Analytical Performance Estimations for Quantum Repeater Network Scenarios
Allen Zang, Joaquin Chung, Rajkumar Kettimuthu +2
Quantum repeater chains will form the backbone of future quantum networks that distribute entanglement between network nodes. Therefore, it is important to understand the entanglem…
Provable Optimality of the Square-Tooth Atomic Frequency Comb Quantum Memory
Allen Zang, Martin Suchara, Tian Zhong
Atomic frequency comb (AFC) quantum memories are a promising technology for quantum repeater networks because they enable multi-mode, long-time, and high-fidelity storage of photon…
Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows
Benchen Huang, Yi-Ting Chen, Brajesh Gupt +4
Solving the electronic structure problem of molecules and solids to high accuracy is a major challenge in quantum chemistry and condensed matter physics. The rapid emergence and de…
Entanglement Distribution in Quantum Repeater with Purification and Optimized Buffer Time
Allen Zang, Xinan Chen, Alexander Kolar +4
Quantum repeater networks that allow long-distance entanglement distribution will be the backbone of distributed quantum information processing. In this paper we explore entangleme…
Spacetime-Efficient Low-Depth Quantum State Preparation with Applications
Kaiwen Gui, Alexander M. Dalzell, Alessandro Achille +2
We propose a novel deterministic method for preparing arbitrary quantum states. When our protocol is compiled into CNOT and arbitrary single-qubit gates, it prepares an -dimensi…
Simulation of Entanglement Generation between Absorptive Quantum Memories
Allen Zang, Alexander Kolar, Joaquin Chung +3
Quantum entanglement is an essential resource for quantum networks. However, the generation of entanglement between physical devices at remote network nodes is a challenging task t…
Adaptive, Continuous Entanglement Generation for Quantum Networks
Alexander Kolar, Allen Zang, Joaquin Chung +2
Quantum networks, which enable the transfer of quantum information across long distances, promise to provide exciting benefits and new possibilities in many areas including communi…
Hardware-Conscious Optimization of the Quantum Toffoli Gate
Max Aksel Bowman, Pranav Gokhale, Jeffrey Larson +2
While quantum computing holds great potential in combinatorial optimization, electronic structure calculation, and number theory, the current era of quantum computing is limited by…
Quantum Error Mitigation by Pauli Check Sandwiching
Alvin Gonzales, Ruslan Shaydulin, Zain Saleem +1
We describe and analyze an error mitigation technique that uses multiple pairs of parity checks to detect the presence of errors. Each pair of checks uses one ancilla qubit to dete…
Optimized Quantum Program Execution Ordering to Mitigate Errors in Simulations of Quantum Systems
Teague Tomesh, Kaiwen Gui, Pranav Gokhale +4
Simulating the time evolution of a physical system at quantum mechanical levels of detail -- known as Hamiltonian Simulation (HS) -- is an important and interesting problem across…
Faster and More Reliable Quantum SWAPs via Native Gates
Pranav Gokhale, Teague Tomesh, Martin Suchara +1
Due to the sparse connectivity of superconducting quantum computers, qubit communication via SWAP gates accounts for the vast majority of overhead in quantum programs. We introduce…
Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation
Teague Tomesh, Zain H. Saleem, Michael A. Perlin +3
Scaling the size of monolithic quantum computer systems is a difficult task. As the number of qubits within a device increases, a number of factors contribute to decreases in yield…
Quantum Local Search with the Quantum Alternating Operator Ansatz
Teague Tomesh, Zain H. Saleem, Martin Suchara
We present a new hybrid, local search algorithm for quantum approximate optimization of constrained combinatorial optimization problems. We focus on the Maximum Independent Set pro…
Quantum Divide and Compute: Exploring The Effect of Different Noise Sources
Thomas Ayral, François-Marie Le Régent, Zain Saleem +2
Our recent work (Ayral et al., 2020 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)) showed the first implementation of the Quantum Divide and Compute (QDC) method, which a…
Quantum Circuit Cutting with Maximum Likelihood Tomography
Michael A. Perlin, Zain H. Saleem, Martin Suchara +1
We introduce maximum likelihood fragment tomography (MLFT) as an improved circuit cutting technique for running clustered quantum circuits on quantum devices with a limited number…
Measurement Cost for Variational Quantum Eigensolver on Molecular Hamiltonians
Pranav Gokhale, Frederic T. Chong
Variational Quantum Eigensolver (VQE) is a promising algorithm for near-term quantum machines. It can be used to estimate the ground state energy of a molecule by performing separa…