Computation Model: Logic Gates
All systems with computation model: logic-gates
Systems (6)
Billiard-ball computer
f(x) = reversible boolean logic (Fredkin gate)
Proposed by Fredkin & Toffoli (1982). Balls travel on paths representing wires; presence/absence of a ball encodes a bit. Collisions at path intersections implement logic gates. Logically and thermody...
Gate-based quantum computer
f(x) = unitary quantum computation / quantum algorithms (Shor factoring, Grover search, VQE)
A register of qubits — typically superconducting transmons cooled to ~10 mK — whose state is manipulated by sequences of microwave pulses implementing one- and two-qubit unitary gates. Any computation...
Liquid marble computer
f(x) = boolean logic / reversible gates (AND, XOR, OR, NOT, Toffoli, Fredkin)
Liquid marbles are millimetre-scale droplets coated with hydrophobic powder that makes them roll freely without wetting surfaces. Computation is collision-based: two marbles directed at an intersectio...
Marble computer
f(x) = binary arithmetic / boolean logic
Gravity-fed marble runs with rocker/seesaw gates implement binary arithmetic and logic operations. One marble = 1 bit. The rocker flips state on each pass, implementing half-adders and logic gates. Th...
Quantum and quantum-inspired annealers
f(x) = Ising model energy minimization / QUBO optimization
Quantum and quantum-inspired systems for solving combinatorial optimization problems through annealing processes. Includes true quantum annealers (D-Wave) using superconducting qubits and quantum-insp...
Quantum gate computer (superconducting qubits)
f(x) = unitary transformations / quantum algorithms
Superconducting qubits manipulated by microwave pulses to perform unitary operations. Quantum gates like Hadamard, CNOT, and phase gates enable quantum algorithms such as Shor's factoring and Grover's...