Job Description
Join QuantumLeap Innovations at the forefront of technological evolution as we pioneer quantum computing solutions that will redefine the 2026 digital landscape. We seek visionary researchers to develop groundbreaking algorithms and hardware architectures that will solve previously impossible computational challenges. Our state-of-the-art facility in San Francisco offers unparalleled resources for innovation, including access to quantum simulators and collaborative partnerships with leading academic institutions.
This role offers a unique opportunity to shape the future of computing while working with Nobel laureates and industry pioneers. We provide comprehensive benefits including equity packages, flexible work arrangements, and dedicated research funding. Candidates will contribute to projects that could revolutionize fields from drug discovery to climate modeling.
Responsibilities
- Design and implement novel quantum algorithms for optimization and machine learning applications
- Collaborate with hardware teams to develop error correction protocols for quantum processors
- Lead cross-functional research initiatives in quantum cryptography and secure communications
- Publish findings in peer-reviewed journals and present at international conferences
- Secure external funding through government grants and industry partnerships
- Mentor junior researchers and supervise graduate student projects
- Develop roadmaps for quantum computing integration with classical systems
Qualifications
- PhD in Quantum Computing, Physics, Computer Science, or related field
- 3+ years of hands-on experience with quantum programming languages (Qiskit, Cirq, or Q#)
- Publication record in top-tier quantum computing journals (Nature, Science, PRL)
- Expertise in quantum error correction and fault-tolerant architectures
- Proficiency in Python, C++, and high-performance computing frameworks
- Demonstrated ability to secure research grants exceeding $500K
- Strong background in linear algebra, probability theory, and computational complexity