In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...

Abstract We consider different linear combination of unitaries (LCU) decompositions for molecular electronic structure Hamiltonians. Using these LCU Hamiltonian simulation on a quantum computer, the main figure merit is 1-norm their coefficients, which associated with circuit complexity. It derived that lowest possible given half its spectral range. This norm decomposition practically unattaina...

Black-box quantum state preparation is a fundamental primitive in algorithms. Starting from Grover, series of techniques have been devised to reduce the complexity. In this work, we propose perform black-box using technique linear combination unitaries (LCU). We provide two algorithms based on different structure LCU. Our improve upon existed best results by reducing required additional qubits ...