Quantum circuit design for mixture and preparation of arbitrary pure and mixed quantum states

• URL: http://arxiv.org/abs/2403.19172v1
• Date: Thu, 28 Mar 2024 06:37:00 GMT
• Title: Quantum circuit design for mixture and preparation of arbitrary pure and mixed quantum states
• Authors: Bo-Hung Chen, Dah-Wei Chiou, Jie-Hong Roland Jiang,
• Abstract summary: This paper addresses the challenge of preparing arbitrary mixed quantum states. Two circuit design methods are presented: one via a mixture of pure states and the other via purification.
• Score: 25.01488143369413
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper addresses the challenge of preparing arbitrary mixed quantum states, an area that has not been extensively studied compared to pure states. Two circuit design methods are presented: one via a mixture of pure states and the other via purification. A novel strategy utilizing the Cholesky decomposition is proposed to improve both computational efficiency during preprocessing and circuit efficiency in the resulting circuits, offering significant advantages, especially when the targeted density matrix is low-ranked or sparse. By leveraging the incomplete Cholesky decomposition with threshold dropping, we also propose an appealing strategy for generating a high-fidelity approximation of the targeted density matrix, enabling substantial efficiency enhancement at the cost of mild fidelity loss. Additionally, as a closely related issue, we prove the "no-superposing theorem": given a certain number of arbitrary unknown pure states as input, it is impossible to devise an operation that produces an output state as the superposition of the input states with predefined coefficients unless all but one of the coefficients vanish.

Related papers

• 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)
• Pure State Inspired Lossless Post-selected Quantum Metrology of Mixed States [3.4840877804354236]
  We show that quantum Fisher information can be losslessly compressed into a subensemble with a much smaller number of samples. We find that if the parametric derivative of the density operator of a mixed state, vanishes on the support of the density matrix, lossless post-selection can be achieved. Our results are useful for realistic post-selected quantum metrology in the presence of decoherence.
  arXiv  Detail & Related papers  (2024-05-01T09:21:06Z)
• Forward and Backward Constrained Bisimulations for Quantum Circuits using Decision Diagrams [3.788308836856851]
  We develop efficient methods for the simulation of quantum circuits on classic computers. In particular, we show that constrained bisimulation can boost decision-diagram-based quantum circuit simulation by several orders of magnitude.
  arXiv  Detail & Related papers  (2023-08-18T12:40:47Z)
• Randomized semi-quantum matrix processing [0.0]
  We present a hybrid quantum-classical framework for simulating generic matrix functions. The method is based on randomization over the Chebyshev approximation of the target function. We prove advantages on average depths, including quadratic speed-ups on costly parameters.
  arXiv  Detail & Related papers  (2023-07-21T18:00:28Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
  We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
  arXiv  Detail & Related papers  (2022-09-06T18:18:41Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Nonuniform-to-Uniform Quantization: Towards Accurate Quantization via Generalized Straight-Through Estimation [48.838691414561694]
  Nonuniform-to-Uniform Quantization (N2UQ) is a method that can maintain the strong representation ability of nonuniform methods while being hardware-friendly and efficient. N2UQ outperforms state-of-the-art nonuniform quantization methods by 0.71.8% on ImageNet.
  arXiv  Detail & Related papers  (2021-11-29T18:59:55Z)
• Dual-state purification for practical quantum error mitigation [5.625946422295428]
  Quantum error mitigation is essential for computing on the noisy quantum computer with a limited number of qubits. We propose a practical protocol of error mitigation by virtually purifying the quantum state without qubit overhead. We successfully demonstrate the reduced error with a quantum variational eigensolver circuit.
  arXiv  Detail & Related papers  (2021-05-04T01:33:35Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)

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.