Stu ☕️
Stu Stuart Wayland

PhD Student and Founder

University of California, Santa Cruz
Krv Labs

I’m a PhD student researching optimization in synthetic quantum systems, with a focus on graph-theoretic problems and variational algorithms.

Download Résumé

Experience

  1. Founder

    Krv Labs

    Founder of Krv Labs, the clinical trial platform for AI models. Krv Labs stress-tests healthcare algorithms before deployment to ensure safety, reliability, and FDA compliance.

    Key focuses include:

    • Identifying failure modes such as data shifts and missing labs
    • Providing clinical evidence to maintain non-device status under 2026 CDS guidance
    • Backed by NVIDIA Inception and Berkeley SkyDeck

    Responsibilities:

    • Leading core architecture design and implementation of stress-testing frameworks
    • Managing technical strategy and team expansion in the healthcare AI space

  2. Software Developer

    Allosphere, UCSB

    Developed audio software for the allolib C++ audio library in UCSB’s immersive multimedia data center, the Allosphere.

    Responsibilities include:

    • Researched tonal analysis using trigonometric representations of instrumentation
    • Designed a C++ library for automated multi-instrument accompaniment based on user-defined theoretical music parameters

  3. Software/Research Developer

    Encryptek LLC

    Research and development for a cybersecurity startup focused on extending proprietary secure communication technologies.

    Responsibilities include:

    • Investigated deployment strategies and optimization regimes for client security platforms
    • Designed and prototyped advanced cryptographic tooling

Education

  1. PhD in Computer Science

    University of California, Santa Cruz

    Pursuing a PhD in the Baskin School of Engineering under the supervision of Prof. Alexandra Kolla.

    Research areas include:

    • Local Hamiltonian Problems
    • Constraint Satisfaction Problems
    • Spectral Graph Theory
    • Lie Algebras
    • SDP Relaxations and Rounding Algorithms

  2. B.S. in Mathematics and Computer Science

    University of California, Santa Barbara

    Dual degree in Mathematics and Computer Science with a minor in Music.

    GPA:

    • Math Upper Division: 3.53
    • CS Upper Division: 3.57
    • Overall: 3.61

    Relevant coursework:

    • Algorithms and Complexity
    • Abstract Algebra
    • Markov Chains
    • Set Theory
    • Linear Algebra
    • Data Science
Skills & Hobbies
Technical Skills
Python
Mathematica
QISKIT
Hobbies
Surfing
Climbing
Music
Papers
📃 Monogamy of Entanglement Bounds and Improved Approximation Algorithms for Qudit Hamiltonians
QIP ∙ October 2024
This work establishes new entanglement monogamy bounds for two-local qudit Hamiltonians and certifies ground state energy using sum-of-squares proofs. A simple matching-based algorithm achieves better-than-random approximations, including a 0.595 guarantee for qubits, outperforming prior results on bounded-degree graphs.
📃 Approximation Algorithms for Quantum Max-d-Cut
QIP ∙ September 2023
The Quantum Max-d-Cut problem seeks quantum states maximizing antisymmetric subspace energy in d-dimensional systems, generalizing Max-d-Cut. The authors provide a polynomial-time approximation algorithm with performance guarantees and prove its tightness using a gap instance for d≥3
📃 Quantifying Gerrymandering with Simulated Annealing
Undergraduate Thesis ∙ June 2022
This work applies Markov Chain Monte Carlo with Simulated Annealing to detect gerrymandering, showing it effectively generates representative voting distributions. Results on Texas demonstrate its speed and reliability in identifying bias in districting plans, offering a powerful analytical tool.
Fields of Interest
98%
Non-commutative Graphs
92%
Local Hamiltonians
82%
Spectral Graph Theory