WSWilliam A. Simon

William A. Simon

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


William A. Simon has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Halving the arbitrary rotation cost of controlled, Trotterized time evolution

    by William A. Simon, Peter J. Love

    Quantum simulation is a promising application for quantum computing. Quantum simulation algorithms may require the ability to control the time evolution unitary. Naive techniques to control a unitary can substantially increase the required computational resources. A standard approach to controlling Trotterized time evolution doubles the number of single-qubit arbitrary rotations. Here, we describe a compilation scheme to control a symmetric Trotterization that does not increase the number of arbitrary rotations. This halves the number of arbitrary rotations required to implement controlled, Trotterized time evolution compared to the standard approach. Arbitrary rotations contribute significantly to $T$ cost in a fault-tolerant architecture due to the number of required magic states. Therefore, arbitrary rotations often dominate resource estimates for fault-tolerant implementations of quantum simulation algorithms. This construction reduces the number of arbitrary rotations for controlled Trotter evolution to that of uncontrolled Trotter evolution, thereby reducing the cost of fault-tolerant quantum simulation.

  • Open Access

    Ladder Operator Block-Encoding

    by William A. Simon, Carter M. Gustin, Kamil Serafin, Alexis Ralli, Gary R. Goldstein, Peter J. Love

    We describe and analyze LOBE (Ladder Operator Block-Encoding), a framework for block-encoding ladder operators that act upon fermionic and bosonic modes. In this framework, we achieve efficient block-encodings by applying the desired action of the operator onto the quantum state and pushing any undesired effects outside of the encoded subspace. This direct approach avoids any overhead caused by expanding the operators in another basis. We numerically benchmark these constructions using models arising in quantum field theories including the quartic harmonic oscillator, and ϕ 4 and Yukawa Hamiltonians on the light front. These benchmarks show that LOBE often produces block-encodings with fewer non-Clifford operations, fewer block-encoding ancillae and overall number of qubits, and lower rescaling factors for various operators as compared to frameworks that expand the ladder operators in the Pauli basis. LOBE constructions also demonstrate favorable scaling with respect to key parameters, including the maximum occupation of bosonic modes, the total number of fermionic and bosonic modes, and the locality of the operators. LOBE is implemented as an open-source python package to enable further applications.


  • Carleman-lattice-Boltzmann quantum circuit with matrix access oracles

    by Claudio Sanavio, William A. Simon, Alexis Ralli, Peter Love, Sauro Succi

    We apply Carleman linearization of the Lattice Boltzmann (CLB) representation of fluid flows to quantum emulate the dynamics of a two-dimensional Kolmogorov-like flow. We assess the accuracy of the result and find a relative error of the order of 10−3 with just two Carleman iterates for a range of the Reynolds number up to a few hundreds. We first define a gate-based quantum circuit for the implementation of the CLB method and then exploit the sparse nature of the CLB matrix to build a quantum circuit based on block-encoding techniques which makes use of matrix oracles. It is shown that the gate complexity of the algorithm is thereby dramatically reduced, from exponential to quadratic. However, due to the need of employing up to seven ancilla qubits, the probability of success of the corresponding circuit for a single time step is too low to enable multi-step time evolution. Several possible directions to circumvent this problem are briefly outlined.


  • Open Access

    Analyzing the performance of variational quantum factoring on a superconducting quantum processor

    by Amir H. Karamlou, William A. Simon, Amara Katabarwa, Travis L. Scholten, Borja Peropadre, Yudong Cao

    In the near-term, hybrid quantum-classical algorithms hold great potential for outperforming classical approaches. Understanding how these two computing paradigms work in tandem is critical for identifying areas where such hybrid algorithms could provide a quantum advantage. In this work, we study a QAOA-based quantum optimization approach by implementing the Variational Quantum Factoring (VQF) algorithm. We execute experimental demonstrations using a superconducting quantum processor, and investigate the trade off between quantum resources (number of qubits and circuit depth) and the probability that a given biprime is successfully factored. In our experiments, the integers 1099551473989, 3127, and 6557 are factored with 3, 4, and 5 qubits, respectively, using a QAOA ansatz with up to 8 layers and we are able to identify the optimal number of circuit layers for a given instance to maximize success probability. Furthermore, we demonstrate the impact of different noise sources on the performance of QAOA, and reveal the coherent error caused by the residual ZZ-coupling between qubits as a dominant source of error in a near-term superconducting quantum processor.