Dulwich Quantum Computing

@dulwichquantum.bsky.social

2235 Followers 1152 Following

Parody quantum computing startup from South London https://dulwichquantum.github.io/

"Daily Bread" toaster with a stack of toasted bread slices with Jesus on them.
Vice-admiral Sir Tony Johnstone-Burt, master of the household to the sovereign, holds a battery-powered fan for King Charles as he attends a London Climate Action Week reception at St James’s Palace
Singer Sam Smith looks like a deco-era Georges Lepape fashion illustration come to life in a double feathered headdress and glittering black opera cloak, designed by their partner, Christian Cowan.
https://arxiv.org/abs/math/0202246
Clinton Folger was the mail carrier for Nantucket. Because cars were forbidden by the town, he towed his car to the state highway for driving to Siasconset.
peter-shor.bsky.social‬ and 7 others liked your post · 37m It would be hugely disappointing if the device that was officially announced as "lending credence to the notion that quantum computation occurs in many parallel universes" and whose predecessor was used to "create a wormhole" would now be used by mere mortals to simulate some boring Hamiltonian.
The fact that no CPTP map can annihilate σz while preserving σx and σy is known, in quantum information folklore, as the “No-Pancake Theorem”. Our central result might be thought of as a fully general No-Pancake Theorem, since it rules out the dynamical superselection of all such non-algebraic IPS
Definition 2.1 (Felinity of a quantum state). For a n-qubit state ρ, the felinity of ρ, F n(ρ) ∈ [0, 1] is defined as...
This is indeed a surprising result, provided that every piece can be confidently verified by a third party and that all assumptions can be further justified. Since this work appears to make more assumptions than prior work, that somewhat weakens the baseline. Below, I list all 11 places in the paper that contain “assume” or related forms: Assumes non-local connectivity. Here, we assume a 1 ms stabilizer measurement cycle. We assume that each surgery gadget is implemented in (\tau_s \approx 2d/3) code cycles, where (d) denotes the distance of the processor code. We assume that each layer of surgery takes (\tau_{\mathrm{cult.s}} = 2d_s/3) code cycles, which often minimizes the total logical error rate. In the above, we assumed that for each (C_i), the involved (m_i) qubits are read from memory at the beginning and written back to memory at the end. For the balanced architecture, we assume that (2q_a < k_p), so that the processor can store the (2q_a) qubits needed for unary iteration while still leaving enough space to apply the word operators. For the ECC-256 algorithm, based on compilations in [116--120], we assume the following split in the Toffoli count among controlled adders, adders, and lookups: 40% for 256-bit adders, 50% for 256-bit controlled adders, 10% for lookups with 16 address bits and word size 256. In addition, we assume the existence of logical gadgets capable of measuring many logically disjoint PPMs on high-rate codes in parallel. For (P < 600) ((P \geq 600)), we assume processor encoding rates of (r = 20\%) ((r = 30\%)), based on upcoming work [125]. We assume that these codes have the same rate as the processor, except when (P < 100), where we assume a lower encoding rate of 4% to allow transversal coupling of smaller block sizes (e.g., the bb18 code). To account for larger codes and more complex PPMs, we consider (\gamma = 1\text{--}3) and plot results for (\gamma = 2…
Google going both for superconducting qubits as well as neutral atoms
Gilles Brassard explains how he met Charlie Bennet on a beach in 1979.
From a chemical and biochemical perspective, computing the ground-state energy of a model to some specified accuracy – even chemical accuracy – is a highly artificial target. Most chemical calculations that have an impact on our understanding never achieve or even target chemical accuracy in the total energy. In addition, chemistry does not depend on the the total energy, but the relative energy of different chemical configurations, which typically differ only by O(1) changes in the bonding and chemistry.
While it is true that the nitrogenase enzyme functions at ambient temperature and pressure, it is simply false that it consumes much less energy. This is because the large amount of energy required for nitrogen fixation mainly originates from thermodynamics, i.e. one needs energy to break the strong nitrogen triple bond. In fact, taking into account the physiological conditions and the ATP cost, bacteria arguably expend more energy to reduce ammonia (Chan 2024) than a modern efficient industrial implementation of the Haber-Bosch process. Thus the real hope behind trying to understand the nitrogenase mechanism in the context of societal impact is that we may one day engineer a variant of it with more desirable properties, e.g. with higher turnover, or with a lower carbon footprint, or which is more selective for nitrogen reduction. Whether this is actually possible remains to be seen, and certainly requires much more than knowing the ground-state of FeMo-co, or even the full reaction mechanism.
Figure 1: The tensor spider T with 6 legs
Cameraman at Olympic figure skating.
Old man sunbathing
Ordering An ordering of volumes is no longer possible, but all volumes of this series are available in almost all university libraries in Germany.
[mtl] Too many to list. 2
Many of the potential applications of Hamiltonian simulation are not algorithms themselves, but rather, the idea that having a better understanding of certain physical or chemical systems would likely lead to new scientific and technological breakthroughs. Some of these are well worked out ideas (for example, nitrogen fixation [RWS+17]), but many of them are very tenuous, which unfortunately does not stop popular science news, and technology-enthusiasts who have decided to make a career talking a lot about quantum computing without really understanding it, from treating such applications as being just around the corner. You will find headlines and ted talks claiming quantum computers can solve every futuristic-sounding problem, including fixing climate change [mtl], curing cancer [Kak24], and finding the secret to immortality [Gre20]. I mean, science could solve any of these (but could it?), and faster Hamiltonian simulation would mean we can do better science, so. . . The reality is, there probably will be many applications to being able to simulate physical systems, but we do not yet know what they will be. We will not discuss applications of Hamiltonian simulation in this course, but it is important to understand that there is a lot of hype around quantum computing, some of which is justified, and some of which is not.
The term exotic is typically used to refer to derivatives that are path-dependent and/or depend on non- standard underlyings. This is in contrast to vanillas, which are frequently traded derivatives, e.g. European options, that are path-independent and depend on simple underlyings, like equities.
Dorit Aharonov speaking at QIP2026
Sketch of quantum warfare utilising various quantum technology systems
María Corina Machado presented Donald Trump with her Nobel peace prize medal on Thursday, but the Nobel’s organisers said the prize ‘cannot be revoked, shared or transferred’. Photograph: Daniel Torok/The White House/Reuters
Car turning meme with "solving world hunger" vs "Solving climate change" for quantum startups.
Inauguration of Zohran Mamdani as mayor of New York City
I Am Currently Away From My Desk by Brooke DiDonato, 2022
Wake-Up Call by Brooke DiDonato, 2019
Bernie meme: I am once again pointing out that D-Wave has been outperformed classically
‘A stylish dog takes part in the Paris Sausage Walk on 16 November 2025.’ Paris, France
New accound following Dulwich and Bluesky only.
Particle physicists Martin White (left) of the University of Adelaide in Australia and Chris White of Queen Mary University of London have always wanted to work together. Last year, the identical twins finally did so, proposing a way to detect the magic of top quarks.
It’s like this: if you think quantum computers able to break 2048-bit cryptography within 3-5 years are a near-certainty, then I’d say your confidence is unwarranted. If you think such quantum computers, once built, will also quickly revolutionize optimization and machine learning and finance and countless other domains beyond quantum simulation and cryptanalysis—then I’d say that more likely than not, an unscrupulous person has lied to you about our current understanding of quantum algorithms.