The AKLT state is the ground state of an isotropic quantum Heisenberg spin-1 model. It exhibits an excitation gap and an exponentially decaying correlation function, with fractionalized excitations at its boundaries. So far, the one-dimensional AKLT model has only been experimentally realized with trapped-ions as well as photonic systems. In this work, we successfully prepared the AKLT state on a noisy intermediate-scale quantum (NISQ) era quantum device. In particular, we developed a non-deterministic algorithm on the IBM quantum processor, where the non-unitary operator necessary for the AKLT state preparation is embedded in a unitary operator with an additional ancilla qubit for each pair of auxiliary spin-1/2’s. Such a unitary operator is effectively represented by a parametrized circuit composed of single-qubit and nearest-neighbor CX gates. Compared with the conventional operator decomposition method from Qiskit, our approach results in a much shallower circuit depth with only nearest-neighbor gates, while maintaining a fidelity in excess of 99.99% with the original operator. By simultaneously post-selecting each ancilla qubit such that it belongs to the subspace of spin-up |↑>, an AKLT state can be systematically obtained by evolving from an initial trivial product state of singlets plus ancilla qubits in spin-up on a quantum computer, and it is subsequently recorded by performing measurements on all the other physical qubits. We show how the accuracy of our implementation can be further improved on the IBM quantum processor with readout error mitigation.
The AKLT state is the ground state of an isotropic quantum Heisenberg spin-1 model. It exhibits an excitation gap and an exponentially decaying correlation function, with fractionalized excitations at its boundaries. So far, the one-dimensional AKLT model has only been experimentally realized with trapped-ions as well as photonic systems. In this work, we successfully prepared the AKLT state on a noisy intermediate-scale quantum (NISQ) era quantum device. In particular, we developed a non-deterministic algorithm on the IBM quantum processor, where the non-unitary operator necessary for the AKLT state preparation is embedded in a unitary operator with an additional ancilla qubit for each pair of auxiliary spin-1/2’s. Such a unitary operator is effectively represented by a parametrized circuit composed of single-qubit and nearest-neighbor CX gates. Compared with the conventional operator decomposition method from Qiskit, our approach results in a much shallower circuit depth with only nearest-neighbor gates, while maintaining a fidelity in excess of 99.99% with the original operator. By simultaneously post-selecting each ancilla qubit such that it belongs to the subspace of spin-up |↑>, an AKLT state can be systematically obtained by evolving from an initial trivial product state of singlets plus ancilla qubits in spin-up on a quantum computer, and it is subsequently recorded by performing measurements on all the other physical qubits. We show how the accuracy of our implementation can be further improved on the IBM quantum processor with readout error mitigation.
There is currently a tremendous interest in developing practical applications of NISQ processors without the overhead required by full error correction. Quantum information processing is especially challenging within the gate model, as algorithms quickly lose fidelity as the problem size and circuit depth grow. This has lead to a number of non-gate-model approaches such as analog quantum simulation and quantum annealing. These approaches come with specific hardware requirements that are typically different than that of a universal gate-based quantum computer. We have previously proposed a non-gate-model approach called the single-excitation subspace (SES) method, which requires a complete graph of superconducting qubits. Like any approach lacking error correction, the SES method is not scalable, but it often leads to algorithms with constant depth, allowing it to outperform the gate model in a wide variety of applications. A challenge of the SES method is that it requires a physical qubit for every basis state in the computer's Hilbert space. This imposes large resource costs for algorithms using registers of ancillary qubits, as each ancilla would double the required graph size. Here we show how to circumvent this doubling by leaving the SES and reintroducing a tensor product structure in the computational subspace. Specifically, we implement the tensor product of an SES register holding ``data" with one or more ancilla qubits. This enables a hybrid form of quantum computation where fast SES operations are performed on the data, traditional logic gates and measurements are performed on the ancillas, and controlled-unitaries act between. As an application we give an SES implementation of the quantum linear system solver of Harrow, Hassidim, and Lloyd.
In the current era of Noisy Intermediate-Scale Quantum (NISQ) technology, the practical use of quantum computers remains inhibited by our inability to aptly decouple qubits from their environment to mitigate computational errors. In this paper, we introduce an approach by which knowledge of a qubit's initial quantum state and the standard parameters describing its decoherence can be leveraged to mitigate the noise present during the execution of a single-qubit gate. We benchmark our protocol using cloud-based access to IBM quantum processors. On ibmq_rome, we demonstrate a reduction of the single-qubit error rate by 38%, from [Formula: see text] to [Formula: see text], provided the initial state of the input qubit is known. On ibmq_bogota, we prove that our protocol will never decrease gate fidelity, provided the system's [Formula: see text] and [Formula: see text] times have not drifted above 100 times their assumed values. The protocol can be used to reduce quantum state preparation errors, as well as to improve the fidelity of quantum circuits for which some knowledge of the qubits' intermediate states can be inferred. This paper presents a pathway to using information about noise levels and quantum state distributions to significantly reduce error rates associated with quantum gates via optimized decomposition into native hardware gates.
Realizing nonunitary transformations on unitary-gate-based quantum devices is critically important for simulating a variety of physical problems, including open quantum systems and subnormalized quantum states. We present a dilation-based algorithm to simulate nonunitary operations using probabilistic quantum computing with only one ancilla qubit. We utilize the singular-value decomposition (SVD) to decompose any general quantum operator into a product of two unitary operators and a diagonal nonunitary operator, which we show can be implemented by a diagonal unitary operator in a one-qubit dilated space. While dilation techniques increase the number of qubits in the calculation, and thus the gate complexity, our algorithm limits the operations required in the dilated space to a diagonal unitary operator, which has known circuit decompositions. We use this algorithm to prepare random subnormalized two-level states on a quantum device with high fidelity. Furthermore, we present the accurate nonunitary dynamics of two-level open quantum systems in a dephasing channel and an amplitude-damping channel computed on a quantum device. The algorithm presented will be most useful for implementing general nonunitary operations when the SVD can be readily computed, which is the case for most operators in the noisy intermediate-scale quantum computing era.
Quantum state preparation plays a crucial role in several areas of quantum information science, in applications such as quantum simulation, quantum metrology and quantum computing. However, typically state preparation requires resources that scale exponentially with the problem size, due to their probabilistic nature or otherwise, making studying such models challenging. In this article, we propose a method to prepare the ground state of the Affleck-Lieb-Kennedy-Tasaki (AKLT) model deterministically using a measurement-based imaginary time evolution (MITE) approach. By taking advantage of the special properties of the AKLT state, we show that it can be prepared efficiently using the MITE approach. Estimates based on the convergence of a sequence of local projections, as well as direct evolution of the MITE algorithm suggest a constant scaling with respect to the number of AKLT sites, which is an exponential improvement over the naive estimate for convergence. We show that the procedure is compatible with qubit-based simulators, and show that using a variational quantum algorithm for circuit recompilation, the measurement operator required for MITE can be well approximated by a circuit with a much shallower circuit depth compared with the one obtained using the default Qiskit method.
Quantum devices in the noisy intermediate-scale quantum (NISQ) era are highly susceptible to different types of quantum noise, which directly impact the reliability of experimental results. This work provides a characterization of error behavior arising from quantum noises on IBM's superconducting quantum processor, offering practical insights for algorithm design, benchmarking, and error-mitigation strategies on a real superconducting quantum processor in the NISQ era. The study begins with the measurement of the basis state, without applying any gate, to quantify state-preparation and measurement (SPAM) errors. Additionally, the errors are further quantified due to the application of single-qubit Pauli-X, two-qubit CNOT gate and other multi-qubit Controlled-X gates. Each circuit was executed with 1024 shots, and the percentage error between the expected and observed outputs was computed. The results show that the single-qubit Pauli-X gate exhibits relatively low errors in comparison with the two-qubit CNOT gate, whereas other multi-qubit Controlled-X gates lead to significantly higher deviations. This work also analyzes the noise effect of a fourqubit Controlled-X gate being implemented using a three-qubit Controlled-X gate with an extra auxiliary qubit, and the result shows a significant reduction in the error rate.
Quantum computers present a compelling platform for the study of open quantum systems, namely the non-unitary dynamics of a system. Here, we investigate and report digital simulations of Markovian, non-unitary dynamics that converge to a unique steady state. The steady state is programmed as a desired target state, yielding semblance to a quantum state preparation protocol. By delegating ancilla qubits and systems qubits, the system state is driven to the target state by repeatedly performing the following steps: (1) executing a designated system-ancilla entangling circuit, (2) measuring the ancilla qubits, and (3) re-initializing ancilla qubits to known states through active reset. While the ancilla qubits are measured and reinitialized to known states, the system qubits undergo a non-unitary evolution and are steered from arbitrary initial states to desired target states. We show results of the method by preparing arbitrary qubit states and qutrit (three-level) states on contemporary quantum computers. We also demonstrate that the state convergence can be accelerated by utilizing the readouts of the ancilla qubits to guide the protocol in a non-blind manner. Our work serves as a nontrivial example that incorporates and characterizes essential operations such as qubit reuse (qubit reset), entangling circuits, and measurement. These operations are not only vital for near-term noisy intermediate-scale quantum (NISQ) applications but are also crucial for realizing future error-correcting codes.