We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximation scheme for the partition function when the interactions and external fields are absolutely bounded close to zero. Furthermore, we prove that for this class of Ising models the partition function does not vanish. Our algorithm is based on an approach due to Barvinok for approximating evaluations of a polynomial based on the location of the complex zeros and a technique due to Patel and Regts for efficiently computing the leading coefficients of graph polynomials on bounded degree graphs. Finally, we show how our algorithm can be extended to approximate certain output probability amplitudes of quantum circuits.
The 2023 Boyer Lecture series is called 'The Atomic Revolution' and is presented by Professor Michelle Simmons AO, a pioneer in atomic electronics and global leader in quantum computing.READ
CQC2T Director Professor Michelle Simmons AO and Chief Investigator Professor Yuerui (Larry) Lui were recognised in the prestigious 2023 Prime Minister’s award ceremony held at Parliament House last nREAD
An international team of researchers has developed a technology that has shattered a world record in continuous variable quantum teleportation. This latest technology offers a viable pathway enroute tREAD
Fault-tolerant, error-corrected quantum computation is commonly acknowledged to be crucial to the realisation of large-scale quantum algorithms that could lead to extremely impactful scientific or comREAD
Engineers show that a jellybean-shaped quantum dot creates more breathing space in a microchip packed with qubits.READ