5 papers
Quantum-to-classical transition via quantum cellular automata
Pedro C. S. Costa
A quantum cellular automaton (QCA) is an abstract model consisting of an array of finite-dimensional quantum systems that evolves in discrete time by local unitary operations. Here…
Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
Yuval R. Sanders, Dominic W. Berry, Pedro C. S. Costa +5
Here we explore which heuristic quantum algorithms for combinatorial optimization might be most practical to try out on a small fault-tolerant quantum computer. We compile circuits…
Multiparticle quantum walk with a gas-like interaction
Pedro C. S. Costa, Fernando de Melo, Renato Portugal
We analyze the dynamics of multiparticle discrete-time quantum walk on the two-dimensional lattice, with an interaction inspired on a classical model for gas collision, called HPP…
Coarse Graining of Partitioned Cellular Automata
Pedro C. S. Costa, Fernando de Melo
Partitioned cellular automata are known to be an useful tool to simulate linear and nonlinear problems in physics, specially because they allow for a straightforward way to define…
Quantum Walks via Quantum Cellular Automata
Pedro C. S. Costa, Renato Portugal, Fernando de Melo
Very much as its classical counterpart, quantum cellular automata are expected to be a great tool for simulating complex quantum systems. Here we introduce a partitioned model of q…