Quantum State Preparation Using an Exact CNOT Synthesis Formulation

• URL: http://arxiv.org/abs/2401.01009v1
• Date: Tue, 2 Jan 2024 03:37:00 GMT
• Title: Quantum State Preparation Using an Exact CNOT Synthesis Formulation
• Authors: Hanyu Wang, Bochen Tan, Jason Cong, Giovanni De Micheli
• Abstract summary: Minimizing the use of CNOT gates in quantum state preparation is a crucial step in quantum compilation. We propose an effective state preparation algorithm using an exact CNOT synthesis formulation.
• Score: 8.078625517374967
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Minimizing the use of CNOT gates in quantum state preparation is a crucial step in quantum compilation, as they introduce coupling constraints and more noise than single-qubit gates. Reducing the number of CNOT gates can lead to more efficient and accurate quantum computations. However, the lack of compatibility to model superposition and entanglement challenges the scalability and optimality of CNOT optimization algorithms on classical computers. In this paper, we propose an effective state preparation algorithm using an exact CNOT synthesis formulation. Our method represents a milestone as the first design automation algorithm to surpass manual design, reducing the best CNOT numbers to prepare a Dicke state by 2x. For general states with up to 20 qubits, our method reduces the CNOT number by 9% and 32% for dense and sparse states, on average, compared to the latest algorithms.

Related papers

• Efficient Algorithms for Quantum Hashing [0.0]
  We present a circuit that implements the phase form of quantum hashing using $2n-1$ CNOT gates.<n>We also propose an algorithm that provides a trade-off between the number of CNOT gates and the precision of rotation angles.
  arXiv  Detail & Related papers  (2025-07-09T16:32:15Z)
• Pushing the Limits of Low-Bit Optimizers: A Focus on EMA Dynamics [64.62231094774211]
  Statefuls (e.g., Adam) maintain auxiliary information even 2x the model size in order to achieve optimal convergence.<n>SOLO enables Adam-styles to maintain quantized states with precision as low as 3 bits, or even 2 bits.<n>SOLO can thus be seamlessly applied to Adam-styles, leading to substantial memory savings with minimal accuracy loss.
  arXiv  Detail & Related papers  (2025-05-01T06:47:45Z)
• Efficient State Preparation for the Schwinger Model with a Theta Term [0.0]
  We present a comparison of different quantum state preparation algorithms for the Schwinger model. We obtain the best results when combining the blocked QAOA ansatz and the RA.
  arXiv  Detail & Related papers  (2024-10-31T22:49:09Z)
• Quantum State Preparation Circuit Optimization Exploiting Don't Cares [6.158168913938158]
  Quantum state preparation initializes the quantum registers and is essential for running quantum algorithms. Existing methods synthesize an initial circuit and leverage compilers to reduce the circuit's gate count. We introduce a peephole optimization algorithm that identifies such unitaries for replacement in the original circuit.
  arXiv  Detail & Related papers  (2024-09-02T18:40:42Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Approximate encoding of quantum states using shallow circuits [0.0]
  A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. Here, we aim at creating an approximate encoding of the target state using a limited number of gates. Our work offers a universal method to prepare target states using local gates and represents a significant improvement over known strategies.
  arXiv  Detail & Related papers  (2022-06-30T18:00:04Z)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• CNOT-count optimized quantum circuit of the Shor's algorithm [8.88308897530269]
  We present improved quantum circuit for modular exponentiation of a constant, which is the most expensive operation in Shor's algorithm for integer factorization. According to the number of CNOT gates, we analyze the running time and feasibility of Shor's algorithm on a ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-21T16:56:22Z)
• Universal quantum state preparation via revised greedy algorithm [2.718317980347176]
  We propose a revised version to design dynamic pulses to realize universal quantum state preparation. We implement this scheme to the universal preparation of single- and two-qubit state in the context of semiconductor quantum dots and superconducting circuits.
  arXiv  Detail & Related papers  (2021-08-07T02:44:15Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.