Itay Hen
YOU?
Author Swipe
View article: Accounting for gauge symmetries in CHSH experiments
Accounting for gauge symmetries in CHSH experiments Open
We re-examine the CHSH experiment, which we abstract here as a multi-round game played between two parties with each party reporting a single binary outcome at each round. We explore in particular the role that symmetries, and the spontane…
View article: A simple quantum simulation algorithm with near-optimal precision scaling
A simple quantum simulation algorithm with near-optimal precision scaling Open
Quantum simulation is a foundational application for quantum computers, projected to offer insights into complex quantum systems beyond the reach of classical computation. However, with the exception of Trotter-based methods, which suffer …
View article: Quantifying the impact of precision errors on quantum approximate optimization algorithms
Quantifying the impact of precision errors on quantum approximate optimization algorithms Open
The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that seeks to achieve approximate solutions to optimization problems by iteratively alternating between intervals of controlled quantum evolution…
View article: A quantum Monte Carlo algorithm for arbitrary high-spin Hamiltonians
A quantum Monte Carlo algorithm for arbitrary high-spin Hamiltonians Open
We present a universal parameter-free quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than $1/2$) Hamiltonians. This approach extends a previously developed method by the authors for spin-$1/2$ Hamiltonians […
View article: Feynman path integrals for discrete-variable systems: Walks on Hamiltonian graphs
Feynman path integrals for discrete-variable systems: Walks on Hamiltonian graphs Open
We propose a natural, parameter-free, discrete-variable formulation of Feynman path integrals. We show that for discrete-variable quantum systems, Feynman path integrals take the form of walks on the graph whose weighted adjacency matrix i…
View article: A simple quantum simulation algorithm with near-optimal precision scaling
A simple quantum simulation algorithm with near-optimal precision scaling Open
Quantum simulation is a foundational application for quantum computers, projected to offer insights into complex quantum systems beyond the reach of classical computation. However, with the exception of Trotter-based methods, which suffer …
View article: A universal black-box quantum Monte Carlo approach to quantum phase transitions
A universal black-box quantum Monte Carlo approach to quantum phase transitions Open
We derive exact, universal, closed-form quantum Monte Carlo estimators for finite-temperature energy susceptibility and fidelity susceptibility, applicable to essentially arbitrary Hamiltonians. Combined with recent advancements in Monte C…
View article: ClassiFIM: An Unsupervised Method To Detect Phase Transitions
ClassiFIM: An Unsupervised Method To Detect Phase Transitions Open
Estimation of the Fisher Information Metric (FIM-estimation) is an important task that arises in unsupervised learning of phase transitions, a problem proposed by physicists. This work completes the definition of the task by defining rigor…
View article: Feynman path integrals for discrete-variable systems: Walks on Hamiltonian graphs
Feynman path integrals for discrete-variable systems: Walks on Hamiltonian graphs Open
We propose a natural, parameter-free, discrete-variable formulation of Feynman path integrals. We show that for discrete-variable quantum systems, Feynman path integrals take the form of walks on the graph whose weighted adjacency matrix i…
View article: Q4Q: Quantum Computation for Quantum Prediction of Materials and Molecular Properties
Q4Q: Quantum Computation for Quantum Prediction of Materials and Molecular Properties Open
We aim at exploring the potential of quantum computation to solve practical problems that are currently targeted by “traditional” high performance computing (HPC). Along the way, we will develop theoretical frameworks and algorithmic strat…
View article: Quantum Monte Carlo algorithm for arbitrary spin-1/2 Hamiltonians
Quantum Monte Carlo algorithm for arbitrary spin-1/2 Hamiltonians Open
We present a universal parameter-free quantum Monte Carlo (QMC) algorithm designed to simulate arbitrary spin-1/2 Hamiltonians. To ensure the convergence of the Markov chain to equilibrium for every conceivable case, we devise a clear and …
View article: Accounting for gauge symmetries in CHSH experiments
Accounting for gauge symmetries in CHSH experiments Open
We re-examine the CHSH experiment, which we abstract here as a multi-round game played between two parties with each party reporting a single binary outcome at each round. We explore in particular the role that symmetries, and the spontane…
View article: Exploiting Maximally Mixed States for Spectral Estimation by Time Evolution
Exploiting Maximally Mixed States for Spectral Estimation by Time Evolution Open
We introduce a novel approach for estimating the spectrum of quantum many-body Hamiltonians, and more generally, of Hermitian operators, using quantum time evolution. In our approach we are evolving a maximally mixed state under the Hamilt…
View article: A quantum Monte Carlo algorithm for Bose-Hubbard models on arbitrary graphs
A quantum Monte Carlo algorithm for Bose-Hubbard models on arbitrary graphs Open
We propose a quantum Monte Carlo algorithm capable of simulating the Bose-Hubbard model on arbitrary graphs, obviating the need for devising lattice-specific updates for different input graphs. We show that with our method, which is based …
View article: A quantum Monte Carlo algorithm for arbitrary spin-1/2 Hamiltonians
A quantum Monte Carlo algorithm for arbitrary spin-1/2 Hamiltonians Open
We present a universal parameter-free quantum Monte Carlo (QMC) algorithm designed to simulate arbitrary spin-$1/2$ Hamiltonians. To ensure the convergence of the Markov chain to equilibrium for every conceivable case, we devise a clear an…
View article: Q-CASA Invited Speaker Simulating Hamiltonian Dynamics with the Off-diagonal Series Expansion
Q-CASA Invited Speaker Simulating Hamiltonian Dynamics with the Off-diagonal Series Expansion Open
I will discuss a novel quantum algorithm for simulating the dynamics of general time-dependent as well as time-independent Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-di…
View article: Localization transition induced by programmable disorder
Localization transition induced by programmable disorder Open
We investigate the occurrence of many-body localization (MBL) on a spin-1/2 transverse-field Ising model defined on a Chimera connectivity graph with random exchange interactions and longitudinal fields. We observe a transition from an erg…
View article: 3-regular three-XORSAT planted solutions benchmark of classical and quantum heuristic optimizers
3-regular three-XORSAT planted solutions benchmark of classical and quantum heuristic optimizers Open
With current semiconductor technology reaching its physical limits, special-purpose hardware has emerged as an option to tackle specific computing-intensive challenges. Optimization in the form of solving quadratic unconstrained binary opt…
View article: Bell-type games on deformable manifolds
Bell-type games on deformable manifolds Open
We study bipartite correlations in Bell-type games. We show that in a setup where the information carriers are allowed to locally deform the manifold on which the game is played, stronger correlations may be obtained than those maximally a…
View article: Quantifying the Impact of Precision Errors on Quantum Approximate Optimization Algorithms
Quantifying the Impact of Precision Errors on Quantum Approximate Optimization Algorithms Open
The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that seeks to achieve approximate solutions to optimization problems by iteratively alternating between intervals of controlled quantum evolution…
View article: Quantum Algorithm for Time-Dependent Hamiltonian Simulation by Permutation Expansion
Quantum Algorithm for Time-Dependent Hamiltonian Simulation by Permutation Expansion Open
We present a quantum algorithm for the dynamical simulation of time-dependent\nHamiltonians. Our method involves expanding the interaction-picture Hamiltonian\nas a sum of generalized permutations, which leads to an integral-free Dyson\nse…
View article: Observation of many-body localization in an experimental quantum annealer
Observation of many-body localization in an experimental quantum annealer Open
We investigate the occurrence of the phenomenon of many-body localization (MBL) on a D-Wave 2000Q programmable quantum annealer. We study a spin-1/2 transverse-field Ising model defined on a Chimera connectivity graph, with random exchange…
View article: Localization transition induced by programmable disorder
Localization transition induced by programmable disorder Open
We investigate the occurrence of many-body localization (MBL) on a spin-1/2\ntransverse-field Ising model defined on a Chimera connectivity graph with\nrandom exchange interactions and longitudinal fields. We observe a transition\nfrom an …
View article: Testing a Quantum Annealer as a Quantum Thermal Sampler
Testing a Quantum Annealer as a Quantum Thermal Sampler Open
Motivated by recent experiments in which specific thermal properties of complex many-body systems were successfully reproduced on a commercially available quantum annealer, we examine the extent to which quantum annealing hardware can reli…
View article: Efficient simulation of so-called non-stoquastic superconducting flux\n circuits
Efficient simulation of so-called non-stoquastic superconducting flux\n circuits Open
There is a tremendous interest in fabricating superconducting flux circuits\nthat are nonstoquastic---i.e., have positive off-diagonal matrix elements---in\ntheir qubit representation, as these circuits are thought to be unsimulable by\ncl…
View article: Efficient simulation of so-called non-stoquastic superconducting flux circuits
Efficient simulation of so-called non-stoquastic superconducting flux circuits Open
There is a tremendous interest in fabricating superconducting flux circuits that are nonstoquastic---i.e., have positive off-diagonal matrix elements---in their qubit representation, as these circuits are thought to be unsimulable by class…
View article: De-Signing Hamiltonians for Quantum Adiabatic Optimization
De-Signing Hamiltonians for Quantum Adiabatic Optimization Open
Quantum fluctuations driven by non-stoquastic Hamiltonians have been conjectured to be an important and perhaps essential missing ingredient for achieving a quantum advantage with adiabatic optimization. We introduce a transformation that …
View article: Discriminating nonisomorphic graphs with an experimental quantum annealer
Discriminating nonisomorphic graphs with an experimental quantum annealer Open
We demonstrate experimentally the ability of a quantum annealer to\ndistinguish between sets of non-isomorphic graphs that share the same classical\nIsing spectrum. Utilizing the pause-and-quench features recently introduced\ninto D-Wave q…
View article: Author Correction: Analog errors in quantum annealing: doom and hope
Author Correction: Analog errors in quantum annealing: doom and hope Open
An amendment to this paper has been published and can be accessed via a link at the top of the paper.