We are seeking physicists, computer scientists, mathematicians, and engineers to contribute to the architecture and strategy of error correction on neutral atom quantum computers. Atomic qubit arrays provide a path to the large-scale quantum computers that will deliver error-corrected logical qubits and fault-tolerant operations.
Responsibilities- Developing and optimizing fault-tolerance schemes for gate-based atomic array quantum computers
- Developing and evaluating optimization strategies for atom movement during fault-tolerant computation
- Collaborating with software and control systems teams to implement classical compute layers necessary for fault-tolerant computation
- Developing and implementing decoders
- Developing and maintaining tools for quantum simulation
- Implementation of error correction on quantum hardware
Experience & Education- PhD in Physics, Mathematics, Computer Science, or a related field.
- Experience with quantum error correction theory or experiment
Qualifications- Willingness to translate abstract ideas into concrete demonstrations running on actual quantum hardware.
- Temperamentally suited to work at a fast-growing, early stage startup: self-motivated, humble, driven, collaborative, and has a high tolerance for ambiguity and uncertainty.
- Ability to effectively communicate and collaborate with a diverse team of experimental physicists, hardware, and software engineers.
- Familiarity with Python and Git software version control
Atom Computing provides a wide variety of perks and benefits, including fully paid medical, dental, and vision insurance for our employees and their dependents. Additionally, unlimited paid time off, 401K company matching, short- and long-term disability, FSA, dependent care benefits, and life insurance. We also offer drinks, snacks, and catered team lunches in our offices, every day!
The base salary range for this position is between $160,000 - $185,000, commensurate with experience. In addition to salary, we offer an annual bonus and equity in the company.
