While rigorous quantum dynamical simulations of many-body systems are extremely difficult (or impossible) due to exponential scaling with dimensionality, the corresponding classical simulations ignore quantum effects. Semiclassical methods are generally more efficient but less accurate than quantum methods and more accurate but less efficient than classical methods. We find a remarkable exception to this rule by showing that a semiclassical method can be both more accurate and faster than a classical simulation. Specifically, we prove that for the semiclassical dephasing representation the number of trajectories needed to simulate quantum fidelity is independent of dimensionality and also that this semiclassical method is even faster than t...
www.cs.auckland.ac.nz/~{aabb009,cristian} While it seems possible that quantum computers may allow f...
We propose a quantum algorithm which uses the number of qubits in an optimal way and efficiently sim...
Quantum annealing aims at finding optimal solutions to complex optimization problems using a suitabl...
We analyze the efficiency of available algorithms for the simulation of classical fidelity and show ...
Semiclassical approximations for quantum dynamic simulations in complex chemical systems range from ...
We present a numerically feasible semiclassical (SC) method to evaluate quantum fidelity decay (Losc...
We present a time-dependent semiclassical method based on quantum trajectories. Quantum-mechanical e...
Semiclassical approaches to chemical dynamics show great promise as methods to obtain practical resu...
We propose a quantum algorithm which uses the number of qubits in an optimal way and efficiently sim...
Quantum simulation is a prominent application of quantum computers. While there is extensive previou...
We introduce novel algorithms for the quantum simulation of fermionic systems which are dramatically...
We study the trajectories of a semiclassical quantum particle under repeated indirect measurement by...
It has been recently noted in a paper by Brandao et al. that the structure of a linear program in a ...
A new semiclassical "divide-and-conquer" method is presented with the aim of demonstrating that quan...
While it seems possible that quantum computers may allow for algorithms offering a computational spe...
www.cs.auckland.ac.nz/~{aabb009,cristian} While it seems possible that quantum computers may allow f...
We propose a quantum algorithm which uses the number of qubits in an optimal way and efficiently sim...
Quantum annealing aims at finding optimal solutions to complex optimization problems using a suitabl...
We analyze the efficiency of available algorithms for the simulation of classical fidelity and show ...
Semiclassical approximations for quantum dynamic simulations in complex chemical systems range from ...
We present a numerically feasible semiclassical (SC) method to evaluate quantum fidelity decay (Losc...
We present a time-dependent semiclassical method based on quantum trajectories. Quantum-mechanical e...
Semiclassical approaches to chemical dynamics show great promise as methods to obtain practical resu...
We propose a quantum algorithm which uses the number of qubits in an optimal way and efficiently sim...
Quantum simulation is a prominent application of quantum computers. While there is extensive previou...
We introduce novel algorithms for the quantum simulation of fermionic systems which are dramatically...
We study the trajectories of a semiclassical quantum particle under repeated indirect measurement by...
It has been recently noted in a paper by Brandao et al. that the structure of a linear program in a ...
A new semiclassical "divide-and-conquer" method is presented with the aim of demonstrating that quan...
While it seems possible that quantum computers may allow for algorithms offering a computational spe...
www.cs.auckland.ac.nz/~{aabb009,cristian} While it seems possible that quantum computers may allow f...
We propose a quantum algorithm which uses the number of qubits in an optimal way and efficiently sim...
Quantum annealing aims at finding optimal solutions to complex optimization problems using a suitabl...